Representations of positive polynomials and optimization on noncompact semialgebraic sets

DOI10.1137/090772903zbMATH Open1279.14071OpenAlexW2057279466MaRDI QIDQ3083322FDOQ3083322

Publication date: 21 March 2011

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/090772903

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

global optimization semidefinite programming coercivity polynomials sum of squares critical ideal Fedoryuk and Malgrange conditions generic linear functions

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Semidefinite programming (90C22) Nonsmooth analysis (49J52) Real algebra (13J30) Real-analytic and semi-analytic sets (14P15)

Cited In (32)

Representations of Non-Negative Polynomials, Degree Bounds and Applications to Optimization
Title not available (Why is that?)
A note on optimization with Morse polynomials
Reducing nonnegativity over general semialgebraic sets to nonnegativity over simple sets
Polynomials Positive on Unbounded Rectangles
A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure
Global optimization of polynomials over real algebraic sets
Tangencies and polynomial optimization
Representations of non-negative polynomials via KKT ideals
On stability and the Łojasiewicz exponent at infinity of coercive polynomials.
Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets
Stability and genericity for semi-algebraic compact programs
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
Well-posedness in unconstrained polynomial optimization problems
Generic properties for semialgebraic programs
Exact SDP relaxations for classes of nonlinear semidefinite programming problems
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)