Constraint decomposition algorithms in global optimization
From MaRDI portal
Publication:1342897
DOI10.1007/BF01096683zbMath0827.90128MaRDI QIDQ1342897
Reiner Horst, Nguyen Van Thoai
Publication date: 15 January 1995
Published in: Journal of Global Optimization (Search for Journal in Brave)
global optimizationcutting plane techniquesconical branch-and-bound techniquespolyhedral outer approximation
Related Items
Decomposition approach for the global minimization of biconcave functions over polytopes, Convex and concave relaxations of implicit functions, DC programming: overview., On optimization over the efficient set in linear multicriteria programming, Convergence and application of a decomposition method using duality bounds for nonconvex global optimization, On Tikhonov's reciprocity principle and optimality conditions in d. c. optimization
Cites Work
- Unnamed Item
- Canonical d. c. programming techniques for solving a convex program with an additional constraint of multiplicative type
- An algorithm for solving convex programs with an additional convex- concave constraint
- Concave minimization via conical partitions and polyhedral outer approximation
- Outer approximation by polyhedral convex sets
- Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
- On-line and off-line vertex enumeration by adjacency lists
- Mathematical programs with a two-dimensional reverse convex constraint
- A new simplicial cover technique in constrained global optimization
- The complementary convex structure in global optimization
- A global optimization approach for solving the convex multiplicative programming problem
- Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems
- On solving general reverse convex programming problems by a sequence of linear programs and line searches
- Concave minimization under linear constraints with special structure
- A class of exhaustive cone splitting procedures in conical algorithms for concave minmization
- Convergent Algorithms for Minimizing a Concave Function
- On geometry and convergence of a class of simplicial covers
