43 citations · 80 across the 22 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
math.OC2026
On the SDP relaxation gap for Submodular Box-Constrained Quadratic Programming
Junyu Zhang, Guanyi Wang
Continuous submodular optimization is an important class of nonconvex problems with global guarantees, for which the submodular box-constrained quadratic programming (BCQP) forms a…
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,…
cs.AI2026
Automated Reformulation of Robust Optimization via Memory-Augmented Large Language Models
Jinbiao Chen, Shuang Jin, Guoyun Zhang +3
Robust optimization (RO) provides a principled framework for decision-making under uncertainty, but its practical use is often limited by the need to manually reformulate uncertain…