Coercive Polynomials and Their Newton Polytopes

DOI10.1137/140980624zbMath1322.90092OpenAlexW1120782848MaRDI QIDQ5502243

Oliver Stein, Tomáš Bajbar

Publication date: 18 August 2015

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

Full work available at URL: https://semanticscholar.org/paper/4f768f5581097f5fa080167c58b82c0093c8faa8

zbMATH Keywords

Newton polytopecoercivitypolynomial optimizationNewton polytope at infinitynoncompact semialgebraic sets

Mathematics Subject Classification ID

Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Polynomials in number theory (11C08) Semialgebraic sets and related spaces (14P10) Special polynomials in general fields (12E10) Real polynomials: analytic properties, etc. (26C05)

Related Items

Positivity certificates and polynomial optimization on non-compact semialgebraic sets, Tangencies and polynomial optimization, Homogenization for polynomial optimization with unbounded sets, Convergence rates of Gibbs measures with degenerate minimum, Optimality Conditions for Minimizers at Infinity in Polynomial Programming, On the complexity of testing attainment of the optimal value in nonlinear optimization, Coercive polynomials: stability, order of growth, and Newton polytopes, Systems of polynomials with at least one positive real zero, On globally diffeomorphic polynomial maps via Newton polytopes and circuit numbers, On stability and the Łojasiewicz exponent at infinity of coercive polynomials, Atypical points at infinity and algorithmic detection of the bifurcation locus of real polynomials, Newton polytopes and relative entropy optimization, On the existence of Pareto solutions for polynomial vector optimization problems, Existence of Pareto solutions for vector polynomial optimization problems with constraints, Coercive Polynomials and Their Newton Polytopes

Uses Software

• RAGlib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Amoebas, nonnegative polynomials and sums of squares supported on circuits
• A Frank-Wolfe type theorem for nondegenerate polynomial programs
• On polynomial optimization over non-compact semi-algebraic sets
• Minimizing polynomial functions
• Stability of quadratic modules
• On the topology of the Newton boundary at infinity
• Elimination theory and Newton polytopes
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
• Newton polytopes and the Bezout theorem
• Extremal psd forms with few terms
• Ehresmann fibrations and Palais-Smale conditions for morphisms of Finsler manifolds
• Primal-dual methods for vertex and facet enumeration
• Semialgebraic Sard theorem for generalized critical values.
• Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness
• Bifurcation set, M-tameness, asymptotic critical values and Newton polyhedrons
• Minimizing polynomials via sum of squares over the gradient ideal
• Reaching generalized critical values of a polynomial
• Polynomial Equations and Convex Polytopes
• Algebraic Equations and Convex Bodies
• Probabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set
• Representations of Positive Polynomials and Optimization on Noncompact Semialgebraic Sets
• Lectures on Polytopes
• On asymptotic critical values of a complex polynomial
• Deciding reachability of the infimum of a multivariate polynomial
• Computing the global optimum of a multivariate polynomial over the reals
• On gradient at infinity of semialgebraic functions
• Coercive Polynomials and Their Newton Polytopes
• Global Optimization of Polynomials Using Gradient Tentacles and Sums of Squares
• Absolute irreducibility of polynomials via Newton polytopes