Global Optimization of Polynomials Using Gradient Tentacles and Sums of Squares
From MaRDI portal
Publication:5757356
DOI10.1137/050647098zbMath1118.13026arXivmath/0511617OpenAlexW2019716938MaRDI QIDQ5757356
Publication date: 6 September 2007
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0511617
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Computational aspects and applications of commutative rings (13P99) Semialgebraic sets and related spaces (14P10) 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, Minimizer Extraction in Polynomial Optimization Is Robust, Sum of squares and the Łojasiewicz exponent at infinity, Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness, An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination, Algebra of bounded polynomials on a set Zariski closed at infinity cannot be finitely generated, Homogenization for polynomial optimization with unbounded sets, Sampling Algebraic Varieties for Sum of Squares Programs, Global optimization of polynomials restricted to a smooth variety using sums of squares, An exact Jacobian SDP relaxation for polynomial optimization, Generic Properties for Semialgebraic Programs, Positive polynomials on nondegenerate basic semi-algebraic sets, Curves testing boundedness of polynomials on subsets of the real plane, A Frank-Wolfe type theorem for nondegenerate polynomial programs, Systems of polynomials with at least one positive real zero, A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set, New approximations for the cone of copositive matrices and its dual, Global optimization of polynomials over real algebraic sets, On polynomial optimization over non-compact semi-algebraic sets, Polynomial, regular and Nash images of Euclidean spaces, Some positivstellensätze for polynomial matrices, A note on nondegenerate matrix polynomials, An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming, Well-Posedness in Unconstrained Polynomial Optimization Problems, Solving the equality-constrained minimization problem of polynomial functions, Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping, On stability and the Łojasiewicz exponent at infinity of coercive polynomials, Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities, Positivstellensätze for polynomial matrices, Solving polynomial optimization problems via the truncated tangency variety and sums of squares, Complements of unbounded convex polyhedra as polynomial images of \({{\mathbb{R}}}^n\), Tight relaxations for polynomial optimization and Lagrange multiplier expressions, Coercive Polynomials and Their Newton Polytopes
Uses Software
