Concurrent Crossover for PDHG

Abstract: First-order methods based on the PDHG algorithm have recently emerged as a viable option for efficiently solving large-scale linear programming problems. One highly desirable property of these methods is that they can make effective use of GPUs. One undesirable property is that, as first-order methods, their convergence can be extremely slow. This property forces one to decide how much accuracy is truly necessary when solving an LP problem. This paper looks at whether a parallel, concurrent crossover scheme can help to obtain highly accurate solutions without sacrificing the benefits of these new approaches.