Global optimization of polynomials restricted to a smooth variety using sums of squares

DOI10.1016/j.jsc.2011.12.003zbMath1266.90148OpenAlexW2141144514MaRDI QIDQ412217

Mohab Safey El Din, Feng Guo, Aurélien Greuet, Lihong Zhi

Publication date: 4 May 2012

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2011.12.003

zbMATH Keywords

polynomialspolar varietiessum of squaresglobal constrained optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items

Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients ⋮ On the complexity of the generalized MinRank problem ⋮ Equality-constrained minimization of polynomial functions ⋮ A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set ⋮ Global optimization of polynomials over real algebraic sets ⋮ Solving the equality-constrained minimization problem of polynomial functions ⋮ On exact Reznick, Hilbert-Artin and Putinar's representations ⋮ Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities ⋮ Tensor Manifold with Tucker Rank Constraints

Uses Software

• Sostools
• SparsePOP
• GloptiPoly
• YALMIP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
• Solving polynomial optimization problems via the truncated tangency variety and sums of squares
• Determinantal rings
• Testing sets for properness of polynomial mappings
• Polar varieties, real equation solving, and data structures: the hypersurface case
• Positive polynomials in control.
• On the geometry of polar varieties
• Generalized polar varieties: geometry and algorithms
• There are significantly more nonnegative polynomials than sums of squares
• Minimizing polynomials via sum of squares over the gradient ideal
• Global Optimization with Polynomials and the Problem of Moments
• Global optimization of polynomials using generalized critical values and sums of squares
• An approach to obtaining global extremums in polynomial mathematical programming problems
• The Number of Equations Defining a Determinantal Variety
• Positive polynomials and robust stabilization with fixed-order controllers
• Verification, Model Checking, and Abstract Interpretation
• Global Optimization of Polynomials Using Gradient Tentacles and Sums of Squares

This page was built for publication: Global optimization of polynomials restricted to a smooth variety using sums of squares