Minimizing Polynomials via Sum of Squares over the Gradient Ideal

A method is proposed for finding the global minimum of a multivariate polynomial via sum of squares (SOS) relaxation over its gradient variety. That variety consists of all points where the gradient is zero and it need not be finite. A polynomial which is nonnegative on its gradient variety is shown to be SOS modulo its gradient ideal, provided the gradient ideal is radical or the polynomial is strictly positive on the real gradient variety. This opens up the possibility of solving previously intractable polynomial optimization problems. The related problem of constrained minimization is also considered, and numerical examples are discussed. Experiments show that our method using the gradient variety outperforms prior SOS methods.

[1]  Stephen J. Wright,et al.  Numerical Optimization , 2018, Fundamental Statistical Inference.

[2]  Patrizia M. Gianni,et al.  Derivations and Radicals of Polynomial Ideals over Fields of Arbitrary Characteristic , 2002, J. Symb. Comput..

[3]  Murray Marshall.  Optimization of Polynomial Functions , 2003, Canadian Mathematical Bulletin.

[4]  David A. Cox,et al.  Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics) , 2007 .

[5]  S. Basu,et al.  Algorithms in real algebraic geometry , 2003 .

[6]  J. Renegar,et al.  On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part I , 1989 .

[7]  I. Shafarevich.  Basic algebraic geometry , 1974 .

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

[9]  Monique Laurent,et al.  Semidefinite representations for finite varieties , 2007, Math. Program..

[10]  Grigoriy Blekherman.  Volumes of Nonnegative Polynomials, Sums of Squares and Powers of Linear Forms , 2004 .

[11]  Marie-Françoise Roy,et al.  Real algebraic geometry , 1992 .

[12]  Robert M. Corless,et al.  A reordered Schur factorization method for zero-dimensional polynomial systems with multiple roots , 1997, ISSAC.

[13]  Stephen J. Wright,et al.  Numerical Optimization (Springer Series in Operations Research and Financial Engineering) , 2000 .

[14]  B. Reznick.  Some concrete aspects of Hilbert's 17th Problem , 2000 .

[15]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[16]  Stephen P. Boyd,et al.  Semidefinite Programming , 1996, SIAM Rev..

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

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

[19]  James Renegar,et al.  On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part III: Quantifier Elimination , 1992, J. Symb. Comput..

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

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

[22]  Grigoriy Blekherman.  There are significantly more nonegative polynomials than sums of squares , 2003, math/0309130.

[23]  Monique Laurent,et al.  Converging Semidefinite Bounds for Global Unconstrained Polynomial Optimization , 2007 .

[24]  James Renegar.  On the computational complexity and geome-try of the first-order theory of the reals , 1992 .

[25]  Bernard Hanzon,et al.  REPORT RAPPORT , 2001 .

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

[27]  David A. Cox,et al.  Using Algebraic Geometry , 1998 .

[28]  P. Parrilo.  An explicit construction of distinguished representations of polynomials nonnegative over finite sets , 2002 .

[29]  D. Eisenbud.  Commutative Algebra: with a View Toward Algebraic Geometry , 1995 .

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

[31]  James Renegar,et al.  On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part I: Introduction. Preliminaries. The Geometry of Semi-Algebraic Sets. The Decision Problem for the Existential Theory of the Reals , 1992, J. Symb. Comput..

[32]  A. Fialkow,et al.  THE TRUNCATED COMPLEX K-MOMENT PROBLEM , 2000 .

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

[34]  V. Powers,et al.  Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals , 2007 .

[35]  James Demmel,et al.  Minimum Ellipsoid Bounds for Solutions of Polynomial Systems via Sum of Squares , 2004, J. Glob. Optim..

[36]  Teresa Krick,et al.  An Algorithm for the Computation of the Radical of an Ideal in the Ring of Polynomials , 1991, AAECC.

[37]  David A. Cox,et al.  Ideals, Varieties, and Algorithms , 1997 .

[38]  R. Curto,et al.  The truncated complex -moment problem , 2000 .

[39]  C. Berg.  The multidimensional moment problem and semi-groups , 1987 .

[40]  Rolf Neuhaus,et al.  Computation of real radicals of polynomial ideals — II , 1998 .

[41]  Dima Grigoriev,et al.  Solving Systems of Polynomial Inequalities in Subexponential Time , 1988, J. Symb. Comput..