Canonical DC programming problem: Outer approximation methods revisited
From MaRDI portal
Publication:1919172
DOI10.1016/0167-6377(95)00037-XzbMath0857.90123OpenAlexW2064451830MaRDI QIDQ1919172
Publication date: 1 August 1996
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(95)00037-x
outer approximationadditional reverse convex constraintcutting plane approachescanonical DC programming
Related Items
Reverse convex problems: an approach based on optimality conditions, Beyond canonical dc-optimization: the single reverse polar problem, On global optimality conditions and cutting plane algorithms, A new necessary and sufficient global optimality condition for canonical DC problems, An alogrithm for monotonic global optimization problems∗, Successive search methods for solving a canonical DC programming problem, Outer approximation algorithms for canonical DC problems, New global optimality conditions for nonsmooth DC optimization problems, Difference of convex solution of quadratically constrained optimization problems.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A level set algorithm for a class of reverse convex programs
- A finite cutting plane method for solving linear programs with an additional reverse convex constraint
- An outer approximation method for globally minimizing a concave function over a compact convex set
- On outer approximation methods for solving concave minimization problems
- Convex programs with an additional reverse convex constraint
- On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
- Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
- Newton's method for convex programming and Tschebyscheff approximation
- Reverse convex programming
- On-line and off-line vertex enumeration by adjacency lists
- Comments on a reverse convex programming algorithm
- The Cutting-Plane Method for Solving Convex Programs
- A modified version of Tuy's method for solving d.c. programing problem
- A method for globally minimizing concave functions over convex sets
- A Successive Underestimation Method for Concave Minimization Problems
- The Supporting Hyperplane Method for Unimodal Programming
