arXiv (All)
open access
A Practical GPU-Enhanced Matrix-Free Primal-Dual Method for Large-Scale Conic Programs
In this paper, we introduce a practical GPU-enhanced matrix-free first-order method for solving large-scale conic programming problems, which we refer to as PDCS, standing for the Primal-Dual Conic Programming Solver. Problems that it solves include linear programs, second-order cone programs, conve
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- From SGD to Muon: Adaptive Optimization via Schatten-p Norms#1297136
- Low-Latency Coded Tensor--Matrix Multiplication for Distributed Signal Processing Systems#1104766
- Accelerating Branch MPC with Two-Level Parallel Direct Solves on GPUs#1078048
- High-Probability Polynomial-Time Complexity of Restarted PDHG for Linear Programming#987399
- Reinforcement Learning to Accelerate Primal-Dual Hybrid Gradient for Linear Programming#1156818
Record · ID 1489274
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive