Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints

DOI10.1007/s10898-022-01157-9zbMath1504.90086OpenAlexW4229374814MaRDI QIDQ2089865

Bernd Perscheid, Sven de Vries

Publication date: 24 October 2022

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-022-01157-9

zbMATH Keywords

nonconvex quadratic programminglinear relaxationextended formulationChvátal-Gomory closure

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts
• Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
• Optimizing a polyhedral-semidefinite relaxation of completely positive programs
• Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
• A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
• \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
• Chvátal Cuts and Odd Cycle Inequalities in Quadratic 0–1 Optimization
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• On the cut polytope