Inner approximations of completely positive reformulations of mixed binary quadratic programs: a unified analysis

DOI10.1080/10556788.2016.1245732MaRDI QIDQ4594850zbMATH OpenOpenAlexFDO

Authors E. Alper Yildirim

Publication date 24 November 2017

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556788.2016.1245732

zbMATH Keywords

inner approximationcompletely positive conepolyhedral approximationsmixed binary quadratic programming problems

Mathematics Subject Classification ID

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

Recommendations

• A fresh CP look at mixed-binary QPs: new formulations and relaxations
• Analysis of copositive optimization based linear programming bounds on standard quadratic optimization
• A note on Burer's copositive representation of mixed-binary QPs
• A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming
• On the accuracy of uniform polyhedral approximations of the copositive cone

Cited in

(7)

• A note on Burer's copositive representation of mixed-binary QPs
• A fresh CP look at mixed-binary QPs: new formulations and relaxations
• Analysis of copositive optimization based linear programming bounds on standard quadratic optimization
• Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
• Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices
• Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems
• A simplified completely positive reformulation for binary quadratic programs

This page was built for publication: Inner approximations of completely positive reformulations of mixed binary quadratic programs: a unified analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4594850)