Reducing nonnegativity over general semialgebraic sets to nonnegativity over simple sets

Cites Work

Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity
Title not available (Why is that?)
Variational Analysis
Global optimization with polynomials and the problem of moments
Title not available (Why is that?)
Representing polynomials by positive linear functions on compact convex polyhedra
The $K$-moment problem for compact semi-algebraic sets
Symmetry groups, semidefinite programs, and sums of squares
Uniform denominators in Hilbert's seventeenth problem
On an extension of Pólya's Positivstellensatz
Minimizing polynomials via sum of squares over the gradient ideal
A Nullstellensatz and a Positivstellensatz in semialgebraic geometry
A dynamic inequality generation scheme for polynomial programming
Positivity and sums of squares: a guide to recent results
Title not available (Why is that?)
Title not available (Why is that?)
Semidefinite Optimization and Convex Algebraic Geometry
Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
Optimization of Polynomials on Compact Semialgebraic Sets
Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
A new bound for Pólya's theorem with applications to polynomials positive on polyhedra.
Exploiting equalities in polynomial programming
Amoebas, nonnegative polynomials and sums of squares supported on circuits
Lower bounds for polynomials with simplex Newton polytopes based on geometric programming
Lower bounds for polynomials using geometric programming
Representations of Positive Polynomials and Optimization on Noncompact Semialgebraic Sets
DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization
Positive semidefinite diagonal minus tail forms are sums of squares
On the complexity of Putinar's Positivstellensatz
Completely positive reformulations for polynomial optimization
The truncated complex $K$-moment problem
An exact Jacobian SDP relaxation for polynomial optimization
Anneaux preordonnes
Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets
Optimality conditions and finite convergence of Lasserre's hierarchy
On polynomial optimization over non-compact semi-algebraic sets
Positive polynomials and sums of squares
Partitioning procedure for polynomial optimization
Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
A new approximation hierarchy for polynomial conic optimization
Representations of Non-Negative Polynomials, Degree Bounds and Applications to Optimization
Positive polynomials on semi-algebraic sets
Primal-Dual Interior-Point Methods for Self-Scaled Cones
On the complexity of Schmüdgen's Positivstellensatz
An Introduction to Polynomial and Semi-Algebraic Optimization
Relative entropy relaxations for signomial optimization
Distinguished representations of strictly positive polynomials
An algorithmic approach to Schmüdgen's Positivstellensatz
Positive polynomials and the moment problem for cylinders with compact cross-section.
Polynomials non-negative on a strip
Stability of quadratic modules
Closures of quadratic modules
Error Bounds for Some Semidefinite Programming Approaches to Polynomial Minimization on the Hypercube
Convex sets with semidefinite representation
Solving moment problems by dimensional extension
A bounded degree SOS hierarchy for polynomial optimization
Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities
Über die Zerlegung definiter Funktionen in Quadrate.
Quadratic programs with hollows
Polynomials non-negative on strips and half-strips
An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming
A Positivstellensatz for Sums of Nonnegative Circuit Polynomials
New Dependencies of Hierarchies in Polynomial Optimization
TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension
Sum of squares basis pursuit with linear and second order cone programming
Certifying Polynomial Nonnegativity via Hyperbolic Optimization
A second order cone characterization for sums of nonnegative circuits
Positivity certificates and polynomial optimization on non-compact semialgebraic sets
Duality of sum of nonnegative circuit polynomials and optimal SONC bounds
Sparse Polynomial Optimization
Semidefinite Representations of Noncompact Convex Sets
Nonnegative Polynomials and Circuit Polynomials
Über die Zerlegung strikte definiter Formen in Quadrate.
SONC optimization and exact nonnegativity certificates via second-order cone programming
Algebraic Perspectives on Signomial Optimization
CS-TSSOS: correlative and term sparsity for large-scale polynomial optimization

This page was built for publication: Reducing nonnegativity over general semialgebraic sets to nonnegativity over simple sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6561376)