Constraint decomposition algorithms in global optimization
From MaRDI portal
Publication:1342897
DOI10.1007/BF01096683zbMATH Open0827.90128MaRDI QIDQ1342897FDOQ1342897
Reiner Horst, Nguyen Van Thoai
Publication date: 15 January 1995
Published in: Journal of Global Optimization (Search for Journal in Brave)
Recommendations
- Convex-concave programming as a decomposition approach to global optimization
- Convergence and application of a decomposition method using duality bounds for nonconvex global optimization
- Global optimization of separable objective functions on convex polyhedra via piecewise-linear approximation
- Concave minimization under linear constraints with special structure
- Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems
global optimizationcutting plane techniquesconical branch-and-bound techniquespolyhedral outer approximation
Cites Work
- Convergent Algorithms for Minimizing a Concave Function
- Title not available (Why is that?)
- Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems
- A global optimization approach for solving the convex multiplicative programming problem
- On-line and off-line vertex enumeration by adjacency lists
- On solving general reverse convex programming problems by a sequence of linear programs and line searches
- Canonical d. c. programming techniques for solving a convex program with an additional constraint of multiplicative type
- Concave minimization via conical partitions and polyhedral outer approximation
- Outer approximation by polyhedral convex sets
- Mathematical programs with a two-dimensional reverse convex constraint
- The complementary convex structure in global optimization
- Concave minimization under linear constraints with special structure
- An algorithm for solving convex programs with an additional convex- concave constraint
- A class of exhaustive cone splitting procedures in conical algorithms for concave minmization
- On geometry and convergence of a class of simplicial covers
- Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
- A new simplicial cover technique in constrained global optimization
Cited In (10)
- DC programming: overview.
- Global propagation of side constraints for solving over-constrained problems
- On Tikhonov's reciprocity principle and optimality conditions in d. c. optimization
- Convex and concave relaxations of implicit functions
- Convergence and application of a decomposition method using duality bounds for nonconvex global optimization
- Decomposition approach for the global minimization of biconcave functions over polytopes
- Constraint aggregation for rigorous global optimization
- Solving constrained optimization problems by solution-based decomposition search
- On optimization over the efficient set in linear multicriteria programming
- Title not available (Why is that?)
This page was built for publication: Constraint decomposition algorithms in global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1342897)
