Metraipolis › archive › dc_456491da89c6
GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity — arXiv:2608.09159
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.09159
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T08:52:48.829Z
- SHA-256 of the archived text
5e042e7c4306872d594c74e0b86c20d90427bf2eb779d7b0664458657667adf0- Stable URL of this page
https://metraipolis.com/documento/dc_456491da89c6
How to cite
GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity — arXiv:2608.09159 — arXiv (en), https://arxiv.org/abs/2608.09159 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_456491da89c6 (Metraipolis archive dc_456491da89c6, sha256 5e042e7c4306872d594c74e0b86c20d90427bf2eb779d7b0664458657667adf0)
BibTeX
@misc{dc456491da89c6,
title = {GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity — arXiv:2608.09159},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.09159},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_456491da89c6; sha256 5e042e7c4306872d594c74e0b86c20d90427bf2eb779d7b0664458657667adf0},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.09159. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We present PDHCG-CQP, a GPU-accelerated first-order solver for large-scale conic convex quadratic programming. PDHCG-CQP supports affine constraints and Cartesian products of nonnegative, second-order, rotated second-order, exponential, and three-dimensional power cones. At its core is a restarted averaged primal-dual hybrid gradient (PDHG) method, whose primal update is computed inexactly by solving a conic quadratic proximal subproblem with projected gradient iterations. We establish local linear convergence of the restarted averaged scheme with both exact and inexact primal proximal evaluations under a uniform local quadratic-growth condition on the smoothed primal-dual gap. We further show that this condition holds under strict complementarity by exploiting a rotated second-order-cone lifting together with local primal and dual regularity conditions. Our C/CUDA implementation combines matrix-free linear algebra, batched cone projections, adaptive inner solves, reflected-Halpern acceleration, and fully device-resident KKT residual computations. It also supports multi-GPU execution through a two-dimensional partitioning of the problem data. Extensive experiments on standard and large-scale quadratic programming (QP), convex quadratically constrained quadratic programming (QCQP), second-order cone programming (SOCP), and quasilinear Fisher equilibrium benchmarks demonstrate that 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. PDHCG-CQP is open source and available at this https URL . Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-08-11 in cs.DC). Categorie arXiv: Optimization and Control (math.OC) ; Distributed, Parallel, and Cluster Computing (cs.DC); Mathematical Software (cs.MS). Pagina del lavoro: https://arxiv.org/abs/2608.09159 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-19T08:50:23.782Z dalla pagina https://arxiv.org/catchup/cs.DC/2026-08-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).