On the complexity of Schmüdgen's Positivstellensatz
From MaRDI portal
(Redirected from Publication:876820)
Recommendations
- Complexity estimates for the Schmüdgen Positivstellensatz
- A new proof for the existence of degree bounds for Putinar's positivstellensatz
- An algorithmic approach to Schmüdgen's Positivstellensatz
- An effective version of Schmüdgen's Positivstellensatz for the hypercube
- On the complexity of Putinar's Positivstellensatz
Cites work
- scientific article; zbMATH DE number 1601019 (Why is no real title available?)
- scientific article; zbMATH DE number 4029737 (Why is no real title available?)
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 1984325 (Why is no real title available?)
- scientific article; zbMATH DE number 1827070 (Why is no real title available?)
- A new bound for Pólya's theorem with applications to polynomials positive on polyhedra.
- An algorithmic approach to Schmüdgen's Positivstellensatz
- An effective version of Pólya's theorem on positive definite forms
- Complexity estimates for representations of Schmüdgen type.
- Complexity estimates for the Schmüdgen Positivstellensatz
- Distinguished representations of strictly positive polynomials
- Effective Łojasiewicz inequalities in semialgebraic geometry
- Global optimization with polynomials and the problem of moments
- Optimization of Polynomial Functions
- Optimization of Polynomials on Compact Semialgebraic Sets
- Positive polynomials on compact sets
- The \(K\)-moment problem for compact semi-algebraic sets
- Uniform denominators in Hilbert's seventeenth problem
Cited in
(47)- Convergence rates for sums-of-squares hierarchies with correlative sparsity
- Matrix convex hulls of free semialgebraic sets
- A few more extensions of Putinar's Positivstellensatz to non-compact sets
- Certifying the global optimality of quartic minimization over the sphere
- A semidefinite programming approach for solving multiobjective linear programming
- Near-optimal analysis of Lasserre's univariate measure-based bounds for multivariate polynomial optimization
- Effective Pólya semi-positivity for non-negative polynomials on the simplex
- A survey of semidefinite programming approaches to the generalized problem of moments and their error analysis
- On the construction of converging hierarchies for polynomial optimization based on certificates of global positivity
- Minimum ellipsoid bounds for solutions of polynomial systems via sum of squares
- An exact Jacobian SDP relaxation for polynomial optimization
- Positivstellensätze for polynomial matrices
- Degree Bounds for Putinar’s Positivstellensatz on the Hypercube
- A real Nullstellensatz and Positivstellensatz for the semipolynomials over an ordered field
- Real algebraic geometry with a view toward systems control and free positivity. Abstracts from the workshop held April 6--12, 2014.
- On the complexity of Putinar's Positivstellensatz
- A hierarchy of spectral relaxations for polynomial optimization
- Exponential Convergence of Sum-of-Squares Hierarchies for Trigonometric Polynomials
- A version of Putinar's Positivstellensatz for cylinders
- On the minimum of a positive polynomial over the standard simplex
- Sum-of-Squares Hierarchies for Polynomial Optimization and the Christoffel--Darboux Kernel
- On an extension of Pólya's Positivstellensatz
- On the effective Putinar's Positivstellensatz and moment approximation
- Exact algorithms for linear matrix inequalities
- On the Generation of Positivstellensatz Witnesses in Degenerate Cases
- Łojasiewicz inequalities with explicit exponents for smallest singular value functions
- Metric properties of semialgebraic mappings
- Convergence rates of moment-sum-of-squares hierarchies for volume approximation of semialgebraic sets
- Convex sets with semidefinite representation
- Rational certificates of non-negativity on semialgebraic subsets of cylinders
- The moment-SOS hierarchy: applications and related topics
- On Łojasiewicz inequalities and the effective Putinar's Positivstellensatz
- Semidefinite programming for min-max problems and games
- Polynomials of almost normal arguments in \(C^*\)-algebras
- Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization
- On the complexity of Putinar-Vasilescu's Positivstellensatz
- A new proof for the existence of degree bounds for Putinar's positivstellensatz
- An effective version of Schmüdgen's Positivstellensatz for the hypercube
- Certificates for nonnegativity of polynomials with zeros on compact semialgebraic sets
- Error bounds for polynomial optimization over the hypercube using Putinar type representations
- Stability of quadratic modules
- Characterization of polynomials whose large powers have all positive coefficients
- Convexifying positive polynomials and sums of squares approximation
- Reducing nonnegativity over general semialgebraic sets to nonnegativity over simple sets
- Sum-of-squares hierarchies for binary polynomial optimization
- Sum-of-squares hierarchies for binary polynomial optimization
- Semidefinite representation of convex sets
This page was built for publication: On the complexity of Schmüdgen's Positivstellensatz
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876820)
