3 papers
math.OC2025
On the Relationships among GPU-Accelerated First-Order Methods for Solving Linear Programming
Kaihuang Chen, Defeng Sun, Yancheng Yuan +2
This paper aims to understand the relationships among recently developed GPU-accelerated first-order methods (FOMs) for linear programming (LP), with particular emphasis on HPR-LP…
math.OC2025
HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming
Kaihuang Chen, Defeng Sun, Yancheng Yuan +2
In this paper, we introduce HPR-QP, a dual Halpern Peaceman-Rachford (HPR) method designed for solving large-scale convex composite quadratic programming. One distinctive feature o…
math.OC2025
Peaceman-Rachford Splitting Method Converges Ergodically for Solving Convex Optimization Problems
Kaihuang Chen, Defeng Sun, Yancheng Yuan +2
In this paper, we prove that the ergodic sequence generated by the Peaceman-Rachford (PR) splitting method with semi-proximal terms converges for convex optimization problems (COPs…