Faster, but weaker, relaxations for quadratically constrained quadratic programs

We introduce a new relaxation framework for nonconvex quadratically constrained quadratic programs (QCQPs). In contrast to existing relaxations based on semidefinite programming (SDP), our relaxations incorporate features of both SDP and second order cone programming (SOCP) and, as a result, solve more quickly than SDP. A downside is that the calculated bounds are weaker than those gotten by SDP. The framework allows one to choose a block-diagonal structure for the mixed SOCP-SDP, which in turn allows one to control the speed and bound quality. For a fixed block-diagonal structure, we also introduce a procedure to improve the bound quality without increasing computation time significantly. The effectiveness of our framework is illustrated on a large sample of QCQPs from various sources.

[1]  Kim-Chuan Toh,et al.  A Newton-CG Augmented Lagrangian Method for Semidefinite Programming , 2010, SIAM J. Optim..

[2]  KojimaMasakazu,et al.  Exploiting Sparsity in Semidefinite Programming via Matrix Completion I , 2000 .

[3]  Jean B. Lasserre,et al.  Global Optimization with Polynomials and the Problem of Moments , 2000, SIAM J. Optim..

[4]  Alexander Schrijver,et al.  Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..

[5]  Charles R. Johnson,et al.  Positive definite completions of partial Hermitian matrices , 1984 .

[6]  M. Kojima,et al.  Second order cone programming relaxation of nonconvex quadratic optimization problems , 2001 .

[7]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[8]  Jon Lee,et al.  Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations , 2011, Math. Program..

[9]  Warren P. Adams,et al.  A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems , 1998 .

[10]  Franz Rendl,et al.  A Spectral Bundle Method for Semidefinite Programming , 1999, SIAM J. Optim..

[11]  Masakazu Kojima,et al.  Semidefinite Programming Relaxation for Nonconvex Quadratic Programs , 1997, J. Glob. Optim..

[12]  Kazuo Murota,et al.  Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework , 2000, SIAM J. Optim..

[13]  Renato D. C. Monteiro,et al.  A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization , 2003, Math. Program..

[14]  Duan Li,et al.  Nonconvex quadratically constrained quadratic programming: best D.C. decompositions and their SDP representations , 2011, J. Glob. Optim..

[15]  O. SIAMJ..  CONES OF MATRICES AND SUCCESSIVE CONVEX RELAXATIONS OF NONCONVEX SETS , 2000 .

[16]  Franz Rendl,et al.  Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations , 2009, Math. Program..

[17]  Katsuki Fujisawa,et al.  Exploiting sparsity in semidefinite programming via matrix completion II: implementation and numerical results , 2003, Math. Program..

[18]  Franz Rendl,et al.  Semidefinite programming and integer programming , 2002 .

[19]  Renato D. C. Monteiro,et al.  First- and second-order methods for semidefinite programming , 2003, Math. Program..

[20]  Jon Lee,et al.  Convex relaxations of non-convex mixed integer quadratically constrained programs: extended formulations , 2010, Math. Program..

[21]  Etienne de Klerk,et al.  Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem , 2007, Math. Program..