arXiv (All)
open access
GPU-Accelerated Preprocessing for Large-Scale Linear Programming
GPU-accelerated first-order methods are increasingly effective for solving large-scale linear programs (LPs), yet LP preprocessing remains predominantly CPU-based and can become costly. A key challenge is that dependencies among presolve reductions and frequent modifications to sparse LP data make e
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
- Comparison of Algebraic Block Multi-Coloring and Leiden Methods for Parallel Preconditioning in the ICCG Method#820000
- Low-Order Refined Preconditioning for Spectral/hp Element Method for Complex, 3D Geometries#1106142
- Error feedback can accurately compress preconditioners#1251623
- Operator Splitting Methods with Online Scaling#997724
- AlgMortar: a fully algebraic multiscale mortar preconditioner#1297209
Record · ID 1354523
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