Cover Image

Duality attainment and strict feasibility of the generalized moment problem and its relaxations

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Halaseh, Sami, Magron, Victor, Skomra, Mateusz
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control 90C22, 90C23
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Finite Convergence of the Moment-SOS Hierarchy on the Product of Spheres
by: Halaseh, Sami, et al.
Published: (2025)

Exploiting Sparsity in Complex Polynomial Optimization
by: Wang, Jie, et al.
Published: (2021)

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

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)

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

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

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)

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)

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)

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

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)

Benchmarking of quantum and classical SDP relaxations for QUBO formulations of real-world logistics problems
by: Ostermann, Birte, 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)

On exactness of SDP relaxation for the maximum cut problem
by: Bhardwaj, Avinash, et al.
Published: (2025)

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)

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

Dual certificates of primal cone membership
by: Lee, Joonyeob, et al.
Published: (2025)

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

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

T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization
by: Marumo, Hiroki, et al.
Published: (2024)

A polynomial projective algorithm for convex feasibility problems with positive-definite constraints
by: Chubanov, Sergei
Published: (2025)

Solving clustered low-rank semidefinite programs arising from polynomial optimization
by: Leijenhorst, Nando, et al.
Published: (2022)

Tighter yet more tractable relaxations and nontrivial instance generation for sparse standard quadratic optimization
by: Bomze, Immanuel, et al.
Published: (2024)

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

A low-rank augmented Lagrangian method for doubly nonnegative relaxations of mixed-binary quadratic programs
by: Hou, Di, et al.
Published: (2025)

Computational complexity of sum-of-squares bounds for copositive programs
by: Palomba, Marilena, et al.
Published: (2025)

Exact SDP relaxations for a class of quadratic programs with finite and infinite quadratic constraints
by: Arima, Naohiko, et al.
Published: (2024)

Upper bound hierarchies for noncommutative polynomial optimization
by: Klep, Igor, et al.
Published: (2024)

Degree Bounds for Positivstellensätze of general semialgebraic sets
by: Heijmans-Kuryatnikova, Olga, et al.
Published: (2026)

Sparse decompositions of nonlinear dynamical systems and applications to moment-sum-of-squares relaxations
by: Schlosser, Corbinian, et al.
Published: (2020)

A preconditioned augmented Lagrangian method for solving semidefinite programming problems
by: Tang, Tianyun, et al.
Published: (2026)

Second-order sequential optimality conditions for nonlinear semidefinite optimization problems
by: Li, Huimin, et al.
Published: (2025)