Imagen de Portada

Moment-sos and spectral hierarchies for polynomial optimization on the sphere and quantum de Finetti theorems

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Blomenhofer, Alexander Taveira, Laurent, Monique
Formato:	Preprint
Publicado:	2024
Materias:	Optimization and Control 90C23, 90C22, 81P45
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

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

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

Benchmarking of quantum and classical SDP relaxations for QUBO formulations of real-world logistics problems
por: Ostermann, Birte, et al.
Publicado: (2025)

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

A quantum dual logarithmic barrier method for linear optimization
por: Wu, Zeguan, et al.
Publicado: (2024)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Sparse Polynomial Matrix Optimization
por: Miller, Jared, et al.
Publicado: (2024)

Long-Step Path-Following Algorithm for Quantum Information Theory: Some Numerical Aspects and Applications
por: Faybusovich, Leonid, et al.
Publicado: (2019)

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

A preconditioned inexact infeasible quantum interior point method for linear optimization
por: Wu, Zeguan, et al.
Publicado: (2024)

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

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

On odd powers of nonnegative polynomials that are not sums of squares
por: Blekherman, Grigoriy, et al.
Publicado: (2024)

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

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

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

SDP bounds on the stability number via ADMM and intermediate levels of the Lasserre hierarchy
por: Sinjorgo, Lennart, et al.
Publicado: (2025)

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

Tight Semidefinite Relaxations for Verifying Robustness of Neural Networks
por: Azuma, Godai, et al.
Publicado: (2025)

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

Piecewise SOS-Convex Moment Optimization and Applications via Exact Semi-Definite Programs
por: Huang, Queenie Yingkun, et al.
Publicado: (2024)

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

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