Representations of Positive Polynomials and Optimization on Noncompact Semialgebraic Sets
From MaRDI portal
Publication:3083322
DOI10.1137/090772903zbMath1279.14071OpenAlexW2057279466MaRDI QIDQ3083322
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
global optimizationcoercivitysemidefinite programmingpolynomialssum of squarescritical idealFedoryuk and Malgrange conditionsgeneric linear functions
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Nonsmooth analysis (49J52) Real-analytic and semi-analytic sets (14P15) Real algebra (13J30)
Related Items
A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure, Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets, Stability and genericity for semi-algebraic compact programs, 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, Tangencies and polynomial optimization, Exact SDP relaxations for classes of nonlinear semidefinite programming problems, Border basis relaxation for polynomial optimization, Generic Properties for Semialgebraic Programs, A Frank-Wolfe type theorem for nondegenerate polynomial programs, Quantitative properties of the non-properness set of a polynomial map, a positive characteristic case, Global optimization of polynomials over real algebraic sets, Well-Posedness in Unconstrained Polynomial Optimization Problems, On stability and the Łojasiewicz exponent at infinity of coercive polynomials, Coercive Polynomials and Their Newton Polytopes
