CuClarabel: GPU Acceleration for a Conic Optimization Solver
We present the GPU implementation of the general-purpose interior-point solver Clarabel for convex optimization problems with conic constraints. We introduce a mixed parallel computing strategy that processes linear constraints first, then handles other conic constraints in parallel. The GPU solver currently supports linear equality and inequality constraints, second-order cones, exponential cones, power cones and positive semidefinite cones of the same dimensionality. We demonstrate that integrating a mixed parallel computing strategy with GPU-based direct linear system solvers enhances the performance of GPU-based conic solvers, surpassing their CPU-based counterparts across a wide range of conic optimization problems. We also show that employing mixed-precision linear system solvers can potentially achieve additional acceleration without compromising solution accuracy.
Authors
- Paul J. Goulart (ORCID: https://orcid.org/0000-0002-0456-4124)
- Stephen Boyd (ORCID: https://orcid.org/0000-0001-8353-6000)
- Yuwen Chen (ORCID: https://orcid.org/0000-0003-3129-7698)
- Parth Nobel (ORCID: https://orcid.org/0000-0002-8228-7441)
Institutions
- University of Oxford (GB)
- École Polytechnique Fédérale de Lausanne (CH)
- Stanford University (US)
Publication Details
- Journal
- ACM Transactions on Mathematical Software
- Published
- 2026-05-21
- DOI
- https://doi.org/10.1145/3815420
- Primary Topic
- Parallel Computing and Optimization Techniques
- Type
- preprint
- Field-Weighted Citation Impact
- 0.00
Funders
- National Science Foundation
- Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung
- Engineering and Physical Sciences Research Council