Relaxing the optimality conditions of box QP

DOI10.1007/s10589-009-9273-2zbMath1242.90151OpenAlexW1980605677MaRDI QIDQ538311

Samuel Burer, Jieqiu Chen

Publication date: 25 May 2011

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-009-9273-2

zbMATH Keywords

branch-and-boundsemidefinite relaxationsbasic semidefinite relaxation due to Shor

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)

Related Items (3)

Domain reduction techniques for global NLP and MINLP optimization ⋮ Bounds tightening based on optimality conditions for nonconvex box-constrained optimization ⋮ Unnamed Item

Uses Software

• SeDuMi
• YALMIP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Global optimization algorithms for linearly constrained indefinite quadratic problems
• Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
• Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
• Quadratic programming with one negative eigenvalue is NP-hard
• Approximating quadratic programming with bound and quadratic constraints
• A polyhedral study of nonconvex quadratic programs with box constraints
• A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones

This page was built for publication: Relaxing the optimality conditions of box QP