On the copositive representation of binary and continuous nonconvex quadratic programs

Mathematical Programming

Volumn 120, Issue 2, 2009, Pages 479-495

  Burer, Samuel ^a  

^a UNIVERSITY OF IOWA   (United States)

Author keywords

90C20; 90C26; Mathematics Subject Classification (2000): 90C25

Indexed keywords

90C20; 90C26; COMPLEMENTARITY CONSTRAINTS; COMPUTATIONAL ISSUES; CONIC PROGRAMS; CONTINUOUS VARIABLES; COPOSITIVE; LINEAR PROGRAMS; MATHEMATICS SUBJECT CLASSIFICATION (2000): 90C25; NONCONVEX QUADRATIC PROGRAMS; NP-HARD PROBLEMS;

MATHEMATICAL OPERATORS;

EID: 67349282710     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-008-0223-z     Document Type: Article

References (18)

1. Anstreicher, K.M., Burer, S.: Computable Representations for Convex Hulls of Low-Dimensional Quadratic Forms. University of Iowa, Manuscript (2007)
2. I.M. Bomze E. de Klerk 2002 Solving standard quadratic optimization problems via linear, semidefinite and copositive programming J. Global Optim. 24 2 163 185 Dedicated to Professor Naum Z. Shor on his 65th birthday (Pubitemid 35168547)
3. I.M. Bomze M. Dür E. de Klerk C. Roos A.J. Quist T. Terlaky 2000 On copositive programming and standard quadratic optimization problems J. Global Optim. 18 301 320 GO'99 Firenze
4. S. Burer R. Monteiro Y. Zhang 2002 Maximum stable set formulations and heuristics based on continuous optimization Math. Program. 94 137 166
5. S. Burer D. Vandenbussche 2008 A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations Math. Program. 113 259 282
6. E. de Klerk M. Laurent P.A. Parrilo 2006 A PTAS for the minimization of polynomials of fixed degree over the simplex Theor. Comput. Sci. 361 2-3 210 225 (Pubitemid 44189105)
7. E. de Klerk D.V. Pasechnik 2002 Approximation of the stability number of a graph via copositive programming SIAM J. Optim. 12 4 875 892
8. Bundfuss, S., Dür, M.: An Adaptive Linear Approximation Algorithm for Copositive Programs. Manuscript, Department of Mathematics, Technische Universität Darmstadt, Darmstadt, Germany (2008)
9. Giannessi, F., Tomasin, E.: Nonconvex quadratic programs, linear complementarity problems, and integer Linear Programs. In: Fifth Conference on Optimization Techniques (Rome, 1973), Part I. Lecture Notes in Compute Sciences, Vol. 3, pp. 437-449. Springer, Berlin (1973)
10. L. Lovász 1979 On the Shannon Capacity of a graph IEEE Trans. Inf. Theory IT- 25 1 1 7 (Pubitemid 9413535)
11. T.S. Motzkin E.G. Straus 1965 Maxima for graphs and a new proof of a theorem of Turán Can. J. Math. 17 4 533 540
12. M. Padberg 1989 The Boolean quadric polytope: some characteristics, facets and relatives Math. Program. 45 1, (Ser. B) 139 172 (Pubitemid 20597654)
13. Parrilo, P.: Structured Semidefinite Programs and Semi-algebraic Geometry Methods in Robustness and Optimization. Ph.D. thesis, California Institute of Technology (2000)
14. J. Peña J. Vera L.F. Zuluaga 2007 Computing the stability number of a graph via linear and semidefinite programming SIAM J. Optim. 18 1 87 105
15. Povh, J.: Application of Semidefinite and Copositive Programming in Combinatorial Optimization. Ph.D. thesis, University of Ljubljana (2006)
16. Povh, J., Rendl, F.: Copostive and semidefinite relaxations of the quadratic assignment problem. Manuscript, Faculty of Logisitics, University in Maribor, Mariborska cesta 3, Celje, Slovenia, July 2006 (submitted)
17. J. Povh F. Rendl 2007 A copositive programming approach to graph partitioning SIAM J. Optim. 18 1 223 241
18. J.F. Sturm S. Zhang 2003 On cones of nonnegative quadratic functions Math. Oper. Res. 28 2 246 267