Cover Image

Degree Bounds for Positivstellensätze of general semialgebraic sets

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Heijmans-Kuryatnikova, Olga, Vera, Juan C., Zuluaga, Luis F.
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control 90C23
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The link between $1$-norm approximation and effective Positivstellensatze for the hypercube
by: de Klerk, Etienne, et al.
Published: (2024)

Reducing non-negativity over general semialgebraic sets to non-negativity over simple sets
by: Kuryatnikova, Olga, et al.
Published: (2019)

Non-SOS Positivstellensätze for semi-algebraic sets defined by polynomial matrix inequalities
by: Guo, Feng
Published: (2025)

Degree bounds for Putinar's Positivstellensatz on the hypercube
by: Baldi, Lorenzo, et al.
Published: (2023)

Exactness and Effective Degree Bound of Lasserre's Relaxation for Polynomial Optimization over Finite Variety
by: Hua, Zheng, et al.
Published: (2021)

Duality attainment and strict feasibility of the generalized moment problem and its relaxations
by: Halaseh, Sami, et al.
Published: (2026)

Linear Convergence and Error Bounds for Optimization Without Strong Convexity
by: van Treek, Kira, et al.
Published: (2025)

Bound tightening in lifted formulations: (sub)solver-dependent impact on performance in RLT-based algorithms
by: González-Díaz, Julio, et al.
Published: (2025)

Positivstellensätze and Moment problems with Universal Quantifiers
by: Hu, Xiaomeng, et al.
Published: (2024)

Optimization hierarchies for distance-avoiding sets in compact spaces
by: Bekker, Bram, et al.
Published: (2023)

Finite convergence and minimizer extraction in moment relaxations with correlative sparsity
by: Fantuzzi, Giovanni, et al.
Published: (2025)

Duality of Hoffman constants
by: Pena, Javier F., et al.
Published: (2023)

A Moment-QSOS Hierarchy for a Class of Quaternion Polynomial Optimization Problems
by: Liu, Yanqing, et al.
Published: (2026)

A more efficient reformulation of complex SDP as real SDP
by: Wang, Jie
Published: (2023)

An Overview of Convergence Rates for Sum of Squares Hierarchies in Polynomial Optimization
by: Laurent, Monique, et al.
Published: (2024)

Lagrangian Reformulation for Nonconvex Optimization: Tailoring Problems to Specialized Solvers
by: Quintero, Rodolfo A., et al.
Published: (2024)

Bounding the density of spherical polygon packings
by: Filho, Fernando Mário de Oliveira, et al.
Published: (2026)

Sum-of-squares certificates for symmetric polynomials on the hypercube: a counterexample to a conjecture of De Klerk and Laurent
by: Polak, Sven
Published: (2026)

A Low-rank Augmented Lagrangian Method for Polyhedral-SDP and Moment-SOS Relaxations of Polynomial Optimization
by: Hou, Di, et al.
Published: (2025)

A parameter-free approach for solving SOS-convex semi-algebraic fractional programs
by: Yang, Chengmiao, et al.
Published: (2024)

Outer Approximation Scheme for Weakly Convex Constrained Optimization Problems
by: Bednarczuk, Ewa M., et al.
Published: (2024)

Exploiting Sign Symmetries in Minimizing Sums of Rational Functions
by: Guo, Feng, et al.
Published: (2024)

Nonconvergence of a sum-of-squares hierarchy for global polynomial optimization based on push-forward measures
by: Slot, Lucas, et al.
Published: (2024)

Interior-point algorithms with full Newton steps for nonsymmetric convex conic optimization
by: Papp, Dávid, et al.
Published: (2025)

An extension of an RLT-based solver to MINLP polynomial problems
by: González-Díaz, Julio, et al.
Published: (2024)

Weighted Geometric Mean, Minimum Mediated Set, and Optimal Simple Second-Order Cone Representation
by: Wang, Jie
Published: (2022)

Sum-of-squares hierarchies for polynomial optimization and the Christoffel-Darboux kernel
by: Slot, Lucas
Published: (2021)

An Effective Positivstellensatz over the Rational Numbers for Finite Semialgebraic Sets
by: Baldi, Lorenzo, et al.
Published: (2024)

On the convergence of critical points on real algebraic sets and applications to optimization
by: Basu, Saugata, et al.
Published: (2025)

Sparse Polynomial Optimization with Unbounded Sets
by: Huang, Lei, et al.
Published: (2024)

A Moment-SOS Hierarchy for Robust Polynomial Matrix Inequality Optimization with SOS-Convexity
by: Guo, Feng, et al.
Published: (2023)

Sparse Polynomial Matrix Optimization
by: Miller, Jared, et al.
Published: (2024)

A Bilevel Hierarchy of Strengthened Complex Moment Relaxations for Complex Polynomial Optimization
by: Wang, Jie
Published: (2024)

Solving Low-Rank Semidefinite Programs via Manifold Optimization
by: Wang, Jie, et al.
Published: (2023)

A Dual Riemannian ADMM Algorithm for Low-Rank SDPs with Unit Diagonal
by: Wang, Jie, et al.
Published: (2025)

Semidefinite hierarchies for diagonal unitary invariant bipartite quantum states
by: Britz, Jonas, et al.
Published: (2025)

Moment-sos and spectral hierarchies for polynomial optimization on the sphere and quantum de Finetti theorems
by: Blomenhofer, Alexander Taveira, et al.
Published: (2024)

Semidefinite approximations for bicliques and biindependent pairs
by: Laurent, Monique, et al.
Published: (2023)

An ODE approach to multiple choice polynomial programming
by: Shao, Sihong, et al.
Published: (2022)

Sparse convex relaxations in polynomial optimization
by: Averkov, Gennadiy, et al.
Published: (2024)