collaborators

1 paper

math.OC2026

Sparsity-Cone SDP Relaxations and Applications to Variable Fixing for Sparse Quadratic Programs

Di Hou, Thai P. D. Nguyen, Kim-Chuan Toh +1

Quadratic programs (QPs) with sparsity constraint are generally NP-hard, and their efficient global solution depends crucially on tractable tight convex relaxations. In this paper,…