Coercive polynomials: stability, order of growth, and Newton polytopes
From MaRDI portal
Publication:4613988
DOI10.1080/02331934.2018.1426585zbMath1409.14083OpenAlexW2789995434MaRDI QIDQ4613988
Publication date: 28 January 2019
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2018.1426585
Newton-type methods (49M15) Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Real algebraic sets (14P05) Real polynomials: analytic properties, etc. (26C05)
Related Items
Tangencies and polynomial optimization ⋮ Convergence rates of Gibbs measures with degenerate minimum ⋮ On stability and the Łojasiewicz exponent at infinity of coercive polynomials ⋮ Existence of Pareto solutions for vector polynomial optimization problems with constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Amoebas, nonnegative polynomials and sums of squares supported on circuits
- How fast do polynomials grow on semialgebraic sets?
- 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
- Polyedres de Newton et nombres de Milnor
- Newton polytopes and the Bezout theorem
- Extremal psd forms with few terms
- Primal-dual methods for vertex and facet enumeration
- On globally diffeomorphic polynomial maps via Newton polytopes and circuit numbers
- Global error bounds for piecewise convex polynomials
- Bifurcation set, M-tameness, asymptotic critical values and Newton polyhedrons
- On the division of distributions by polynomials
- Techniques of variational analysis
- Polynomial Equations and Convex Polytopes
- Extension of Hoffman’s Error Bound to Polynomial Systems
- Optimization of Polynomial Functions
- Global error bounds for convex quadratic inequality systems*
- Error Bounds for Piecewise Convex Quadratic Programs and Applications
- Coercive Polynomials and Their Newton Polytopes
- Direct methods in the calculus of variations
- Absolute irreducibility of polynomials via Newton polytopes
