Reducing nonnegativity over general semialgebraic sets to nonnegativity over simple sets

Cites Work

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