Basis selection for SOS programs via facial reduction and polyhedral approximations

We develop a monomial basis selection procedure for sum-of-squares (SOS) programs based on facial reduction. Using linear programming and polyhedral approximations, the proposed technique finds a face of the SOS cone containing the feasible set of a given SOS program. The identified face in turn identifies a set of monomials that can be used to convert the SOS program into a semidefinite program (SDP). The technique can be viewed as a generalization of standard parsing algorithms for monomial basis selection. As we illustrate with examples, the proposed method can lead to smaller SDPs that are simpler to solve.

[1]  Rekha R. Thomas,et al.  Semidefinite Optimization and Convex Algebraic Geometry , 2012 .

[2]  Pablo A. Parrilo,et al.  Selecting a monomial basis for sums of squares programming over a quotient ring , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

[3]  B. Reznick.  Extremal PSD forms with few terms , 1978 .

[4]  Masakazu Kojima,et al.  Sparsity in sums of squares of polynomials , 2005, Math. Program..

[5]  M. Kojima,et al.  B-411 Sums of Squares and Semidefinite Programming Relaxations for Polynomial Optimization Problems with Structured Sparsity , 2004 .

[6]  P. Parrilo,et al.  Symmetry groups, semidefinite programs, and sums of squares , 2002, math/0211450.

[7]  James Demmel,et al.  Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials , 2008, SIAM J. Optim..

[8]  Ian R. Manchester,et al.  Transverse contraction criteria for existence, stability, and robustness of a limit cycle , 2012, 52nd IEEE Conference on Decision and Control.

[9]  Masakazu Muramatsu,et al.  Sums of Squares and Semidefinite Programming Relaxations for Polynomial Optimization Problems with Structured Sparsity , 2004 .

[10]  P. Seiler,et al.  Simplification Methods for Sum-of-Squares Programs , 2013, 1303.0714.

[11]  P. Parrilo.  Exploiting Algebraic Structure in Sum of Squares Programs , 2005 .

[12]  Johan Efberg,et al.  YALMIP : A toolbox for modeling and optimization in MATLAB , 2004 .

[13]  Johan Löfberg,et al.  YALMIP : a toolbox for modeling and optimization in MATLAB , 2004 .

[14]  G. Pataki.  Strong Duality in Conic Linear Programming: Facial Reduction and Extended Duals , 2013, 1301.7717.

[15]  Masakazu Muramatsu,et al.  A facial reduction algorithm for finding sparse SOS representations , 2010, Oper. Res. Lett..

[16]  Peter J Seiler,et al.  SOSTOOLS: Sum of squares optimization toolbox for MATLAB , 2002 .

[17]  J. Borwein,et al.  Facial reduction for a cone-convex programming problem , 1981, Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics.

[18]  Johan Löfberg,et al.  Pre- and Post-Processing Sum-of-Squares Programs in Practice , 2009, IEEE Transactions on Automatic Control.

[19]  B. Reznick,et al.  Sums of squares of real polynomials , 1995 .

[20]  Masakazu Muramatsu,et al.  Facial Reduction Algorithms for Conic Optimization Problems , 2012, Journal of Optimization Theory and Applications.