Positivity certificates and polynomial optimization on non-compact semialgebraic sets
From MaRDI portal
Publication:2149557
DOI10.1007/s10107-021-01634-1zbMath1494.90073arXiv1911.11428OpenAlexW3133708012MaRDI QIDQ2149557
Victor Magron, Ngoc Hoang Anh Mai, Jean-Bernard Lasserre
Publication date: 29 June 2022
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.11428
sums of squaressemidefinite programmingpolynomial systemsbasic semialgebraic setpolynomial optimizationnonnegativity certificatemoment-SOS hierarchyPutinar's positivstellensatzuniform denominators
Semidefinite programming (90C22) Numerical computation of roots of polynomial equations (65H04) Polynomial optimization (90C23)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Sums of squares on the hypercube
- Optimality conditions and finite convergence of Lasserre's hierarchy
- On polynomial optimization over non-compact semi-algebraic sets
- Discriminants and nonnegative polynomials
- Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
- On the complexity of Putinar's Positivstellensatz
- SOS approximations of nonnegative polynomials via simple high degree perturbations
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- The \(K\)-moment problem for compact semi-algebraic sets
- Solving moment problems by dimensional extension
- Uniform denominators in Hilbert's seventeenth problem
- Sharp degree bounds for sum-of-squares certificates on projective curves
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions
- On an extension of Pólya's Positivstellensatz
- Anneaux preordonnes
- A Positivstellensatz for projective real varieties
- The IMO compendium. A collection of problems suggested for the International Mathematical Olympiads: 1959--2009
- There are significantly more nonnegative polynomials than sums of squares
- Minimizing polynomials via sum of squares over the gradient ideal
- A Nullstellensatz and a Positivstellensatz in semialgebraic geometry
- Global Optimization with Polynomials and the Problem of Moments
- Polynomials in $\mathbb {R}[x,y$ that are sums of squares in $\mathbb {R}(x,y)$]
- An Introduction to Polynomial and Semi-Algebraic Optimization
- Probabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set
- Representations of Positive Polynomials and Optimization on Noncompact Semialgebraic Sets
- Positive polynomials on semi-algebraic sets
- Approximating Positive Polynomials Using Sums of Squares
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Continous, piecewise-polynomial functions which solve Hilbert's 17th problem.
- Iterated rings of bounded elements and generalizations of Schmüdgens Positivstellensatz
- An Elementary Recursive Bound for Effective Positivstellensatz and Hilbert’s 17th problem
- On Exact Polya and Putinar's Representations
- A paradox in bosonic energy computations via semidefinite programming relaxations
- In SDP Relaxations, Inaccurate Solvers Do Robust Optimization
- A Sum of Squares Approximation of Nonnegative Polynomials
- On the absence of uniform denominators in Hilbert’s 17th problem
- Revisiting two theorems of Curto and Fialkow on moment matrices
- Semidefinite Approximations for Global Unconstrained Polynomial Optimization
- Coercive Polynomials and Their Newton Polytopes
- Global Optimization of Polynomials Using Gradient Tentacles and Sums of Squares
- A representation theorem for certain partially ordered commutative rings
- Strong duality in lasserre's hierarchy for polynomial optimization
