arXiv (All)
open access
High-Probability Polynomial-Time Complexity of Restarted PDHG for Linear Programming
The restarted primal-dual hybrid gradient method (rPDHG) is a first-order method recently known for its computational effectiveness in solving linear programming (LP) problems. Despite its impressive practical performance, the theoretical iteration bounds for rPDHG can be exponentially poor. To inve
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
- An accelerated proximal PRS-SQP algorithm with dual ascent-descent procedures for smooth composite optimization#1131393
- Accelerated Bregman Proximal Gradient Methods from Dual Geometric Perspectives#1129394
- Accessible Complexity Bounds for Restarted PDHG on Linear Programs with a Unique Optimizer#987387
- Presolve heuristics in HiGHS: implementation and computational study#1037621
- Mat2Boundary: Treating User-Defined Boundary Condition as SpMV for Distributed PDE Solvers on Block-Structured Grids#187281
Record · ID 987399
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