Sums of Squares and Semidefinite Programming Relaxations for Polynomial Optimization Problems with Structured Sparsity

Unconstrained and inequality constrained sparse polynomial optimization problems (POPs) are considered. A correlative sparsity pattern graph is defined to find a certain sparse structure in the objective and constraint polynomials of a POP. Based on this graph, sets of the supports for sums of squares (SOS) polynomials that lead to efficient SOS and semidefinite program (SDP) relaxations are obtained. Numerical results from various test problems are included to show the improved performance of the SOS and SDP relaxations.

[1]  R. Vanderbei.  LOQO:an interior point code for quadratic programming , 1999 .

[2]  Pablo A. Parrilo,et al.  Minimizing Polynomial Functions , 2001, Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science.

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

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

[5]  Thomas F. Coleman,et al.  An efficient trust region method for unconstrained discrete-time optimal control problems , 1995, Comput. Optim. Appl..

[6]  P. Toint,et al.  Partitioned variable metric updates for large structured optimization problems , 1982 .

[7]  Michael Stingl,et al.  PENNON: A code for convex nonlinear and semidefinite programming , 2003, Optim. Methods Softw..

[8]  Sunyoung Kim,et al.  A General Framework for Convex Relaxation of Polynomial Optimization Problems over Cones , 2003 .

[9]  D. R. Fulkerson,et al.  Incidence matrices and interval graphs , 1965 .

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

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

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

[13]  Monique Laurent,et al.  A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0-1 Programming , 2003, Math. Oper. Res..

[14]  Jos F. Sturm,et al.  A Matlab toolbox for optimization over symmetric cones , 1999 .

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

[16]  Masakazu Kojima,et al.  Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems , 2005, SIAM J. Optim..

[17]  Didier Henrion,et al.  Convergent relaxations of polynomial matrix inequalities and static output feedback , 2006, IEEE Transactions on Automatic Control.

[18]  Markus Schweighofer,et al.  Optimization of Polynomials on Compact Semialgebraic Sets , 2005, SIAM J. Optim..

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

[20]  Masakazu Muramatsu,et al.  An Extension of Sums of Squares Relaxations to Polynomial Optimization Problems Over Symmetric Cones , 2007, Math. Program..

[21]  C. Floudas.  Handbook of Test Problems in Local and Global Optimization , 1999 .

[22]  N. Shor.  Dual quadratic estimates in polynomial and Boolean programming , 1991 .

[23]  K. Ball.  CONVEX BODIES: THE BRUNN–MINKOWSKI THEORY , 1994 .

[24]  P. Toint,et al.  Testing a class of methods for solving minimization problems with simple bounds on the variables , 1988 .

[25]  B. Peyton,et al.  An Introduction to Chordal Graphs and Clique Trees , 1993 .

[26]  M. Kojima.  Sums of Squares Relaxations of Polynomial Semidefinite Programs , 2003 .

[27]  Jason Wu,et al.  The Reference Manual for SPOOLES, Release 2.2: An Object Oriented Software Library for Solving Sparse Linear Systems of Equations , 1999 .

[28]  Andreas Griewank,et al.  On the unconstrained optimization of partially separable functions , 1982 .

[29]  S. Nash.  Newton-Type Minimization via the Lanczos Method , 1984 .

[30]  Didier Henrion,et al.  GloptiPoly: Global optimization over polynomials with Matlab and SeDuMi , 2003, TOMS.

[31]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[32]  Jorge J. Moré,et al.  Testing Unconstrained Optimization Software , 1981, TOMS.

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

[34]  P. Parrilo,et al.  From coefficients to samples: a new approach to SOS optimization , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[35]  Etienne de Klerk,et al.  Global optimization of rational functions: a semidefinite programming approach , 2006, Math. Program..

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

[37]  J. Lasserre,et al.  Detecting global optimality and extracting solutions in GloptiPoly , 2003 .

[38]  Jean B. Lasserre,et al.  An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs , 2002, SIAM J. Optim..

[39]  C. A. Rogers,et al.  The directions of the line segments and of the r -dimensional balls on the boundary of a convex body in Euclidean space , 1970 .

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

[41]  Masakazu Kojima,et al.  Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0) , 2003, Optim. Methods Softw..

[42]  Masakatsu Muramatsu,et al.  A NEW SECOND-ORDER CONE PROGRAMMING RELAXATION FOR MAX-CUT PROBLEMS , 2003 .