On the Douglas–Rachford Algorithm for Solving Possibly Inconsistent Optimization Problems: The Primal Shadows Converge Weakly, and in Value, to a Solution of the Normal ProblemResearch Paper
The Douglas–Rachford algorithm is one of the most widely used splitting methods for minimizing a sum of two convex functions, or more generally for finding a zero of a sum of two maximally monotone operators. It touches each summand only through its proximal mapping (resolvent), which is why it underlies ADMM and a large share of first-order…