A proximal Peaceman–Rachford splitting method for solving the multi-block separable convex minimization problems

References

• S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, Distributed optimization and statistical learning via the alternating direction method of multipliers, Found. Trends Mach. Learn. 3 (2010), pp. 1–122. doi: 10.1561/2200000016
   Google Scholar
• Y.H. Dai, D.R. Han, X.M. Yuan, and W.X. Zhang, A sequential updating scheme of the lagrange multiplier for separable convex programming, Math. Comput. 86 (2017), pp. 315–343. doi: 10.1090/mcom/3104
   Web of Science ®Google Scholar
• W. Deng, M.J. Lai, Z.M. Peng, and W.T. Yin, Parallel multi-block ADMM with o(1/k) convergence, J. Sci. Comput. 71 (2017), pp. 712–736. doi: 10.1007/s10915-016-0318-2
   Web of Science ®Google Scholar
• J. Douglas and H.H. Rachford, On the numerical solution of the heat conduction problem in 2 and 3 space variables, Trans. Amer. Math. Soc. 82 (1956), pp. 420–439. doi: 10.1090/S0002-9947-1956-0084194-4
   Google Scholar
• J. Eckstein and D.P. Bertsekas, On the Douglas–Rachford splitting method and the proximal point algorithm for maximal monotone opertors, Math. Program. 55 (1992), pp. 293–318. doi: 10.1007/BF01581204
   Web of Science ®Google Scholar
• J. Eckstein and W. Yao, Understanding the convergence of the alternating direction method of multipliers: Theoretical and computational perspectives, Pacific J. Optim. 11 (2015), pp. 619–644.
   Web of Science ®Google Scholar
• F. Facchinei and J.S. Pang, Finite-dimensional variational inequalities and complementarity problems, Vol. II, Springer Ser. Oper. Res., Springer, New York, 2003.
   Google Scholar
• D. Gabay, Application of the method of multipliers to variational inequalities, in Augmented Lagrange Methods: Applications to the Solution of Boundary-Valued Problems, M. Fortin and R. Glowinski, eds., North-Holland, Amsterdam, 1983, pp. 299–331.
   Google Scholar
• R. Glowinski and A. Marroco, Sur l'approximation, par éléments finis d'ordre un, et la résolution, par pénalisation-dualité d'une classe de problèmes de Dirichlet non linéaires, Revue Fr. Autom. Inform. Rech. Opér., Anal. Numér. 2 (1975), pp. 41–76.
   Google Scholar
• D.R. Han and X.M. Yuan, Convergence analysis of the Peaceman–Rachford splitting method for nonsmooth convex optimization, preprint (2013). Available at http://www.optimization-online.org/DB_FILE/2012/11/3689.pdf.
   Google Scholar
• D.R. Han, W.W. Kong, and W.X. Zhang, A partial splitting augmented Lagrangian method for low patch-rank image decomposition, J. Math. Imaging Vision 51 (2015), pp. 145–160. doi: 10.1007/s10851-014-0510-7
   Web of Science ®Google Scholar
• B.S. He, H. Liu, Z.R. Wang, and X.M. Yuan, A strictly contractive Peaceman-Rachford splitting method for convex programming, SIAM J. Optim. 24 (2014), pp. 1011–1040. doi: 10.1137/13090849X
   PubMed Web of Science ®Google Scholar
• B.S. He, M. Tao, and X.M. Yuan, A splitting method for separable convex programming, IMA J. Numer. Anal. 35 (2015), pp. 394–426. doi: 10.1093/imanum/drt060
   Web of Science ®Google Scholar
• B.S. He, H. Liu, J.W. Lu, and X.M. Yuan, Application of the strictly contractive Peaceman–Rachford splitting method to multi-block separable convex programming, in Splitting Methods in Communication, Imaging, Science, and Engineering, R. Glowinski, S. Osher and W.T. Yin, eds., Springer, Switzerland, 2016, pp. 195–235.
   Google Scholar
• B.S. He, F. Ma, and X.M. Yuan, Convergence study on the symmetric version of ADMM with larger step sizes, SIAM J. Imaging Sci. 9 (2016), pp. 1467–1501. doi: 10.1137/15M1044448
   Web of Science ®Google Scholar
• L.S. Hou, H.J. He, and J.F. Yang, A partially parallel splitting method for multiple-block separable convex programming with applications to robust PCA, Comput. Optim. Appl. 63 (2016), pp. 273–303. doi: 10.1007/s10589-015-9770-4
   Web of Science ®Google Scholar
• M. Li and X.M. Yuan, A strictly contractive Peaceman-Rachford splitting method with logarithmic-quadratic proximal regularization for convex programming, Math. Oper. Res. 40 (2015), pp. 842–858. doi: 10.1287/moor.2014.0698
   Web of Science ®Google Scholar
• X.X. Li and X.M. Yuan, A proximal strictly contractive Peaceman–Rachford splitting method for convex programming with applications to imaging, SIAM J. Imaging Sci. 8 (2015), pp. 1332–1365. doi: 10.1137/14099509X
   Web of Science ®Google Scholar
• P.L. Lions and B. Mercier, Splitting algorithms for the sum of two nonlinear operator, SIAM J. Numer. Anal. 16 (1979), pp. 964–979. doi: 10.1137/0716071
   Web of Science ®Google Scholar
• D.W. Peaceman and H.H. Rachford, The numerical solution of parbolic and eliptic differential equations, SIAM J. Appl. Math. 3 (1955), pp. 28–41. doi: 10.1137/0103003
   Web of Science ®Google Scholar
• H. Schaeffer and S. Osher, A low patch-rank interpretation of texture, SIAM J. Imaging Sci. 6 (2013), pp. 226–262. doi: 10.1137/110854989
   Web of Science ®Google Scholar
• M. Tao and X.M. Yuan, Recovering low-rank and sparse components of matrices from incomplete and noisy observations, SIAM J. Optim. 21 (2011), pp. 57–81. doi: 10.1137/100781894
   Web of Science ®Google Scholar
• Y.L. Wang, J.F. Yang, W.T. Yin, and Y. Zhang, A new alternating minimization algorithm for total variation image reconstruction, SIAM J. Imaging Sci. 1 (2008), pp. 248–272. doi: 10.1137/080724265
   Web of Science ®Google Scholar
• K. Wang, J. Desai, and H.J. He, A proximal partially parallel splitting method for separable convex programs, Optim. Method Softw. 32 (2017), pp. 39–68. doi: 10.1080/10556788.2016.1200044
   Web of Science ®Google Scholar