Burer's key assumption for semidefinite and doubly nonnegative relaxations

Optimization Letters

Volumn 6, Issue 3, 2012, Pages 593-599

  Jarre, Florian ^a  

^a HEINRICH HEINE UNIVERSITY   (Germany)

Author keywords

Completely positive program; Doubly nonnegative relaxation; Key assumption

Indexed keywords

BINARY VARIABLES; COMPLETELY POSITIVE; DOUBLY NONNEGATIVE RELAXATION; KEY ASSUMPTION; LINEAR INEQUALITY CONSTRAINTS; NONCONVEX QUADRATIC PROGRAMS; SEMIDEFINITE RELAXATION;

CONSTRAINT THEORY;

FILTER BANKS;

EID: 84857647600     PISSN: 18624472     EISSN: 18624480     Source Type: Journal    
DOI: 10.1007/s11590-010-0269-8     Document Type: Article

References (5)

1. Anstreicher K.: Semidefinite Programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming. J. Glob. Opt. 43, 471-484 (2009).
2. Anstreicher K., Burer S.: Computable representations for convex hulls of low-dimensional quadratic forms. Math. Prog. (series B) 124(1-2), 33-43 (2010).
3. Bomze, I., Jarre, F.: A note on Burer's copositive representation of mixed-binary QPs. http://www. optimization-online. org/DB_HTML/2009/08/2368. html (2009).
4. Burer S.: On the copositive representation of binary and continuous nonconvex quadratic programs. Math. Prog. 120, 479-495 (2009).
5. Ge, D. D., Ye, Y. Y.: On doubly positive semidefinite programming relaxations. http://www. optimization-online. org/DB_HTML/2010/08/2709. pdf (2010).