Parallel direction method of multipliers

Advances in Neural Information Processing Systems

Volumn 1, Issue January, 2014, Pages 181-189

  Wang, Huahua ^a   Banerjee, Arindam ^a   Luo, Zhi Quan ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; INFORMATION SCIENCE; OPTIMIZATION; PRINCIPAL COMPONENT ANALYSIS;

ALTERNATING DIRECTION METHOD OF MULTIPLIERS; BLOCK COORDINATE DESCENTS; CONSTANT STEP SIZES; GLOBAL CONVER-GENCE; METHOD OF MULTIPLIERS; OPTIMIZATION PROBLEMS; OVERLAPPING GROUPS; ROBUST PRINCIPAL COMPONENT ANALYSIS;

ITERATIVE METHODS;

EID: 84937886140     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. F. Bach, R. Jenatton, J. Mairal, and G. Obozinski. Convex Optimization with Sparsity-Inducing Norms. S. Sra, S. Nowozin, S. J. Wright., editors, Optimization for Machine Learning, MIT Press, 2011.
2. S. Boyd, E. Chu N. Parikh, B. Peleato, and J. Eckstein. Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundation and Trends Machine Learning, 3(1):1-122, 2011.
3. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2004.
4. T. Cai, W. Liu, and X. Luo. A constrained ℓ1 minimization approach to sparse precision matrix estimation. Journal of American Statistical Association, 106:594-607, 2011.
5. E. J. Candes, X. Li, Y. Ma, and J. Wright. Robust principal component analysis ?. Journal of the ACM, 58:1-37, 2011.
6. V. Chandrasekaran, P. A. Parrilo, and A. S. Willsky. Latent variable graphical model selection via convex optimization. Annals of Statistics, 40:1935-1967, 2012.
7. C. Chen, B. He, Y. Ye, and X. Yuan. The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent. Preprint, 2013.
8. S. Chen, D.L. Donoho, and M.A. Saunders. Atomic decomposition by basis pursuit. SIAM review, 43:129-159, 2001.
9. X. Chen, Q. Lin, S. Kim, J. G. Carbonell, and E. P. Xing. Smoothing proximal gradient method for general structured sparse regression. The Annals of Applied Statistics, 6:719-752 2012.
10. W. Deng, M. Lai, Z. Peng, and W. Yin. Parallel multi-block admm with o(1/k) convergence. ArXiv, 2014.
11. Q. Fu, H. Wang, and A. Banerjee. Bethe-ADMM for tree decomposition based parallel MAP inference. In UAI, 2013.
12. D. Gabay and B. Mercier. A dual algorithm for the solution of nonlinear variational problems via finite-element approximations. Computers and Mathematics with Applications, 2:17-40, 1976.
13. B. He, M. Tao, and X. Yuan. Alternating direction method with Gaussian back substitution for separable convex programming. SIAM Journal of Optimization, pages 313-340, 2012.
14. M. Hong, T. Chang, X. Wang, M. Razaviyayn, S. Ma, and Z. Luo. A block successive upper bound minimization method of multipliers for linearly constrained convex optimization. Preprint, 2013.
15. M. Hong and Z. Luo. On the linear convergence of the alternating direction method of multipliers. ArXiv, 2012.
16. Y Nesterov. Efficiency of coordinate descent methods on huge-scale optimization methods. SIAM Journal on Optimization, 22(2):341-362, 2012.
17. N. Parikh and S. Boyd. Proximal algorithms. Foundations and Trends in Optimization, 1:123-231, 2014.
18. P. Richtarik and M. Takac. Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function. Mathematical Programming, 2012.
19. N. Z. Shor. Minimization Methods for Non-Differentiable Functions. Springer-Verlag, 1985.
20. R. Tappenden, P. Richtarik, and B. Buke. Separable approximations and decomposition methods for the augmented lagrangian. Preprint, 2013.
21. M. J. Wainwright and M. I. Jordan. Graphical models, exponential families, and variational inference. Foundations and Trends in Machine Learning, 1:1-305, 2008.
22. H. Wang and A. Banerjee. Online alternating direction method. In ICML, 2012.
23. H. Wang and A. Banerjee. Bregman alternating direction method of multipliers. In NIPS, 2014.
24. H. Wang, A. Banerjee, C. Hsieh, P. Ravikumar, and I. Dhillon. Large scale distributed sparse precesion estimation. In NIPS, 2013.
25. H. Wang, A. Banerjee, and Z. Luo. Parallel direction method of multipliers. ArXiv, 2014.
26. X. Wang, M. Hong, S. Ma, and Z. Luo. Solving multiple-block separable convex minimization problems using two-block alternating direction method of multipliers. Preprint, 2013.
27. Y Yu. Better approximation and faster algorithm using the proximal average. In NIPS, 2012.
28. P. Zhao, G. Rocha, and B. Yu. The composite absolute penalties family for grouped and hierarchical variable selection. Annals of Statistics, 37:3468-3497 2009.
29. Z. Zhou, X. Li, J. Wright, E. Candes, and Y Ma. Stable principal component pursuit. In IEEE International Symposium on Information Theory, 2010.