2 papers
math.OC2025
High-Probability Polynomial-Time Complexity of Restarted PDHG for Linear Programming
Zikai Xiong
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. Des…
math.OC2024
Accessible Complexity Bounds for Restarted PDHG on Linear Programs with a Unique Optimizer
Zikai Xiong
The restarted primal-dual hybrid gradient method (rPDHG) has recently emerged as an important tool for solving large-scale linear programs (LPs). For LPs with unique optima, we pre…