An algorithm for solving convex programs with an additional convex- concave constraint
From MaRDI portal
Publication:689151
DOI10.1007/BF01582140zbMath0783.90100MaRDI QIDQ689151
Publication date: 9 December 1993
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
global optimization; decomposition; d.c. programming; branch-and-bound; additional convex-concave constraint; product of two affine functions
90C25: Convex programming
Related Items
Canonical d. c. programming techniques for solving a convex program with an additional constraint of multiplicative type, Constraint decomposition algorithms in global optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convex programs with an additional reverse convex constraint
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
- Constrained global optimization: algorithms and applications
- On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
- Reverse convex programming
- Method for minimizing a convex-concave function over a convex set
- An algorithm for indefinite quadratic programming with convex constraints
- Mathematical programs with a two-dimensional reverse convex constraint
- Linear multiplicative programming
- Polynomial time algorithms for some classes of constrained nonconvex quadratic problems
- Global minimization of a difference of two convex functions
- Convergent Algorithms for Minimizing a Concave Function
- An algorithm for nonconvex programming problems
