3 papers
math.OC2026
Hardness of some optimization problems over correlation polyhedra
Alberto Caprara, Fabio Furini, Claudio Gentile +2
We prove the \textbf{NP}-hardness, using Karp reductions, of some problems related to the correlation polytope and its corresponding cone, spanned by all of the rank-on…
math.OC2026
Chvátal-Gomory Rounding of Eigenvector Inequalities for QCQPs
Santanu S. Dey, Nan Jiang, Aleksandr Kazachkov +2
We introduce and analyze a class of valid inequalities for nonconvex quadratically constrained optimization problems (QCQPs) which we call Eigen-CG inequalities. These inequalities…
math.OC2026
Batched First-Order Methods for Parallel LP Solving in MIP
Nicolas Blin, Stefano Gualandi, Christopher Maes +2
We present a batched first-order method for solving multiple linear programs in parallel on GPUs. Our approach extends the primal-dual hybrid gradient algorithm to efficiently solv…