Burer's key assumption for semidefinite and doubly nonnegative relaxations

DOI10.1007/s11590-010-0269-8zbMath1257.90067OpenAlexW2089203975MaRDI QIDQ691396

Florian Jarre

Publication date: 30 November 2012

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-010-0269-8

zbMATH Keywords

doubly nonnegative relaxationcompletely positive programkey assumption

Mathematics Subject Classification ID

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

Related Items (4)

Conic relaxations for semi-supervised support vector machines ⋮ Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems ⋮ Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization ⋮ Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques

Cites Work

• Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
• A note on Burer's copositive representation of mixed-binary QPs
• On the copositive representation of binary and continuous nonconvex quadratic programs
• Computable representations for convex hulls of low-dimensional quadratic forms
• On Doubly Positive Semidefinite Programming Relaxations

This page was built for publication: Burer's key assumption for semidefinite and doubly nonnegative relaxations