Difference of convex solution of quadratically constrained optimization problems.

DOI10.1016/S0377-2217(02)00432-0zbMath1035.90066OpenAlexW2107969124MaRDI QIDQ1810525

Tim Van Voorhis, Faiz A. Al-Khayyal

Publication date: 9 June 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00432-0

zbMATH Keywords

Global optimizationBranch and boundOuter approximationDifference of convex programming

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)

Related Items

A deterministic global optimization algorithm based on a linearizing method for nonconvex quadratically constrained programs, A global optimization algorithm using parametric linearization relaxation, SUSPECT: MINLP special structure detector for Pyomo, A new accelerating method for global non-convex quadratic optimization with non-convex quadratic constraints, A global optimization algorithm using linear relaxation, An algorithm for global solution to bi-parametric linear complementarity constrained linear programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Concave minimization via conical partitions and polyhedral outer approximation
• Convex programs with an additional reverse convex constraint
• On the global minimization of a convex function under general nonconvex constraints
• On-line and off-line vertex enumeration by adjacency lists
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• A relaxation method for nonconvex quadratically constrained quadratic programs
• Canonical DC programming problem: Outer approximation methods revisited
• Convex analysis and global optimization