A note on Burer's copositive representation of mixed-binary QPs
From MaRDI portal
Publication:1958650
DOI10.1007/s11590-010-0174-1zbMath1200.90134OpenAlexW2038163734MaRDI QIDQ1958650
Florian Jarre, Immanuel M. Bomze
Publication date: 4 October 2010
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-010-0174-1
Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (14)
On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets ⋮ Erratum to: ``On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets ⋮ A note on set-semidefinite relaxations of nonconvex quadratic programs ⋮ A fresh CP look at mixed-binary QPs: new formulations and relaxations ⋮ A simplified completely positive reformulation for binary quadratic programs ⋮ Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems ⋮ Copositive optimization -- recent developments and applications ⋮ Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization ⋮ Burer's key assumption for semidefinite and doubly nonnegative relaxations ⋮ Quadratic factorization heuristics for copositive programming ⋮ Building a completely positive factorization ⋮ Copositive Programming ⋮ Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems ⋮ Completely positive reformulations for polynomial optimization
Cites Work
This page was built for publication: A note on Burer's copositive representation of mixed-binary QPs
