Faster Convergence Rates of Relaxed Peaceman-Rachford and ADMM Under Regularity Assumptions I: Relaxed PRS Regularity Terms Have o(1/(k+1)) Best-Iterate and o(1/√(k+1)) Nonergodic RatesResearch Paper
Peaceman–Rachford splitting and its relaxed forms solve the problem of minimizing a sum by evaluating the two proximal maps separately. This is useful when minimizing either function by itself is simple while minimizing their sum directly is not. Douglas–Rachford splitting is the half-relaxed case. Davis and Yin study which properties of and turn…