PDHCG-CQP is a matrix-free GPU solver that provably converges linearly under strict complementarity for conic quadratic programs and scales to 440 million variables on 8 GPUs.
A first-order primal-dual algorithm for convex problems with applications to imaging.Journal of Mathematical Imaging and Vision, 40:120–145, 2011
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
math.OC 1years
2026 1verdicts
CONDITIONAL 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity
PDHCG-CQP is a matrix-free GPU solver that provably converges linearly under strict complementarity for conic quadratic programs and scales to 440 million variables on 8 GPUs.