Serveur d'exploration sur l'Université de Trèves - Checkpoint (PascalFrancis)

Index « FC03.fr.i » - entrée « Optimum global »
Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.
Optimisation sous contrainte < Optimum global < Optimum local  Facettes :

List of bibliographic references

Number of relevant bibliographic references: 18.
Ident.Authors (with country if any)Title
000111 (2013) Tien-Dung Le [Belgique]Learning resources in federated environments: a broken link checker based on URL similarity : ADVANCES IN METADATA AND SEMANTICS FOR LEARNING INFRASTRUCTURES: PART 1
000365 (2010) N. V. Thoai [Allemagne]Reverse Convex Programming Approach in the Space of Extreme Criteria for Optimization over Efficient Sets
000427 (2010) R. Horst [Allemagne]Bisecton by Global Optimization Revisited
000685 (2007) R. Horst [Allemagne] ; N. V. Thoai [Allemagne] ; Y. Yamamoto [Japon] ; D. Zenke [Japon]On optimization over the efficient set in linear multicriteria programming
000835 (2005) N. V. Thoai [Allemagne] ; Y. Yamamoto [Japon] ; A. Yoshise [Japon]Global optimization method for solving mathematical programs with linear complementarity constraints
000A82 (2002) Marco Locatelli [Italie] ; Ulrich Raber [Allemagne]Packing equal circles in a square: a deterministic global optimization approach
000B15 (2002) N. V. Thoai [Allemagne]Convergence and application of a decomposition method using duality bounds for nonconvex global optimization
000D04 (2000) N. V. Thoai [Allemagne]Duality bound method for the general quadratic programming problem with quadratic constraints
000D80 (1999) R. Horst [Allemagne] ; N. V. Thoai [Allemagne]Maximizing a concave function over the efficient or weakly-efficient set
001202 (1996) R. Horst [Allemagne] ; M. NastLinearly constrained global minimization of functions with concave minorants
001223 (1996) R. Horst [Allemagne] ; N. V. ThoaiDecomposition approach for the global minimization of biconcave functions over polytopes
001347 (1994) R. Horst [Allemagne] ; L. D. Muu ; M. Nast [Allemagne]Branch-and-bound decomposition approach for solving quasiconvex-concave programs
001422 (1993) N. Van Thoai [Allemagne]Canonical D.C. programming techniques for solving a convex program with an additional constraint of multiplicative type
001470 (1992) P. Gritzmann [Allemagne] ; V. KleeDeciding uniqueness in norm maximization
001473 (1992) R. Horst [Allemagne] ; N. V. ThoaiConical algorithm for the global minimization of linearly constrained decomposable concave minimization problems
001519 (1991) R. Horst [Allemagne] ; N. V. Thoai ; H. P. BensonConcave minimization via conical partitions and polyhedral outer approximation
001595 (1989) R. HorstOn consistency of bounding operations in deterministic global optimization
001631 (1988) R. Horst ; J. De Vries ; N. V. ThoaiOn finding new vertices and redundant constraints in cutting plane algorithms for global optimization

List of associated Author.i

Nombre de
documents
Descripteur
10N. V. Thoai
10R. Horst
2M. Nast
2Y. Yamamoto
1A. Yoshise
1D. Zenke
1H. P. Benson
1J. De Vries
1L. D. Muu
1Marco Locatelli
1N. Van Thoai
1P. Gritzmann
1Tien-Dung Le
1Ulrich Raber
1V. Klee

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/PascalFrancis/Checkpoint
HfdIndexSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/FC03.fr.i -k "Optimum global" 
HfdIndexSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/FC03.fr.i  \
                -Sk "Optimum global" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/biblio.hfd 

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Rhénanie
   |area=    UnivTrevesV1
   |flux=    PascalFrancis
   |étape=   Checkpoint
   |type=    indexItem
   |index=    FC03.fr.i
   |clé=    Optimum global
}}

Wicri

This area was generated with Dilib version V0.6.31.
Data generation: Sat Jul 22 16:29:01 2017. Site generation: Wed Feb 28 14:55:37 2024