An Adaptive Linear Approximation Algorithm for Copositive Programs

We study linear optimization problems over the cone of copositive matrices. These problems appear in nonconvex quadratic and binary optimization; for instance, the maximum clique problem and other combinatorial problems can be reformulated as such problems. We present new polyhedral inner and outer approximations of the copositive cone which we show to be exact in the limit. In contrast to previous approximation schemes, our approximation is not necessarily uniform for the whole cone but can be guided adaptively through the objective function, yielding a good approximation in those parts of the cone that are relevant for the optimization and only a coarse approximation in those parts that are not. Using these approximations, we derive an adaptive linear approximation algorithm for copositive programs. Numerical experiments show that our algorithm gives very good results for certain nonconvex quadratic problems.

[1]  Reiner Horst,et al.  On generalized bisection of n-simplices , 1997, Math. Comput..

[2]  Etienne de Klerk,et al.  Solving Standard Quadratic Optimization Problems via Linear, Semidefinite and Copositive Programming , 2002, J. Glob. Optim..

[3]  Javier Peña,et al.  Computing the Stability Number of a Graph Via Linear and Semidefinite Programming , 2007, SIAM J. Optim..

[4]  Franz Rendl,et al.  Quadratic factorization heuristics for copositive programming , 2011, Math. Program. Comput..

[5]  Samuel Burer,et al.  On the copositive representation of binary and continuous nonconvex quadratic programs , 2009, Math. Program..

[6]  Etienne de Klerk,et al.  Approximation of the Stability Number of a Graph via Copositive Programming , 2002, SIAM J. Optim..

[7]  Mirjam Dür,et al.  Interior points of the completely positive cone. , 2008 .

[8]  Franz Rendl,et al.  Copositive programming motivated bounds on the stability and the chromatic numbers , 2009, Math. Program..

[9]  A. Berman,et al.  Completely Positive Matrices , 2003 .

[10]  Florian Jarre,et al.  On the computation of C* certificates , 2009, J. Glob. Optim..

[11]  Franz Rendl,et al.  A Copositive Programming Approach to Graph Partitioning , 2007, SIAM J. Optim..

[12]  Uriel G. Rothblum,et al.  A note on the computation of the CP-rank , 2006 .

[13]  Nikolaos V. Sahinidis,et al.  Global optimization of mixed-integer nonlinear programs: A theoretical and computational study , 2004, Math. Program..

[14]  Katta G. Murty,et al.  Some NP-complete problems in quadratic and nonlinear programming , 1987, Math. Program..

[15]  Franz Rendl,et al.  Copositive and semidefinite relaxations of the quadratic assignment problem , 2009, Discret. Optim..

[16]  Mirjam Dür,et al.  Algorithmic copositivity detection by simplicial partition , 2008 .

[17]  A. J. Quist,et al.  Copositive realxation for genera quadratic programming , 1998 .

[18]  A. J. Quist,et al.  Copositive relaxation for general quadratic programming. , 1998 .

[19]  Etienne de Klerk,et al.  On Copositive Programming and Standard Quadratic Optimization Problems , 2000, J. Glob. Optim..

[20]  P. Parrilo.  Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization , 2000 .