Recent Developments in HPR Methods for Large-Scale Linear Programming
math.OC
Submitted: 2026-11-01
Updated: 2026-11-01
Code: https://github.com/ohinder/large
Project page: https://hpr.top
Terminology
Sources
- HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming
- Peaceman-Rachford Splitting Method Converges Ergodically for Solving Convex Optimization Problems
- cuPDLPx: A Further Enhanced GPU-Based First-Order Solver for Linear Programming
- Restarted Halpern PDHG for Linear Programming
- cuPDLP-C: A Strengthened Implementation of cuPDLP for Linear Programming by C language
Related papers
- An Accelerated Proximal Gradient Method for Bures-Wasserstein Space
- FOMTools: Development and AI-Assisted Code Generation for First-Order Methods
- Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise
- Dynamic Service Recommendation with Congestion-Dependent Joining: Near-Optimal and Constant-Factor Approximation Algorithms
- Integrating Learning and Optimization for Open Transport Capacity Pooling under Disruption
- Zeroth-Order Gradient Estimators under Decision-Dependent Noise