Burer's key assumption for semidefinite and doubly nonnegative relaxations
From MaRDI portal
Publication:691396
DOI10.1007/S11590-010-0269-8zbMATH Open1257.90067OpenAlexW2089203975MaRDI QIDQ691396FDOQ691396
Authors: 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
Recommendations
- Simplified semidefinite and completely positive relaxations
- Fixed point theory for permissible extension type maps
- On standard quadratic programs with exact and inexact doubly nonnegative relaxations
- On doubly positive semidefinite programming relaxations
- Cutting planes for semidefinite relaxations based on triangle-free subgraphs
Quadratic programming (90C20) Nonconvex programming, global optimization (90C26) Boolean programming (90C09)
Cites Work
- On the copositive representation of binary and continuous nonconvex quadratic programs
- On doubly positive semidefinite programming relaxations
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Computable representations for convex hulls of low-dimensional quadratic forms
- A note on Burer's copositive representation of mixed-binary QPs
Cited In (6)
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
- Conic relaxations for semi-supervised support vector machines
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- Fixed point theory for permissible extension type maps
- Simplified semidefinite and completely positive relaxations
- Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques
This page was built for publication: Burer's key assumption for semidefinite and doubly nonnegative relaxations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q691396)
