Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
From MaRDI portal
Publication:863907
DOI10.1016/J.JPAA.2006.05.028zbMATH Open1106.13028OpenAlexW2071940220MaRDI QIDQ863907FDOQ863907
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
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
Semidefinite programming (90C22) Semialgebraic sets and related spaces (14P10) Sums of squares and representations by other particular quadratic forms (11E25) Real algebra (13J30)
Cites Work
- Computations in algebraic geometry with Macaulay 2
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Numerical Optimization
- Title not available (Why is that?)
- Ideals, Varieties, and Algorithms
- Semidefinite Programming
- Title not available (Why is that?)
- Global optimization with polynomials and the problem of moments
- Title not available (Why is that?)
- Title not available (Why is that?)
- GloptiPoly
- The \(K\)-moment problem for compact semi-algebraic sets
- Semidefinite programming relaxations for semialgebraic problems
- Minimizing polynomials via sum of squares over the gradient ideal
- Optimization of Polynomials on Compact Semialgebraic Sets
- Semidefinite representations for finite varieties
- On the complexity of Putinar's Positivstellensatz
- Introduction to global optimization.
- Complexity estimates for the Schmüdgen Positivstellensatz
- Title not available (Why is that?)
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- Title not available (Why is that?)
- Global minimization of a multivariate polynomial using matrix methods
- Semidefinite Approximations for Global Unconstrained Polynomial Optimization
- Minimum ellipsoid bounds for solutions of polynomial systems via sum of squares
- Polynomials Positive on Unbounded Rectangles
Cited In (37)
- The saddle point problem of polynomials
- A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization
- Reducing nonnegativity over general semialgebraic sets to nonnegativity over simple sets
- Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
- Qualification Conditions in Semialgebraic Programming
- Global optimization of polynomials over real algebraic sets
- Tangencies and polynomial optimization
- Representations of non-negative polynomials via KKT ideals
- Homogenization for polynomial optimization with unbounded sets
- Stability and genericity for semi-algebraic compact programs
- On the complexity of Putinar's Positivstellensatz
- Saddle points of rational functions
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017
- Nonnegative Morse polynomial functions and polynomial optimization
- On types of isolated KKT points in polynomial optimization
- A practical approach to SOS relaxations for detecting quantum entanglement
- A Frank-Wolfe type theorem for nondegenerate polynomial programs
- Minimizing polynomials on noncompact sets
- Solving polynomial optimization problems via the truncated tangency variety and sums of squares
- Positivity certificates and polynomial optimization on non-compact semialgebraic sets
- Representations of positive polynomials and optimization on noncompact semialgebraic sets
- Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities
- Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness
- Finding robust global optimal values of bilevel polynomial programs with uncertain linear constraints
- Convergences for robust bilevel polynomial programmes with applications
- Minimizing polynomials via sum of squares over the gradient ideal
- Border basis relaxation for polynomial optimization
- Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications
- Well-posedness in unconstrained polynomial optimization problems
- Generic properties for semialgebraic programs
- An exact Jacobian SDP relaxation for polynomial optimization
- The multivariate eigenvalues of symmetric tensors
- A new approximation hierarchy for polynomial conic optimization
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions
- Intrinsic complexity estimates in polynomial optimization
- Semidefinite relaxations for semi-infinite polynomial programming
- Global optimization of polynomials restricted to a smooth variety using sums of squares
Uses Software
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)
