Image de couverture de livre

SDP bounds on the stability number via ADMM and intermediate levels of the Lasserre hierarchy

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Sinjorgo, Lennart, Sotirov, Renata, Vera, Juan C.
Format:	Preprint
Publié:	2025
Sujets:	Optimization and Control 90C22, 90C27
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Improved semidefinite programming bounds for the maximum $k$-colorable subgraph problem
par: Barkel, Mathijs, et autres
Publié: (2026)

On convergence of a $q$-random coordinate constrained algorithm for non-convex problems
par: Ghaffari-Hadigheh, Alireza, et autres
Publié: (2022)

Cuts and semidefinite liftings for the complex cut polytope
par: Sinjorgo, Lennart, et autres
Publié: (2024)

Strong SDP based bounds on the cutwidth of a graph
par: Gaar, Elisabeth, et autres
Publié: (2023)

On exactness of SDP relaxation for the maximum cut problem
par: Bhardwaj, Avinash, et autres
Publié: (2025)

SDP Approach to Quadratic Vertex-Disjoint Paths Problem
par: Xu, Mingming, et autres
Publié: (2026)

Edge expansion of a graph: SDP-based computational strategies
par: Gupte, Akshay, et autres
Publié: (2024)

A Computational Search for Minimal Obstruction Graphs for the Lovász--Schrijver SDP Hierarchy
par: Au, Yu Hin, et autres
Publié: (2025)

The exact subgraph hierarchy and its vertex-transitive variant for the stable set problem for Paley graphs
par: Gaar, Elisabeth, et autres
Publié: (2024)

A more efficient reformulation of complex SDP as real SDP
par: Wang, Jie
Publié: (2023)

Practical Experience with Stable Set and Coloring Relaxations
par: Pucher, Dunja, et autres
Publié: (2024)

Beyond binarity: Semidefinite programming for ternary quadratic problems
par: de Meijer, Frank, et autres
Publié: (2026)

Improved approximation ratios for the Quantum Max-Cut problem on general, triangle-free and bipartite graphs
par: Gribling, Sander, et autres
Publié: (2025)

Stable Set Polytopes with Rank $|V(G)|/3$ for the Lovász--Schrijver SDP Operator
par: Au, Yu Hin, et autres
Publié: (2025)

Separable QCQPs and Their Exact SDP Relaxations
par: Kojima, Masakazu, et autres
Publié: (2026)

Constructing QCQP Instances Equivalent to Their SDP Relaxations
par: Kojima, Masakazu, et autres
Publié: (2025)

Projection, Degeneracy, and Singularity Degree for Spectrahedra
par: Im, Haesol, et autres
Publié: (2024)

A Low-rank Augmented Lagrangian Method for Polyhedral-SDP and Moment-SOS Relaxations of Polynomial Optimization
par: Hou, Di, et autres
Publié: (2025)

Exact SDP relaxations for a class of quadratic programs with finite and infinite quadratic constraints
par: Arima, Naohiko, et autres
Publié: (2024)

Computational complexity of sum-of-squares bounds for copositive programs
par: Palomba, Marilena, et autres
Publié: (2025)

On different Versions of the Exact Subgraph Hierarchy for the Stable Set Problem
par: Gaar, Elisabeth
Publié: (2020)

Lagrangian Reformulation for Nonconvex Optimization: Tailoring Problems to Specialized Solvers
par: Quintero, Rodolfo A., et autres
Publié: (2024)

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

Relaxations of KKT Conditions do not Strengthen Finite RLT and SDP-RLT Bounds for Nonconvex Quadratic Programs
par: Yildirim, E. Alper
Publié: (2025)

Exact Solutions for the NP-hard Wasserstein Barycenter Problem using a Doubly Nonnegative Relaxation and a Splitting Method
par: Jung, Woosuk L., et autres
Publié: (2023)

On generators of $k$-PSD closures of the positive semidefinite cone
par: Bhardwaj, Avinash, et autres
Publié: (2024)

Nonconvergence of a sum-of-squares hierarchy for global polynomial optimization based on push-forward measures
par: Slot, Lucas, et autres
Publié: (2024)

The link between $1$-norm approximation and effective Positivstellensatze for the hypercube
par: de Klerk, Etienne, et autres
Publié: (2024)

Semidefinite approximations for bicliques and biindependent pairs
par: Laurent, Monique, et autres
Publié: (2023)

Upper bound hierarchies for noncommutative polynomial optimization
par: Klep, Igor, et autres
Publié: (2024)

A Dual Riemannian ADMM Algorithm for Low-Rank SDPs with Unit Diagonal
par: Wang, Jie, et autres
Publié: (2025)

Application of the Lovász-Schrijver Lift-and-Project Operator to Compact Stable Set Integer Programs
par: Battista, Federico, et autres
Publié: (2024)

The rainbow covering number of clean tangled clutters
par: Abdi, Ahmad, et autres
Publié: (2025)

A semidefinite programming hierarchy for covering problems in discrete geometry
par: Riener, Cordian, et autres
Publié: (2023)

Evacuation Planning on Time-Expanded Networks with Integrated Wildfire Information
par: Borgwardt, Steffen, et autres
Publié: (2024)

Relaxations for binary polynomial optimization via signed certificates
par: Xu, Liding, et autres
Publié: (2024)

Solving Cutting Stock Problems via an Extended Ryan-Foster Branching Scheme and Fast Column Generation
par: da Silva, Renan F. F., et autres
Publié: (2023)

On the numerical solution of Lasserre relaxations of unconstrained binary quadratic optimization problem
par: Habibi, Soodeh, et autres
Publié: (2024)

Benchmarking of quantum and classical SDP relaxations for QUBO formulations of real-world logistics problems
par: Ostermann, Birte, et autres
Publié: (2025)

Speeding up the Goemans-Williamson randomized procedure by difference-of-convex optimization
par: Salloum, Hadi, et autres
Publié: (2025)