Faster Convergence Rates of Relaxed Peaceman-Rachford and ADMM Under Regularity Assumptions II: With One Lipschitz Gradient, the Best Relaxed PRS Objective Error Is o(1/(k+1))Research Paper
Many problems in signal processing, statistics and machine learning ask to minimise a sum of two convex functions, each of which is easy to handle on its own through its proximal operator but not jointly. Operator-splitting methods exploit exactly that structure. The Douglas–Rachford (DRS) and Peaceman–Rachford (PRS) splitting schemes, introduced for…