Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices

Motivated by the expressive power of completely positive programming to encode hard optimization problems, many approximation schemes for the completely positive cone have been proposed and successfully used. Most schemes are based on outer approximations, with the only inner approximations available being a linear programming based method proposed by Bundfuss and Dür (SIAM J Optim 20(1):30–53, 2009) and also Yıldırım (Optim Methods Softw 27(1):155–173, 2012), and a semidefinite programming based method proposed by Lasserre (Math Program 144(1):265–276, 2014). In this paper, we propose the use of the cone of nonnegative scaled diagonally dominant matrices as a natural inner approximation to the completely positive cone. Using projections of this cone we derive new graph-based second-order cone approximation schemes for completely positive programming, leading to both uniform and problem-dependent hierarchies. This offers a compromise between the expressive power of semidefinite programming and the speed of linear programming based approaches. Numerical results on random problems, standard quadratic programs and the stable set problem are presented to illustrate the effectiveness of our approach.

[1]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

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

[3]  E. Alper Yildirim,et al.  On the accuracy of uniform polyhedral approximations of the copositive cone , 2012, Optim. Methods Softw..

[4]  Amir Ali Ahmadi,et al.  DSOS and SDSOS optimization: LP and SOCP-based alternatives to sum of squares optimization , 2014, 2014 48th Annual Conference on Information Sciences and Systems (CISS).

[5]  Mirjam Dür,et al.  An Adaptive Linear Approximation Algorithm for Copositive Programs , 2009, SIAM J. Optim..

[6]  Amir Ali Ahmadi,et al.  Sum of Squares Basis Pursuit with Linear and Second Order Cone Programming , 2015, ArXiv.

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

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

[9]  R. Tyrrell Rockafellar,et al.  Convex Analysis , 1970, Princeton Landmarks in Mathematics and Physics.

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

[11]  Stanislav Busygin,et al.  Copositive Programming , 2009, Encyclopedia of Optimization.

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

[13]  Pablo A. Parrilo,et al.  Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone , 2014, Math. Program..

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

[15]  Stephen P. Boyd,et al.  Applications of second-order cone programming , 1998 .

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

[17]  Mirjam Dür,et al.  Copositive Programming – a Survey , 2010 .

[18]  Immanuel M. Bomze,et al.  Think co(mpletely)positive ! Matrix properties, examples and a clustered bibliography on copositive optimization , 2012, J. Glob. Optim..

[19]  E. Alper Yildirim.  Inner approximations of completely positive reformulations of mixed binary quadratic programs: a unified analysis , 2017, Optim. Methods Softw..

[20]  Amir Ali Ahmadi,et al.  DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization , 2017, SIAM J. Appl. Algebra Geom..

[21]  Amir Ali Ahmadi,et al.  Optimization over structured subsets of positive semidefinite matrices via column generation , 2015, Discret. Optim..

[22]  David S. Johnson,et al.  Foreword xiIntroduction to the Second DIMACS Challenge: Cliques, coloring, and satisfiability , 1993, Cliques, Coloring, and Satisfiability.

[23]  Ojas D. Parekh,et al.  On Factor Width and Symmetric H-matrices , 2005 .

[24]  Peter J. C. Dickinson.  Geometry of the copositive and completely positive cones , 2011 .

[25]  Jean B. Lasserre,et al.  New approximations for the cone of copositive matrices and its dual , 2010, Mathematical Programming.