Inner approximations of completely positive reformulations of mixed binary quadratic programs: a unified analysis
From MaRDI portal
Publication:4594850
DOI10.1080/10556788.2016.1245732zbMath1386.90110OpenAlexW2546569438MaRDI QIDQ4594850
Publication date: 24 November 2017
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2016.1245732
inner approximationcompletely positive conepolyhedral approximationsmixed binary quadratic programming problems
Convex programming (90C25) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items (3)
Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems ⋮ 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
This page was built for publication: Inner approximations of completely positive reformulations of mixed binary quadratic programs: a unified analysis
