Sparse Certificates Turn Automated Bounds Into Simpler Proofs
Post-processing Lagrangian dual certificates with sparsification and SDP searches cuts an FGM N=3 active set from 16 multipliers to 6.
Jul 12, 20264 min2607.08753
Aymeric Dieuleveut
1 article on SOTA Papers