Optimization over structured subsets of positive semidefinite matrices via column generation

We develop algorithms for inner approximating the cone of positive semidefinite matrices via linear programming and second order cone programming. Starting with an initial linear algebraic approximation suggested recently by Ahmadi and Majumdar, we describe an iterative process through which our approximation is improved at every step. This is done using ideas from column generation in large-scale linear and integer programming. We then apply these techniques to approximate the sum of squares cone in a nonconvex polynomial optimization setting, and the copositive cone for a discrete optimization problem.

[1]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[2]  Alexander Schrijver,et al.  A comparison of the Delsarte and Lovász bounds , 1979, IEEE Trans. Inf. Theory.

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

[4]  E. Artin.  Über die Zerlegung definiter Funktionen in Quadrate , 1927 .

[5]  Amir Ali Ahmadi,et al.  Control and verification of high-dimensional systems with DSOS and SDSOS programming , 2014, 53rd IEEE Conference on Decision and Control.

[6]  Endre Boros,et al.  Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO) , 2007, J. Heuristics.

[7]  Pablo A. Parrilo,et al.  Semidefinite programming relaxations for semialgebraic problems , 2003, Math. Program..

[8]  George L. Nemhauser,et al.  Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions , 2010, Oper. Res..

[9]  Donald Goldfarb,et al.  Second-order cone programming , 2003, Math. Program..

[10]  Yurii Nesterov,et al.  Squared Functional Systems and Optimization Problems , 2000 .

[11]  Man-Duen Choi,et al.  Extremal positive semidefinite forms , 1977 .

[12]  Sanjeeb Dash,et al.  A note on QUBO instances defined on Chimera graphs , 2013, ArXiv.

[13]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[14]  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).

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

[16]  D. J. Newman,et al.  Arithmetic, Geometric Inequality , 1960 .

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

[18]  Arkadi Nemirovski,et al.  On Polyhedral Approximations of the Second-Order Cone , 2001, Math. Oper. Res..

[19]  G. P. Barker,et al.  Cones of diagonally dominant matrices , 1975 .

[20]  Hanif D. Sherali,et al.  Enhancing RLT relaxations via a new class of semidefinite cuts , 2002, J. Glob. Optim..

[21]  Olga Taussky-Todd.  SOME CONCRETE ASPECTS OF HILBERT'S 17TH PROBLEM , 1996 .

[22]  László Lovász,et al.  On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.

[23]  Alberto Caprara,et al.  An effective branch-and-bound algorithm for convex quadratic integer programming , 2010, Math. Program..

[24]  Mirjam Dür,et al.  The difference between 5×5 doubly nonnegative and completely positive matrices , 2009 .

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

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

[27]  J. Lasserre,et al.  Handbook on Semidefinite, Conic and Polynomial Optimization , 2012 .

[28]  D. Hilbert.  Über die Darstellung definiter Formen als Summe von Formenquadraten , 1888 .

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

[30]  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..

[31]  John E. Mitchell,et al.  A Semidefinite Programming Based Polyhedral Cut and Price Approach for the Maxcut Problem , 2006, Comput. Optim. Appl..

[32]  Amir Ali Ahmadi,et al.  Some applications of polynomial optimization in operations research and real-time decision making , 2015, Optimization Letters.

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

[34]  Raquel Reis,et al.  Applications of Second Order Cone Programming , 2013 .

[35]  B. Reznick,et al.  A new bound for Pólya's Theorem with applications to polynomials positive on polyhedra , 2001 .

[36]  Masakazu Kojima,et al.  Exact Solutions of Some Nonconvex Quadratic Optimization Problems via SDP and SOCP Relaxations , 2003, Comput. Optim. Appl..

[37]  J. Håstad.  Clique is hard to approximate withinn1−ε , 1999 .