Mathematical Programming

, Volume 106, Issue 3, pp 587–606

Minimizing Polynomials via Sum of Squares over the Gradient Ideal

Authors

    • Dept. of Math.Univ. of California
  • James Demmel
    • Dept. of Math. and EECSUniv. of California
  • Bernd Sturmfels
    • Dept. of Math.Univ. of California
Article

DOI: 10.1007/s10107-005-0672-6

Cite this article as:
Nie, J., Demmel, J. & Sturmfels, B. Math. Program. (2006) 106: 587. doi:10.1007/s10107-005-0672-6
  • 272 Views

Abstract

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.

Keywords

PolynomialsGlobal OptimizationSum of Squares (SOS)Semidefinite Programming (SDP)Radical IdealVarietyGradient IdealAlgebraic Geometry
Download to read the full article text

Copyright information

© Springer-Verlag Berlin Heidelberg 2005