High-Probability Polynomial-Time Complexity of Restarted PDHG for Linear Programming
math.OC
Submitted: 2025-01-01
Updated: 2026-09-09
Terminology
Sources
- Restarted Halpern PDHG for Linear Programming
- cuPDLP-C: A Strengthened Implementation of cuPDLP for Linear Programming by C language
- On the Relation Between LP Sharpness and Limiting Error Ratio and Complexity Implications for Restarted PDHG
- The Role of Level-Set Geometry on the Performance of PDHG for Conic Linear Optimization
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