Accessible Complexity Bounds for Restarted PDHG on Linear Programs with a Unique Optimizer

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 present an iteration bound of $O\left(κΦ\cdot\ln\left(\frac{κΦ\|w^*\|}{\varepsilon}\right)\right)$, where $\varepsilon$ is