:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Fantuzzi, Giovanni, Fuentes, Federico
Formato:	Preprint
Publicado:	2025
Materias:	Optimization and Control 90C23
Acceso en línea:	https://arxiv.org/abs/2502.01410
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Global minimization of polynomial integral functionals
por: Fantuzzi, Giovanni, et al.
Publicado: (2023)

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

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

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

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

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

The link between $1$-norm approximation and effective Positivstellensatze for the hypercube
por: de Klerk, Etienne, 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)

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

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

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

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

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

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)

Nonconvergence of a sum-of-squares hierarchy for global polynomial optimization based on push-forward measures
por: Slot, Lucas, 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)

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

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

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)

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

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

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

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

On the hardness of deciding the finite convergence of Lasserre hierarchies
por: Vargas, Luis Felipe
Publicado: (2024)

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

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

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

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

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

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

Majorization-minimization Bregman proximal gradient algorithms for NMF with the Kullback--Leibler divergence
por: Takahashi, Shota, et al.
Publicado: (2024)

Strict Copositivity for a Class of 3rd Order Symmetric Tensors
por: Li, Min, et al.
Publicado: (2024)

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

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

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

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

Quantifying the Safety of Trajectories using Peak-Minimizing Control
por: Miller, Jared, et al.
Publicado: (2023)

Exploring chordal sparsity in semidefinite programming with sparse plus low-rank data matrices
por: Tang, Tianyun, et al.
Publicado: (2024)