A partially parallel splitting method for multiple-block separable convex programming with applications to robust PCA
On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators