Linearized alternating direction method with adaptive penalty for low-rank representation

Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011, NIPS 2011

Volumn , Issue , 2011, Pages

  Lin, Zhouchen ^a   Liu, Risheng ^b   Su, Zhixun ^b  

^a MICROSOFT RESEARCH ASIA   (China)

^b DALIAN UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; CONVEX OPTIMIZATION; LEARNING SYSTEMS; LINEARIZATION; SIGNAL PROCESSING;

ADAPTIVE PENALTY; ALTERNATING DIRECTION METHODS; CONVEX PROGRAMS; FAST CONVERGENCE; LINEAR MAPPING; LOW-RANK REPRESENTATIONS; MACHINE-LEARNING; PENALTY TERM; SIGNAL PROCESSING PROBLEMS; SUB-PROBLEMS;

NUMERICAL METHODS;

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

References (22)

1. S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein. Distributed optimization and statistical learning via the alternating direction method of multipliers. In Michael Jordan, editor, Foundations and Trends in Machine Learning, 2010.
2. J. Cai, E. Candès, and Z. Shen. A singular value thresholding algorithm for matrix completion. preprint, 2008.
3. E. Candès, X. Li, Y. Ma, and J. Wright. Robust principal component analysis? J. ACM, 2011.
4. E. Candès and B. Recht. Exact matrix completion via convex optimization. Foundations of Computational Mathematics, 2009.
5. E. J. Candès and M.Wakin. An introduction to compressive sampling. IEEE Signal Processing Magazine, 2008.
6. P. Favaro, R. Vidal, and A. Ravichandran. A closed form solution to robust subspace estimation and clustering. In CVPR, 2011.
7. B. He, M. Tao, and X. Yuan. Alternating direction method with Gaussian back substitution for separable convex programming. SIAM Journal on Optimization, accepted.
8. B. He, H. Yang, and S. Wang. Alternating direction method with self-adaptive penalty parameters for monotone variational inequality. J. Optimization Theory and Applications, 106:337-356, 2000.
9. R. Larsen. Lanczos bidiagonalization with partial reorthogonalization. Department of Computer Science, Aarhus University, Technical report, DAIMI PB-357, 1998.
10. Z. Lin. Some software packages for partial SVD computation. arXiv:1108.1548.
11. Z. Lin, M. Chen, and Y. Ma. The augmented Lagrange multiplier method for exact recovery of corrupted low-rank matrices. UIUC Technical Report UILU-ENG-09-2215, 2009, arXiv:1009.5055.
12. G. Liu, Z. Lin, and Y. Yu. Robust subspace segmentation by low-rank representation. In ICML, 2010.
13. 2,1 norm minimization. In UAI, 2009.
14. Y. Ni, J. Sun, X. Yuan, S. Yan, and L. Cheong. Robust low-rank subspace segmentation with semidefinite guarantees. In ICDM Workshop, 2010.
15. M. Tao and X.M. Yuan. Recovering low-rank and sparse components of matrices from incomplete and noisy observations. SIAM Journal on Optimization, 21(1):57-81, 2011.
16. K. Toh and S. Yun. An accelerated proximal gradient algorithm for nuclear norm regularized least sequares problems. Pacific J. Optimization, 6:615-640, 2010.
17. R. Tron and R. Vidal. A benchmark for the comparison of 3D montion segmentation algorithms. In CVPR, 2007.
18. J. Wright, A. Ganesh, S. Rao, and Y. Ma. Robust principal component analysis: Exact recovery of corrupted low-rank matrices via convex optimization. In NIPS, 2009.
19. J. Wright, Y. Ma, J. Mairal, G. Sapirao, T. Huang, and S. Yan. Sparse representation for computer vision and pattern recognition. Proceedings of the IEEE, 2010.
20. J. Yang and X. Yuan. Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization. submitted, 2011.
21. 1 problems in compressive sensing. SIAM J. Scientific Computing, 2010.
22. W. Yin. Analysis and generalizations of the linearized Bregman method. SIAM Journal on Imaging Sciences, 2010.