On the convergence rate of the augmented Lagrangian-based parallel splitting method

References

• J.M. Bardsley, S. Knepper, and J. Nagy, Structured linear algebra problems in adaptive optics imaging, Adv. Comput. Math. 35 (2011), pp. 103–117.
   Web of Science ®Google Scholar
• N. Bose and K. Boo, High-resolution image reconstruction with multisensors, Int. J. Imag. Syst. Tech. 9 (1998), pp. 294–304.
   Web of Science ®Google Scholar
• 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.
   Google Scholar
• X. Cai, D. Han, and X. Yuan, On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function, Comput. Optim. Appl. 66 (2017), pp. 39–73.
   Web of Science ®Google Scholar
• W. Deng, M. Lai, Z. Peng, and W. Yin, Parallel multi-block ADMM with o(1/k) convergence, Tech. Rep., UCLA CAM 13-64, 2013.
   Google Scholar
• Q.T. Dinh, I. Necoara, C. Savorgnan, and M. Diehl, An inexact perturbed path-following method for Lagrangian decomposition in large-scale separable convex optimization, SIAM J. Optim. 23 (2013), pp. 95–125.
   Web of Science ®Google Scholar
• J. Eckstein and W. Yao, Understanding the convergence of the alternating direction method of multipliers: Theoretical and computational perspectives, Pac. J. Optim. 11 (2015), pp. 619–644.
   Web of Science ®Google Scholar
• F. Facchinei and J. Pang, Finite-Dimensional Variational Inequalities and Complementarity Problems, Vol. I and II, Springer, New York, 2003.
   Google Scholar
• D. Han, H. He, and L. Xu, A proximal parallel splitting method for minimizing sum of convex functions with linear constraints, J. Comput. Appl. Math. 256 (2014), pp. 36–51.
   Web of Science ®Google Scholar
• D. Han, X. Yuan, and W. Zhang, An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing, Math. Comput. 83 (2014), pp. 2263–2291.
   Web of Science ®Google Scholar
• H. He and D. Han, A distributed Douglas–Rachford splitting method for multi-block convex minimization problems, Adv. Comput. Math. 42 (2016), pp. 27–53.
   Web of Science ®Google Scholar
• B. He, M. Tao, and X. Yuan, Alternating direction method with Gaussian-back substitution for separable convex programming, SIAM J. Optim. 22 (2012), pp. 313–340.
   Web of Science ®Google Scholar
• B. He, L. Hou, and X. Yuan, On full Jacobian decomposition of the augmented Lagrangian method for separable convex programming, SIAM J. Optim. 25(4) (2015), pp. 2274–2312.
   Web of Science ®Google Scholar
• H. He, X. Cai, and D. Han, A fast splitting method tailored for dantzig selector, Comput. Optim. Appl. 62(2) (2015), pp. 347–372.
   Web of Science ®Google Scholar
• B. He, H.-K. Xu, and X. Yuan, On the proximal Jacobian decomposition of ALM for multiple-block separable convex minimization problems and its relationship to ADMM, J. Sci. Comput. 66(3) (2016), pp. 1204–1217.
   Web of Science ®Google Scholar
• M.R. Hestenes, Multiplier and gradient methods, J. Optim. Theory Appl. 4 (1969), pp. 303–320.
   Google Scholar
• L. Hou, H. He, and J. Yang, A partially parallel splitting method for multiple-block separable convex programming with applications to robust PCA, Comput. Optim. Appl. 63(1) (2016), pp. 273–303.
   Web of Science ®Google Scholar
• T. Lin, S. Ma, and S. Zhang, On the global linear convergence of the ADMM with multiblock variables, SIAM J. Optim. 25(3) (2015), pp. 1478–1497.
   Web of Science ®Google Scholar
• T.-Y. Lin, S.-Q. Ma, and S.-Z. Zhang, On the sublinear convergence rate of multi-block ADMM, J. Oper. Res. Soc. China 3(3) (2015), pp. 251–274.
   Web of Science ®Google Scholar
• A. Nedic and A. Ozdaglar, Distributed subgradient methods for multi-agent optimization, IEEE Trans. Automat. Control. 54 (2009), pp. 48–61.
   Web of Science ®Google Scholar
• Y. Nesterov, Introductory Lectures on Convex Optimization: Basic Course, Kluwer, Boston, 2003.
   Google Scholar
• Y. Nesterov, Gradient methods for minimizing composite functions, Math. Program. Ser. B. 140(1) (2013), pp. 125–161.
   Web of Science ®Google Scholar
• O. Oreifej, X. Li, and M. Shah, Simultaneous video stabilization and moving object detection in turbulence, IEEE Trans. Pattern Anal. Mach Intell. 35 (2013), pp. 450–462.
   PubMed Web of Science ®Google Scholar
• M. Powell, A method for nonlinear constraints in minimization problems, in Optimization, R. Fletcher, ed., Academic Press, New York, 1969, pp. 283–298.
   Google Scholar
• S. Setzer, G. Steidl, and T. Tebuber, Deblurring Poissonian images by split Bregman techniques, J. Vis. Commun. Image R. 21 (2010), pp. 193–199.
   Web of Science ®Google Scholar
• Y. Shen, Z. Wen, and Y. Zhang, Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization, Optim. Method Softw. 29(2) (2014), pp. 239–263.
   Web of Science ®Google Scholar
• M. Tao, Some parallel splitting methods for separable convex programming with the O(1/t) convergence rate, Pac. J. Optim. 10(2) (2014), pp. 359–384.
   Web of Science ®Google Scholar
• M. Tao and X. Yuan, Recovering low-rank and sparse components of matrices from incomplete and noisy observations, SIAM J. Optim. 21 (2011), pp. 57–81.
   Web of Science ®Google Scholar
• R. Tibshirani, M. Saunders, S. Rosset, J. Zhu, and K. Knight, Sparsity and smoothness via the fused LASSO, J. R. Stat. Soc. Ser. B. 67 (2005), pp. 91–108.
   Google Scholar
• K. Wang, J. Desai, and H. He, A note on augmented Lagrangian-based parallel splitting method, Optim. Lett. 9 (2015), pp. 1199–1212.
   Web of Science ®Google Scholar
• X. Wang, M. Hong, S. Ma, and Z. Luo, Solving multiple-block separable convex minimization problems using two-block alternating direction method of multipliers, Pac. J. Optim. 11(4) (2015), pp. 645–667.
   Web of Science ®Google Scholar
• K. Wang, J. Desai, and H. He, A proximal partially parallel splitting method for separable convex programs, Optim. Method Softw. 32(1) (2017), pp. 39–68.
   Web of Science ®Google Scholar
• J. Yang and Y. Zhang, Alternating direction algorithms for ℓ1-problems in compressive sensing, SIAM J. Sci. Comput. 33 (2011), pp. 250–278.
   Web of Science ®Google Scholar