Reducing nonnegativity over general semialgebraic sets to nonnegativity over simple sets
From MaRDI portal
(Redirected from Publication:6561376)
Recommendations
- Rational certificates of non-negativity on semialgebraic subsets of cylinders
- A Positivstellensatz for sums of nonnegative circuit polynomials
- An effective version of Schmüdgen's Positivstellensatz for the hypercube
- Positivity certificates and polynomial optimization on non-compact semialgebraic sets
- On an extension of Pólya's Positivstellensatz
Cites work
- scientific article; zbMATH DE number 193053 (Why is no real title available?)
- scientific article; zbMATH DE number 3525695 (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?)
- A Nullstellensatz and a Positivstellensatz in semialgebraic geometry
- A Positivstellensatz for sums of nonnegative circuit polynomials
- A bounded degree SOS hierarchy for polynomial optimization
- A dynamic inequality generation scheme for polynomial programming
- A new approximation hierarchy for polynomial conic optimization
- A new bound for Pólya's theorem with applications to polynomials positive on polyhedra.
- A second order cone characterization for sums of nonnegative circuits
- Algebraic Perspectives on Signomial Optimization
- Amoebas, nonnegative polynomials and sums of squares supported on circuits
- An algorithmic approach to Schmüdgen's Positivstellensatz
- An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming
- An exact Jacobian SDP relaxation for polynomial optimization
- An introduction to polynomial and semi-algebraic optimization
- Anneaux preordonnes
- CS-TSSOS: correlative and term sparsity for large-scale polynomial optimization
- Certifying Polynomial Nonnegativity via Hyperbolic Optimization
- Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension
- Closures of quadratic modules
- Completely positive reformulations for polynomial optimization
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Convex sets with semidefinite representation
- DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization
- Distinguished representations of strictly positive polynomials
- Duality of sum of nonnegative circuit polynomials and optimal SONC bounds
- Error bounds for some semidefinite programming approaches to polynomial minimization on the hypercube
- Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
- Exploiting equalities in polynomial programming
- Global optimization with polynomials and the problem of moments
- Lower bounds for polynomials using geometric programming
- Lower bounds for polynomials with simplex Newton polytopes based on geometric programming
- Minimizing polynomials via sum of squares over the gradient ideal
- Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities
- New dependencies of hierarchies in polynomial optimization
- Nonnegative Polynomials and Circuit Polynomials
- On an extension of Pólya's Positivstellensatz
- On polynomial optimization over non-compact semi-algebraic sets
- On the complexity of Putinar's Positivstellensatz
- On the complexity of Schmüdgen's Positivstellensatz
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Optimization of Polynomials on Compact Semialgebraic Sets
- Partitioning procedure for polynomial optimization
- Polynomials non-negative on a strip
- Polynomials non-negative on strips and half-strips
- Positive polynomials and sums of squares
- Positive polynomials and the moment problem for cylinders with compact cross-section.
- Positive polynomials on semi-algebraic sets
- Positive semidefinite diagonal minus tail forms are sums of squares
- Positivity and sums of squares: a guide to recent results
- Positivity certificates and polynomial optimization on non-compact semialgebraic sets
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Quadratic programs with hollows
- Relative entropy relaxations for signomial optimization
- Representations of Non-Negative Polynomials, Degree Bounds and Applications to Optimization
- Representations of positive polynomials and optimization on noncompact semialgebraic sets
- Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
- Representing polynomials by positive linear functions on compact convex polyhedra
- SONC optimization and exact nonnegativity certificates via second-order cone programming
- Semidefinite Optimization and Convex Algebraic Geometry
- Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets
- Semidefinite representations of noncompact convex sets
- Sparse Polynomial Optimization
- Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity
- Stability of quadratic modules
- Sum of squares basis pursuit with linear and second order cone programming
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Symmetry groups, semidefinite programs, and sums of squares
- TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
- The K-moment problem for compact semi-algebraic sets
- The truncated complex K-moment problem
- Uniform denominators in Hilbert's seventeenth problem
- Variational Analysis
- Über die Zerlegung definiter Funktionen in Quadrate.
- Über die Zerlegung strikte definiter Formen in Quadrate.
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)
