An ADMM-based approach computes intermediate-level Lasserre hierarchy bounds for the graph stability number, achieving strong upper bounds on benchmark graphs up to 300 vertices in under an hour.
Alizadeh.Combinatorial optimization with interior point methods and semidefinite matrices
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1roles
method 1polarities
support 1representative citing papers
citing papers explorer
-
SDP bounds on the stability number via ADMM and intermediate levels of the Lasserre hierarchy
An ADMM-based approach computes intermediate-level Lasserre hierarchy bounds for the graph stability number, achieving strong upper bounds on benchmark graphs up to 300 vertices in under an hour.