Copertina

Computational complexity of sum-of-squares bounds for copositive programs

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Palomba, Marilena, Slot, Lucas, Vargas, Luis Felipe, Mastrolilli, Monaldo
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Optimization and Control Computational Complexity 90C22, 90C23, 90C25, 90C27, 90C51, 90C60
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

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

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

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

On Second-Order Cone Functions
di: Jibrin, Shafiu, et al.
Pubblicazione: (2023)

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

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

Projection, Degeneracy, and Singularity Degree for Spectrahedra
di: Im, Haesol, et al.
Pubblicazione: (2024)

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

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

A squared smoothing Newton method for semidefinite programming
di: Liang, Ling, et al.
Pubblicazione: (2023)

New complexity bounds for primal--dual interior-point algorithms in conic optimization
di: Dahl, Joachim, et al.
Pubblicazione: (2025)

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

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

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

Asymmetric Long-Step Primal-Dual Interior-Point Methods with Dual Centering
di: Nesterov, Yurii
Pubblicazione: (2025)

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

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

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

Sparse Polynomial Matrix Optimization
di: Miller, Jared, et al.
Pubblicazione: (2024)

A new dual spectral projected gradient method for log-determinant semidefinite programming with hidden clustering structures
di: Namchaisiri, Charles, et al.
Pubblicazione: (2024)

Non-Attainment of Minima in Non-Polyhedral Conic Optimization: A Robust SOCP Example
di: Nguyen, Vinh
Pubblicazione: (2025)

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

A Modified Proximal Bundle Method Under A Frank-Wolfe Perspective
di: Fersztand, David, et al.
Pubblicazione: (2024)

Further Development in Convex Conic Reformulation of Geometric Nonconvex Conic Optimization Problems
di: Arima, Naohiko, et al.
Pubblicazione: (2023)

Extending Exact Convex Relaxations of Quadratically Constrained Quadratic Programs
di: Kojima, Masakazu, et al.
Pubblicazione: (2025)

Separable QCQPs and Their Exact SDP Relaxations
di: Kojima, Masakazu, et al.
Pubblicazione: (2026)

Constructing QCQP Instances Equivalent to Their SDP Relaxations
di: Kojima, Masakazu, et al.
Pubblicazione: (2025)

Edge expansion of a graph: SDP-based computational strategies
di: Gupte, Akshay, et al.
Pubblicazione: (2024)

SDP Approach to Quadratic Vertex-Disjoint Paths Problem
di: Xu, Mingming, et al.
Pubblicazione: (2026)

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

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

Exponential Conic Optimization for Multi-Regime Service System Design under Congestion and Tail-Risk Control
di: Blanco, Víctor, et al.
Pubblicazione: (2026)

Parallelizing the Circumcentered-Reflection Method
di: Barros, Pablo, et al.
Pubblicazione: (2025)

Optimal Subgradient Methods for Lipschitz Convex Optimization with Error Bounds
di: Wang, Alex L.
Pubblicazione: (2025)

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

Dual Spectral Projected Gradient Method for Generalized Log-det Semidefinite Programming
di: Namchaisiri, Charles, et al.
Pubblicazione: (2024)

Solving Sparsity Constrained PCA, Regression, and QCQP via the Spartrahedron
di: Cifuentes, Diego, et al.
Pubblicazione: (2026)

A polynomial time infeasible interior-point arc-search algorithm for convex optimization
di: Yang, Yaguang
Pubblicazione: (2022)