A note on Burer's copositive representation of mixed-binary QPs
From MaRDI portal
Publication:1958650
DOI10.1007/s11590-010-0174-1zbMath1200.90134MaRDI 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
90C20: Quadratic programming
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems, A simplified completely positive reformulation for binary quadratic programs, Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems, 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, Copositive optimization -- recent developments and applications, Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization, Quadratic factorization heuristics for copositive programming, Burer's key assumption for semidefinite and doubly nonnegative relaxations, A fresh CP look at mixed-binary QPs: new formulations and relaxations, Building a completely positive factorization, Completely positive reformulations for polynomial optimization, Copositive Programming
Cites Work
