On the Construction of Converging Hierarchies for Polynomial Optimization Based on Certificates of Global Positivity

DOI10.1287/moor.2018.0962zbMath1437.90127arXiv1709.09307OpenAlexW2967626315MaRDI QIDQ5108237

Georgina Hall, Amir Ali Ahmadi

Publication date: 30 April 2020

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1709.09307

zbMATH Keywords

convex optimizationpolynomial optimizationpositivstellensätze

Mathematics Subject Classification ID

Semidefinite programming (90C22) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Real algebraic sets (14P05) History of operations research and mathematical programming (90-03) Computational real algebraic geometry (14Q30)

Related Items (4)

Generating valid linear inequalities for nonlinear programs via sums of squares ⋮ Tighter bounds on transient moments of stochastic chemical systems ⋮ DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization ⋮ A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs

Uses Software

• SPOTless

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some applications of polynomial optimization in operations research and real-time decision making
• Constructive proofs of some positivstellensätze for compact semialgebraic subsets of \(\mathbb R^{d }\)
• On the complexity of Putinar's Positivstellensatz
• On the complexity of Schmüdgen's Positivstellensatz
• The \(K\)-moment problem for compact semi-algebraic sets
• Quadratic programming with one negative eigenvalue is NP-hard
• Semidefinite programming relaxations for semialgebraic problems
• Positive polynomials in control.
• Uniform denominators in Hilbert's seventeenth problem
• Anneaux preordonnes
• A PTAS for the minimization of polynomials of fixed degree over the simplex
• A Nullstellensatz and a Positivstellensatz in semialgebraic geometry
• Über die Zerlegung strikte definiter Formen in Quadrate
• Global Optimization with Polynomials and the Problem of Moments
• Approximation of the Stability Number of a Graph via Copositive Programming
• Semidefinite Optimization and Convex Algebraic Geometry
• Optimization of Polynomials on Compact Semialgebraic Sets
• DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization
• A new bound for Pólya's theorem with applications to polynomials positive on polyhedra.
• An algorithmic approach to Schmüdgen's Positivstellensatz

This page was built for publication: On the Construction of Converging Hierarchies for Polynomial Optimization Based on Certificates of Global Positivity