The authors apply spectral outer-approximation cuts from continuous SDP to binary SDP reformulations of binary QCQPs, reporting strong speedups on Boolean least squares and mixed results on quadratic knapsack.
Approximating k-means-type clustering via semidefinite programming
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Spectral Outer-Approximation Algorithms for Binary Semidefinite Problems
The authors apply spectral outer-approximation cuts from continuous SDP to binary SDP reformulations of binary QCQPs, reporting strong speedups on Boolean least squares and mixed results on quadratic knapsack.