Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals

DOI10.1016/J.JPAA.2006.05.028MaRDI QIDQ863907zbMATH OpenOpenAlexFDO

Authors James Demmel, Victoria Powers, Jiawang Nie

Publication date 12 February 2007

Published in Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jpaa.2006.05.028

Mathematics Subject Classification ID

Semidefinite programming (90C22) Semialgebraic sets and related spaces (14P10) Sums of squares and representations by other particular quadratic forms (11E25) Real algebra (13J30)

Recommendations

• Representations of non-negative polynomials via KKT ideals
• Representations of positive polynomials and optimization on noncompact semialgebraic sets
• Minimizing polynomials on noncompact sets
• scientific article; zbMATH DE number 1944285
• Representations of Non-Negative Polynomials, Degree Bounds and Applications to Optimization

Cites work

• scientific article; zbMATH DE number 1601019 (Why is no real title available?)
• scientific article; zbMATH DE number 4029737 (Why is no real title available?)
• scientific article; zbMATH DE number 3563286 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 704831 (Why is no real title available?)
• scientific article; zbMATH DE number 1984325 (Why is no real title available?)
• Complexity estimates for the Schmüdgen Positivstellensatz
• Computations in algebraic geometry with Macaulay 2
• Detecting Global Optimality and Extracting Solutions in GloptiPoly
• Global minimization of a multivariate polynomial using matrix methods
• Global optimization with polynomials and the problem of moments
• GloptiPoly
• Ideals, Varieties, and Algorithms
• Introduction to global optimization.
• Minimizing polynomials via sum of squares over the gradient ideal
• Minimum ellipsoid bounds for solutions of polynomial systems via sum of squares
• Numerical Optimization
• On the complexity of Putinar's Positivstellensatz
• Optimization of Polynomials on Compact Semialgebraic Sets
• Polynomials Positive on Unbounded Rectangles
• Semidefinite Approximations for Global Unconstrained Polynomial Optimization
• Semidefinite Programming
• Semidefinite programming relaxations for semialgebraic problems
• Semidefinite representations for finite varieties
• The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
• The \(K\)-moment problem for compact semi-algebraic sets

Cited in

(37)

• Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017
• Representations of positive polynomials and optimization on noncompact semialgebraic sets
• A new approximation hierarchy for polynomial conic optimization
• Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities
• Nonnegative Morse polynomial functions and polynomial optimization
• Homogenization for polynomial optimization with unbounded sets
• Stability and genericity for semi-algebraic compact programs
• The saddle point problem of polynomials
• Minimizing polynomials on noncompact sets
• Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness
• An exact Jacobian SDP relaxation for polynomial optimization
• Finding robust global optimal values of bilevel polynomial programs with uncertain linear constraints
• A Frank-Wolfe type theorem for nondegenerate polynomial programs
• Solving polynomial optimization problems via the truncated tangency variety and sums of squares
• On the complexity of Putinar's Positivstellensatz
• Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications
• Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
• Tangencies and polynomial optimization
• Qualification Conditions in Semialgebraic Programming
• On types of isolated KKT points in polynomial optimization
• Saddle points of rational functions
• The multivariate eigenvalues of symmetric tensors
• A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization
• Tight relaxations for polynomial optimization and Lagrange multiplier expressions
• Well-posedness in unconstrained polynomial optimization problems
• Convergences for robust bilevel polynomial programmes with applications
• Representations of non-negative polynomials via KKT ideals
• Minimizing polynomials via sum of squares over the gradient ideal
• Intrinsic complexity estimates in polynomial optimization
• Global optimization of polynomials over real algebraic sets
• Semidefinite relaxations for semi-infinite polynomial programming
• Border basis relaxation for polynomial optimization
• Generic properties for semialgebraic programs
• Positivity certificates and polynomial optimization on non-compact semialgebraic sets
• Reducing nonnegativity over general semialgebraic sets to nonnegativity over simple sets
• A practical approach to SOS relaxations for detecting quantum entanglement
• Global optimization of polynomials restricted to a smooth variety using sums of squares

Describes a project that uses

Uses Software

• Macaulay2
• Sostools
• SeDuMi
• GloptiPoly

This page was built for publication: Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q863907)