Serveur d'exploration sur l'Université de Trèves

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.

Le cluster Méthode séparation et évaluation - Optimum global

Terms

11Méthode séparation et évaluation
18Optimum global
11Programmation non convexe
30Programmation mathématique
6Programmation semi infinie
11Méthode branch and bound
7Polytope
12Programmation quadratique

Associations

Freq.WeightAssociation
70.497Méthode séparation et évaluation - Optimum global
50.455Méthode séparation et évaluation - Programmation non convexe
70.385Méthode séparation et évaluation - Programmation mathématique
50.373Programmation mathématique - Programmation semi infinie
50.355Optimum global - Programmation non convexe
50.355Méthode branch and bound - Optimum global
50.345Polytope - Programmation mathématique
80.344Optimum global - Programmation mathématique
60.330Programmation mathématique - Programmation non convexe
60.316Programmation mathématique - Programmation quadratique

Documents par ordre de pertinence
000427 (2010) R. Horst [Allemagne]Bisecton by Global Optimization Revisited
000D04 (2000) N. V. Thoai [Allemagne]Duality bound method for the general quadratic programming problem with quadratic constraints
001223 (1996) R. Horst [Allemagne] ; N. V. ThoaiDecomposition approach for the global minimization of biconcave functions over polytopes
000365 (2010) N. V. Thoai [Allemagne]Reverse Convex Programming Approach in the Space of Extreme Criteria for Optimization over Efficient Sets
000835 (2005) N. V. Thoai [Allemagne] ; Y. Yamamoto [Japon] ; A. Yoshise [Japon]Global optimization method for solving mathematical programs with linear complementarity constraints
000B15 (2002) N. V. Thoai [Allemagne]Convergence and application of a decomposition method using duality bounds for nonconvex global optimization
000C75 (2000) M. Locatelli [Italie] ; U. Raber [Allemagne]On convergence of the simplicial branch-and-bound algorithm based on ω-subdivisions
000C98 (2000) M. Locatelli [Italie] ; U. Raber [Allemagne]Finiteness result for the simplicial branch-and-bound algorithm based on ω-subdivisions
000D80 (1999) R. Horst [Allemagne] ; N. V. Thoai [Allemagne]Maximizing a concave function over the efficient or weakly-efficient set
001042 (1997) M. Dür [Allemagne] ; R. Horst [Allemagne]Lagrange duality and partitioning techniques in nonconvex global optimization
001347 (1994) R. Horst [Allemagne] ; L. D. Muu ; M. Nast [Allemagne]Branch-and-bound decomposition approach for solving quasiconvex-concave programs
001420 (1993) P. Gritzmann [Allemagne] ; V. KleeComputational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces
001470 (1992) P. Gritzmann [Allemagne] ; V. KleeDeciding uniqueness in norm maximization
001519 (1991) R. Horst [Allemagne] ; N. V. Thoai ; H. P. BensonConcave minimization via conical partitions and polyhedral outer approximation
001568 (1990) R. Hettich ; G. GramlichA note on an implementation of a method for quadratic semi-infinite programming
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
001636 (1988) R. HorstDeterministic global optimization with partition sets whose feasibility is not known: application to concave minimization, reverse convex constraints, DC-programming, and Lipschitzian optimization
001720 (1986) R. HorstA general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
000506 (2009) Subhendu Bikash Hazra [Allemagne]MULTIGRID ONE-SHOT METHOD FOR AERODYNAMIC SHAPE OPTIMIZATION
000581 (2008) Volker Schulz [Allemagne] ; Gabriel Wittum [Allemagne]Transforming smoothers for PDE constrained optimization problems
000A82 (2002) Marco Locatelli [Italie] ; Ulrich Raber [Allemagne]Packing equal circles in a square: a deterministic global optimization approach
000D01 (2000) M. Gugat [Allemagne]Error bounds for infinite systems of convex inequalities without Slater's condition
000E02 (1999) R. Horst [Allemagne] ; N. V. Thoai [Allemagne]DC programming : Overview
000E18 (1999) M. Gugat [Allemagne]A parametric view on the Mangasarian-Fromovitz constraint qualification
001202 (1996) R. Horst [Allemagne] ; M. NastLinearly constrained global minimization of functions with concave minorants
001333 (1994) M. Heinkenschloss [Allemagne]On the solution of a two ball trust region subproblem
001395 (1993) R. Hettich [Allemagne] ; K. O. KortanekSemi-infinite programming: theory, methods, and applications
001422 (1993) N. Van Thoai [Allemagne]Canonical D.C. programming techniques for solving a convex program with an additional constraint of multiplicative type
001473 (1992) R. Horst [Allemagne] ; N. V. ThoaiConical algorithm for the global minimization of linearly constrained decomposable concave minimization problems
001679 (1987) R. Horst ; H. TuyOn the convergence of global methods in multiextremal optimization
001684 (1987) R. Hettich ; G. StillLocal aspects of a method for solving membrane-eigenvalue problems by parametric semi-infinite programming
001719 (1986) R. HettichAn implementation of a discretization method for semi-infinite programming
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
000505 (2009) Subhendu Bikash Hazra [Allemagne]MULTIGRID ONE-SHOT METHOD FOR STATE CONSTRAINED AERODYNAMIC SHAPE OPTIMIZATION
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
000895 (2004) Volker Schulz [Allemagne]Simultaneous solution approaches for large optimization problems
000916 (2004) Alexander Tartakovski [Allemagne] ; Martin Schaaf [Allemagne] ; Rainer Maximini [Allemagne] ; Ralph Bergmann (informaticien) [Allemagne]MINLP based retrieval of generalized cases
000A79 (2002) R. H. W. Hoppe [Allemagne] ; S. I. Petrova [Bulgarie] ; V. Schulz [Allemagne]Primal-dual Newton-type interior-point method for topology optimization
000B17 (2002) H. A. Le Thi [Allemagne] ; D. T. Pham ; N. V. ThoaiCombination between global and local methods for solving an optimization problem over the efficient set
000C92 (2000) F. Leibfritz [Allemagne] ; E. W. SachsInexact SQP interior point methods and large scale optimal control problems
000E04 (1999) M. Gugat [Allemagne]Convex semi-infinite parametric programming : Uniform convergence of the optimal value functions of discretized problems
000E69 (1998) M. Gugat [Allemagne]Prox-regularization methods for generalized fractional programming
000E82 (1998) N. V. Thoai [Allemagne]On Tikhonov's reciprocity principle and optimality conditions in d.c. optimization
000F87 (1997) R. Horst [Allemagne] ; N. V. Thoai [Viêt Nam]Utility function programs and optimization over the efficient set in multiple-objective decision making
001066 (1997) D. Kleis [Allemagne] ; E. W. Sachs [Allemagne]Convergence rate of the augmented Lagrangian SQP method
001281 (1995) R. Horst [Allemagne] ; M. Nast ; N. V. ThoaiNew LP bound in multivariate Lipschitz optimization: theory and applications
001414 (1993) J. Huschens [Allemagne]Exploiting additional structure in equality constrained optimization by structured SQP secant algorithms
001638 (1988) R. Horst ; N. V. ThoaiBranch-and-bound methods for solving systems of Lipschitzian equations and inequalities
001640 (1988) R. Horst ; PHAN THIEN THACHA topological property of limes-arcwise strictly quasiconvex functions

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