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

Documenti analoghi

• Improved semidefinite programming bounds for the maximum $k$-colorable subgraph problem
  di: Barkel, Mathijs, et al.
  Pubblicazione: (2026)
• On convergence of a $q$-random coordinate constrained algorithm for non-convex problems
  di: Ghaffari-Hadigheh, Alireza, et al.
  Pubblicazione: (2022)
• Cuts and semidefinite liftings for the complex cut polytope
  di: Sinjorgo, Lennart, et al.
  Pubblicazione: (2024)
• Strong SDP based bounds on the cutwidth of a graph
  di: Gaar, Elisabeth, et al.
  Pubblicazione: (2023)
• On exactness of SDP relaxation for the maximum cut problem
  di: Bhardwaj, Avinash, et al.
  Pubblicazione: (2025)