DNN and SDP-RLT relaxations of mixed-binary quadratic programs are proved to give identical bounds, and the new hybrid Riemannian solver RiNNAL+ solves the smaller SDP-RLT form at n = 5000, typically 10 to 100 times faster than SDPNAL+ where the latter converges.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
RiNNAL+: a Riemannian ALM Solver for SDP-RLT Relaxations of Mixed-Binary Quadratic Programs
DNN and SDP-RLT relaxations of mixed-binary quadratic programs are proved to give identical bounds, and the new hybrid Riemannian solver RiNNAL+ solves the smaller SDP-RLT form at n = 5000, typically 10 to 100 times faster than SDPNAL+ where the latter converges.