Positivity certificates and polynomial optimization on non-compact semialgebraic sets
From MaRDI portal
Publication:2149557
Abstract: In a first contribution, we revisit two certificates of positivity on (possibly non-compact) basic semialgebraic sets due to Putinar and Vasilescu [Comptes Rendus de l'Acad'emie des Sciences-Series I-Mathematics, 328(6) (1999) pp. 495-499]. We use Jacobi's technique from [Mathematische Zeitschrift, 237(2) (2001) pp. 259-273] to provide an alternative proof with an effective degree bound on the sums of squares multipliers in such certificates. As a consequence, it allows one to define a hierarchy of semidefinite relaxations for a general polynomial optimization problem. Convergence of this hierarchy to a neighborhood of the optimal value as well as strong duality and analysis are guaranteed. In a second contribution, we introduce a new numerical method for solving systems of polynomial inequalities and equalities with possibly uncountably many solutions. As a bonus, one may apply this method to obtain approximate global optimizers in polynomial optimization.
Recommendations
- On the complexity of Putinar-Vasilescu's Positivstellensatz
- On polynomial optimization over non-compact semi-algebraic sets
- On the construction of converging hierarchies for polynomial optimization based on certificates of global positivity
- A bounded degree SOS hierarchy for polynomial optimization
- Optimization of Polynomials on Compact Semialgebraic Sets
Cites work
- scientific article; zbMATH DE number 4036424 (Why is no real title available?)
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 1490041 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A Nullstellensatz and a Positivstellensatz in semialgebraic geometry
- A Positivstellensatz for projective real varieties
- A Sum of Squares Approximation of Nonnegative Polynomials
- A paradox in bosonic energy computations via semidefinite programming relaxations
- A representation theorem for certain partially ordered commutative rings
- A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure
- An elementary recursive bound for effective Positivstellensatz and Hilbert's 17th problem
- An introduction to polynomial and semi-algebraic optimization
- Anneaux preordonnes
- Approximating Positive Polynomials Using Sums of Squares
- Coercive Polynomials and Their Newton Polytopes
- Continous, piecewise-polynomial functions which solve Hilbert's 17th problem.
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Discriminants and nonnegative polynomials
- Global Optimization of Polynomials Using Gradient Tentacles and Sums of Squares
- Global optimization with polynomials and the problem of moments
- In SDP Relaxations, Inaccurate Solvers Do Robust Optimization
- Iterated rings of bounded elements and generalizations of Schmüdgens Positivstellensatz
- Minimizing polynomials via sum of squares over the gradient ideal
- On an extension of Pólya's Positivstellensatz
- On exact Polya and Putinar's representations
- On polynomial optimization over non-compact semi-algebraic sets
- On the absence of uniform denominators in Hilbert’s 17th problem
- On the complexity of Putinar's Positivstellensatz
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Polynomials in \(\mathbb{R}[x,y]\) that are sums of squares in \(\mathbb{R}(x,y)\)
- Positive polynomials on semi-algebraic sets
- Probabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set
- Representations of positive polynomials and optimization on noncompact semialgebraic sets
- Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
- Revisiting two theorems of Curto and Fialkow on moment matrices
- SOS approximations of nonnegative polynomials via simple high degree perturbations
- Semidefinite Approximations for Global Unconstrained Polynomial Optimization
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets
- Sharp degree bounds for sum-of-squares certificates on projective curves
- Strong duality conditions in semidefinite programming
- Strong duality in lasserre's hierarchy for polynomial optimization
- Sums of squares on the hypercube
- Sums of squares, moment matrices and optimization over polynomials
- The IMO compendium. A collection of problems suggested for the International Mathematical Olympiads: 1959--2009
- The K-moment problem for compact semi-algebraic sets
- There are significantly more nonnegative polynomials than sums of squares
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions
- Truncated \(K\)-moment problems in several variables
- Uniform denominators in Hilbert's seventeenth problem
Cited in
(9)- Dual certificates and efficient rational sum-of-squares decompositions for polynomial optimization over compact sets
- Reducing nonnegativity over general semialgebraic sets to nonnegativity over simple sets
- On the construction of converging hierarchies for polynomial optimization based on certificates of global positivity
- Homogenization for polynomial optimization with unbounded sets
- On polynomial optimization over non-compact semi-algebraic sets
- Finite convergence of moment-SOS relaxations with nonreal radical ideals
- Certifying Polynomial Nonnegativity via Hyperbolic Optimization
- On the effective Putinar's Positivstellensatz and moment approximation
- On the complexity of Putinar-Vasilescu's Positivstellensatz
This page was built for publication: Positivity certificates and polynomial optimization on non-compact semialgebraic sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2149557)
