On the complexity of Putinar-Vasilescu's Positivstellensatz

DOI10.1016/j.jco.2022.101663zbMath1498.14144arXiv2104.11606OpenAlexW4220774658MaRDI QIDQ2145082

Ngoc Hoang Anh Mai, Victor Magron

Publication date: 17 June 2022

Published in: Journal of Complexity (Search for Journal in Brave)

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

zbMATH Keywords

basic semialgebraic setpolynomial optimizationsum-of-squaresmoment-SOS hierarchypositivity certificatePutinar-Vasilescu's Positivstellensatz

Mathematics Subject Classification ID

Semialgebraic sets and related spaces (14P10)

Related Items (4)

Sum-of-Squares Hierarchies for Polynomial Optimization and the Christoffel--Darboux Kernel ⋮ On the effective Putinar's Positivstellensatz and moment approximation ⋮ An effective version of Schmüdgen's Positivstellensatz for the hypercube ⋮ QFT, EFT and GFT

Cites Work

• Unnamed Item
• Optimality conditions and finite convergence of Lasserre's hierarchy
• On the complexity of Putinar's Positivstellensatz
• On the complexity of Schmüdgen's Positivstellensatz
• The \(K\)-moment problem for compact semi-algebraic sets
• Solving moment problems by dimensional extension
• On linear functional operations and the moment problem for a finite interval in one or several dimensions
• Uniform denominators in Hilbert's seventeenth problem
• Global Optimization with Polynomials and the Problem of Moments
• Lectures on Modern Convex Optimization
• Positive polynomials on semi-algebraic sets
• Semidefinite Programming
• A new bound for Pólya's theorem with applications to polynomials positive on polyhedra.

This page was built for publication: On the complexity of Putinar-Vasilescu's Positivstellensatz