Backing PDHG into a Corner (2511.13894v1)

Abstract: Recent enhancements to the Primal-Dual Hybrid Gradient (PDHG) algorithm have enabled GPUs to efficiently solve large linear programming problems, often faster than the long-dominant simplex and interior-point methods. The solutions found by PDHG are typically of much lower quality than those found by the alternatives, which can be remedied by following the PDHG iterations with a crossover step to obtain an accurate optimal basic solution. However, the cost of this highly sequential crossover step can be quite significant. This paper examines whether PDHG iterations can be enhanced to push the solution into a corner of the optimal LP face, thereby providing crossover a better starting point and hopefully reducing its runtime.