Cover Image

On the hardness of deciding the finite convergence of Lasserre hierarchies

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Vargas, Luis Felipe
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control 90C23, 90c20, 68Q17, 11E25
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Accelerating preconditioned ADMM via degenerate proximal point mappings
by: Sun, Defeng, et al.
Published: (2024)

The Complexity Landscape of Two-Stage Robust Selection Problems with Budgeted Uncertainty
by: Goerigk, Marc, et al.
Published: (2026)

A constraint-based approach to function interpolation, with application to performance estimation for weakly convex optimisation
by: Rubbens, Anne, et al.
Published: (2024)

Interpolation Conditions for Linear Operators and Applications to Performance Estimation Problems
by: Bousselmi, Nizar, et al.
Published: (2023)

Kurdyka-Łojasiewicz exponent via Hadamard parametrization
by: Ouyang, Wenqing, et al.
Published: (2024)

Universal Complexity Bounds for Universal Gradient Methods in Nonlinear Optimization
by: Nesterov, Yurii
Published: (2025)

Kurdyka-Łojasiewicz exponent via square transformation
by: Ouyang, Wenqing
Published: (2025)

Halpern Acceleration of the Inexact Proximal Point Method of Rockafellar
by: Zhang, Liwei, et al.
Published: (2025)

Grassmannian optimization is NP-hard
by: Lai, Zehua, et al.
Published: (2024)

Stiefel optimization is NP-hard
by: Lai, Zehua, et al.
Published: (2025)

Concave Certificates: Geometric Framework for Distributionally Robust Risk and Complexity Analysis
by: Chu, Hong T. M.
Published: (2026)

Uncomputability of Global Optima for Nonconvex Functions in the Oracle Model
by: Lakshmanan, K
Published: (2023)

Analysis of Kernel Mirror Prox for Measure Optimization
by: Dvurechensky, Pavel, et al.
Published: (2024)

Exact Solution to Data-Driven Inverse Optimization of MILPs in Finite Time via Gradient-Based Methods
by: Kitaoka, Akira
Published: (2024)

CompressedScaffnew: The First Theoretical Double Acceleration of Communication from Local Training and Compression in Distributed Optimization
by: Condat, Laurent, et al.
Published: (2022)

Topological structure and a polynomial-time solution of linear programming over the real numbers
by: Wei, Jing-Yuan
Published: (2018)

A non-iterative polynomial algorithm for linear programming
by: Jing-Yuan, Wei
Published: (2013)

Improved global performance guarantees of second-order methods in convex minimization
by: Dvurechensky, Pavel, et al.
Published: (2024)

Performance Estimation of second-order optimization methods on classes of univariate functions
by: Rubbens, Anne, et al.
Published: (2025)

Harnessing Inferior Solutions For Superior Outcomes: Obtaining Robust Solutions From Quantum Algorithms
by: Halffmann, Pascal, et al.
Published: (2024)

Copositive and completely positive cones over symmetric cones of rank at least 5
by: Nishijima, Mitsuhiro
Published: (2026)

Dimension-free estimators of gradients of functions with(out) non-independent variables
by: Lamboni, Matieyendou
Published: (2025)

Fast Reflected Forward-Backward algorithm: achieving fast convergence rates for convex optimization with linear cone constraints
by: Bot, Radu Ioan, et al.
Published: (2024)

Geometry-dependent matching pursuit: a transition phase for convergence on linear regression and LASSO
by: Moucer, Céline, et al.
Published: (2024)

Solving Regularized Multifacility Location Problems with Unknown Number of Centers via Difference-of-Convex Optimization
by: Geremew, W., et al.
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)

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

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

A polynomial-time algorithm for deciding the Hilbert Nullstellensatz over $\mathbb{Z}_2$. A proof of $\mathbf{P}=\mathbf{NP}$ hypothesis
by: Petrov, Petar P.
Published: (2022)

Barrier Algorithms for Constrained Non-Convex Optimization
by: Dvurechensky, Pavel, et al.
Published: (2024)

Riemannian Adaptive Regularized Newton Methods with Hölder Continuous Hessians
by: Zhang, Chenyu, et al.
Published: (2023)

A semiconcavity approach to stability of entropic plans and exponential convergence of Sinkhorn's algorithm
by: Chiarini, Alberto, et al.
Published: (2024)

Gaussian smoothing gradient descent for minimizing functions (GSmoothGD)
by: Starnes, Andrew, et al.
Published: (2023)

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

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

A Moment-SOS Hierarchy for Robust Polynomial Matrix Inequality Optimization with SOS-Convexity
by: Guo, Feng, 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)

Wall-Clock Complexity for Zeroth-Order Optimization with Tunable Oracle Fidelity
by: Suvorikova, Alexandra, et al.
Published: (2026)

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