Constraint decomposition algorithms in global optimization
From MaRDI portal
Publication:1342897
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
Cites work
- scientific article; zbMATH DE number 47153 (Why is no real title available?)
- A class of exhaustive cone splitting procedures in conical algorithms for concave minmization
- A global optimization approach for solving the convex multiplicative programming problem
- A new simplicial cover technique in constrained global optimization
- An algorithm for solving convex programs with an additional convex- concave constraint
- Canonical d. c. programming techniques for solving a convex program with an additional constraint of multiplicative type
- Concave minimization under linear constraints with special structure
- Concave minimization via conical partitions and polyhedral outer approximation
- Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems
- Convergent Algorithms for Minimizing a Concave Function
- Mathematical programs with a two-dimensional reverse convex constraint
- Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
- On geometry and convergence of a class of simplicial covers
- On solving general reverse convex programming problems by a sequence of linear programs and line searches
- On-line and off-line vertex enumeration by adjacency lists
- Outer approximation by polyhedral convex sets
- The complementary convex structure in global optimization
Cited in
(11)- 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
- scientific article; zbMATH DE number 2087248 (Why is no real title available?)
- DC programming: overview.
- Constraint aggregation for rigorous global optimization
- Global propagation of side constraints for solving over-constrained problems
- A convergent decomposition method for box-constrained optimization problems
- Decomposition approach for the global minimization of biconcave functions over polytopes
- Solving constrained optimization problems by solution-based decomposition search
- On optimization over the efficient set in linear multicriteria programming
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)
