On global optimality conditions and cutting plane algorithms
From MaRDI portal
Publication:1407243
DOI10.1023/A:1024751811328zbMath1033.90094MaRDI QIDQ1407243
Publication date: 15 September 2003
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)
Related Items
DC semidefinite programming and cone constrained DC optimization. I: Theory, A new necessary and sufficient global optimality condition for canonical DC problems, Optimum component test plans for phased-mission systems, Successive search methods for solving a canonical DC programming problem, A branch and reduce approach for solving a class of low rank d.c. programs, New global optimality conditions for nonsmooth DC optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convex programs with an additional reverse convex constraint
- Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
- On Tikhonov's reciprocity principle and optimality conditions in d. c. optimization
- On the construction of test problems for concave minimization algorithms
- Can linear programs be used to test global optimization algorithms?
- Canonical DC programming problem: Outer approximation methods revisited
- DC programming: overview.
- Monotonic Optimization: Problems and Solution Approaches
- A modified version of Tuy's method for solving d.c. programing problem
- A method for globally minimizing concave functions over convex sets
- Convex analysis and global optimization
- Introduction to global optimization.
- Abstract convexity and global optimization
