A Note on the Alternating Direction Method of Multipliers

Journal of Optimization Theory and Applications

Volumn 155, Issue 1, 2012, Pages 227-238

  Han, Deren ^a   Yuan, Xiaoming ^b  

^a NANJING NORMAL UNIVERSITY   (China)

^b HONG KONG BAPTIST UNIVERSITY   (Hong Kong)

Author keywords

Alternating direction method of multipliers; Global convergence; Strongly convex functions

Indexed keywords

FUNCTIONS;

ALTERNATING DIRECTIONS METHOD OF MULTIPLIERS; CONVEX FUNCTIONS; GLOBAL CONVER-GENCE; OBJECTIVE FUNCTIONS; STRONGLY CONVEX FUNCTION;

CONVEX OPTIMIZATION;

EID: 84867535196     PISSN: 00223239     EISSN: 15732878     Source Type: Journal    
DOI: 10.1007/s10957-012-0003-z     Document Type: Article

References (26)

1. Gabay, D., Mercier, B.: A dual algorithm for the solution of nonlinear variational problems via finite element approximations. Comput. Math. Appl. 2, 17-40 (1976).
2. Gabay, D.: Applications of the method of multipliers to variational inequalities. In: Fortin, M., Glowinski, R. (eds.) Augmented Lagrangian Methods: Applications to the Numerical Solution of Boundary-Value Problems, pp. 299-331. North-Holland, Amsterdam (1983).
3. Chen, G., Teboulle, M.: A proximal-based decomposition method for convex minimization problems. Math. Program. 64, 81-101 (1994).
4. Eckstein, J., Bertsekas, D. P.: On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators. Math. Program. 55, 293-318 (1992).
5. Fukushima, M.: Application of the alternating directions method of multipliers to separable convex programming problems. Comput. Optim. Appl. 2, 93-111 (1992).
6. He, B. S., Liao, L. Z., Han, D. R., Yang, H.: A new inexact alternating direction method for monotone variational inequalities. Math. Program. 92, 103-118 (2002).
7. Kontogiorgis, S., Meyer, R. R.: A variable-penalty alternating directions method for convex optimization. Math. Program. 83, 29-53 (1998).
8. Tseng, P.: Applications of a splitting algorithm to decomposition in convex programming and variational inequalities. SIAM J. Control Optim. 29, 119-138 (1991).
9. Chan, R. H., Yang, J. F., Yuan, X. M.: Alternating direction method for image inpainting in wavelet domain. SIAM J. Imaging Sci. 4, 807-826 (2011).
10. Chen, C. H., He, B. S., Yuan, X. M.: Matrix completion via alternating direction method. IMA J. Numer. Anal. 32, 227-245 (2012).
11. Esser, E.: Applications of Lagrangian-based alternating direction methods and connections to split Bregman. UCLA CAM Report 09-31 (2009).
12. He, B. S., Xu, M. H., Yuan, X. M.: Solving large-scale least squares covariance matrix problems by alternating direction methods. SIAM J. Matrix Anal. Appl. 32, 136-152 (2011).
13. Ng, M. K., Weiss, P. A., Yuan, X. M.: Solving constrained total-variation problems via alternating direction methods. SIAM J. Sci. Comput. 32, 2710-2736 (2010).
14. Sun, J., Zhang, S.: A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs. Eur. J. Oper. Res. 207, 1210-1220 (2010).
15. Tao, M., Yuan, X. M.: Recovering low-rank and sparse components of matrices from incomplete and noisy observations. SIAM J. Optim. 21, 57-81 (2011).
16. 1 problems in compressive sensing. SIAM J. Sci. Comput. 33, 250-278 (2011).
17. Yuan, X. M., Yang, J. F.: Sparse and low-rank matrix decomposition via alternating direction method. Pac. J. Optim. (to appear).
18. Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Faund. Trends Mach. Learn. 3, 1-122 (2010).
19. Bardsley, J. M., Knepper, S., Nagy, J.: Structured linear algebra problems in adaptive optics imaging. Adv. Comput. Math. 5(2-4), 103-117 (2011).
20. Kiwiel, K. C., Rosa, C. H., Ruszczyński, A.: Proximal decomposition via alternating linearization. SIAM J. Optim. 9, 668-689 (1999).
21. Setzer, S., Steidl, G., Tebuber, T.: Deblurring Poissonian images by split Bregman techniques. J. Vis. Commun. Image Represent. 21, 193-199 (2010).
22. Peng, Y. G., Ganesh, A., Wright, J., Xu, W. L., Ma, Y.: Robust alignment by sparse and low-rank decomposition for linearly correlated images. IEEE Trans. Pattern Anal. Mach. Intell. (to appear).
23. He, B. S., Tao, M., Yuan, X. M.: Alternating direction method with Gaussian back substitution for separable convex programming. SIAM J. Optim. (to appear).
24. He, B. S., Tao, M., Xu, M. H., Yuan, X. M.: Alternating directions based contraction method for generally separable linearly constrained convex programming problems. Optimization (to appear).
25. Rockafellar, R. T.: Convex Analysis. Princeton University Press, Princeton (1970).
26. Facchinei, F., Pang, J. S.: Finite-Dimensional Variational Inequalities and Complementarity Problems, vol. I. Springer, New York (2003).