GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity
PDHCG-CQP achieves state-of-the-art robustness among first-order solvers while scaling efficiently to 8 GPUs and instances with up to $4.4\times10^8$ stored primal coordinates.