Representations of positive polynomials and optimization on noncompact semialgebraic sets
From MaRDI portal
Publication:3083322
Recommendations
- Representations of Non-Negative Polynomials, Degree Bounds and Applications to Optimization
- Optimization of Polynomial Functions
- Convexifying positive polynomials and sums of squares approximation
- Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
- scientific article; zbMATH DE number 1944285
Cited in
(32)- Representations of Non-Negative Polynomials, Degree Bounds and Applications to Optimization
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- A note on optimization with Morse polynomials
- Polynomials Positive on Unbounded Rectangles
- Reducing nonnegativity over general semialgebraic sets to nonnegativity over simple sets
- A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure
- Global optimization of polynomials over real algebraic sets
- Representations of non-negative polynomials via KKT ideals
- Tangencies and polynomial optimization
- Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets
- Stability and genericity for semi-algebraic compact programs
- On stability and the Łojasiewicz exponent at infinity of coercive polynomials.
- Positive polynomials on nondegenerate basic semi-algebraic sets
- Nonnegative Morse polynomial functions and polynomial optimization
- On polynomial optimization over non-compact semi-algebraic sets
- A Frank-Wolfe type theorem for nondegenerate polynomial programs
- Quantitative properties of the non-properness set of a polynomial map, a positive characteristic case
- Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
- Minimizing polynomials on noncompact sets
- Optimality conditions for minimizers at infinity in polynomial programming
- Positivity certificates and polynomial optimization on non-compact semialgebraic sets
- Quantitative properties of the non-properness set of a polynomial map
- Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness
- Border basis relaxation for polynomial optimization
- Exact SDP relaxations for classes of nonlinear semidefinite programming problems
- Well-posedness in unconstrained polynomial optimization problems
- Generic properties for semialgebraic programs
- Polynomial optimization on some unbounded closed semi-algebraic sets
- Convexifying positive polynomials and sums of squares approximation
- Optimization problems over noncompact semialgebraic sets
- Fermat's rule at infinity in non-degenerate semi-algebraic optimization
- Coercive Polynomials and Their Newton Polytopes
This page was built for publication: Representations of positive polynomials and optimization on noncompact semialgebraic sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3083322)
