On the linear convergence of the proximal gradient method for trace norm regularization

Advances in Neural Information Processing Systems

Volumn , Issue , 2013, Pages

  Hou, Ke ^a   Zhou, Zirui ^a   So, Anthony Man Cho ^a   Luo, Zhi Quan ^b  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b University of Minnesota   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRADIENT METHODS;

CLASS OF LOSS FUNCTIONS; CONVERGENCE RATES; LINEAR CONVERGENCE; LIPSCHITZIAN; LOSS FUNCTIONS; RATE OF CONVERGENCE; STRONG CONVEXITIES; TRACE-NORMS;

PROBLEM SOLVING;

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

References (25)

1. Y. Amit, M. Fink, N. Srebro, and S. Ullman. Uncovering Shared Structures in Multiclass Classification. In Proc. 24th ICML, pages 17-24, 2007.
2. A. Argyriou, T. Evgeniou, andM. Pontil. ConvexMulti-Task Feature Learning. Mach. Learn., 73(3):243-272, 2008.
3. A. Beck and M. Teboulle. A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems. SIAM J. Imaging Sci., 2(1):183-202, 2009.
4. A. Ben-Tal and A. Nemirovski. Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications. MPS-SIAMSeries on Optimization. Society for Industrial and Applied Mathematics, Philadelphia, Pennsylvania, 2001.
5. M. Fazel, H. Hindi, and S. P. Boyd. A Rank Minimization Heuristic with Application to Minimum Order System Approximation. In Proc. 2001 ACC, pages 4734-4739, 2001.
6. D. Gross. Recovering Low-Rank Matrices from Few Coefficients in Any Basis. IEEE Trans. Inf. Theory, 57(3):1548-1566, 2011.
7. S. Ji, K.-F. Sze, Z. Zhou, A. M.-C. So, and Y. Ye. Beyond Convex Relaxation: A Polynomial-Time Non-Convex Optimization Approach to Network Localization. In Proc. 32nd IEEE INFOCOM, pages 2499-2507, 2013.
8. S. Ji and J. Ye. An Accelerated Gradient Method for Trace Norm Minimization. In Proc. 26th ICML, pages 457-464, 2009.
9. V. Koltchinskii, K. Lounici, and A. B. Tsybakov. Nuclear-Norm Penalization and Optimal Rates for Noisy Low-Rank Matrix Completion. Ann. Stat., 39(5):2302-2329, 2011.
10. Z.-Q. Luo and P. Tseng. Error Bounds and Convergence Analysis of Feasible Descent Methods: A General Approach. Ann. Oper. Res., 46(1):157-178, 1993.
11. S. Ma, D. Goldfarb, and L. Chen. Fixed Point and Bregman Iterative Methods for Matrix Rank Minimization. Math. Program., 128(1-2):321-353, 2011.
12. Yu. Nesterov. Introductory Lectures on Convex Optimization: A Basic Course. Kluwer Academic Publishers, Boston, 2004.
13. B. Recht, M. Fazel, and P. A. Parrilo. Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization. SIAM Rev., 52(3):471-501, 2010.
14. R. T. Rockafellar. Convex Analysis. Princeton Landmarks in Mathematics and Physics. Princeton University Press, Princeton, New Jersey, 1997.
15. R. T. Rockafellar and R. J.-B. Wets. Variational Analysis, volume 317 of Grundlehren der mathematischen Wissenschaften. Springer-Verlag, Berlin Heidelberg, second edition, 2004.
16. M. Schmidt, N. Le Roux, and F. Bach. Convergence Rates of Inexact Proximal-Gradient Methods for Convex Optimization. In Proc. NIPS 2011, pages 1458-1466, 2011.
17. A. M.-C. So, Y. Ye, and J. Zhang. A Unified Theorem on SDP Rank Reduction. Math. Oper. Res., 33(4):910-920, 2008.
18. W. So. Facial Structures of Schatten p-Norms. Linear and Multilinear Algebra, 27(3):207-212, 1990.
19. K.-C. Toh and S. Yun. An Accelerated Proximal Gradient Algorithm for Nuclear Norm Regularized Linear Least Squares Problems. Pac. J. Optim., 6(3):615-640, 2010.
20. R. Tomioka and K. Aihara. Classifying Matrices with a Spectral Regularization. In Proc. of the 24th ICML, pages 895-902, 2007.
21. R. Tomioka, T. Suzuki, M. Sugiyama, and H. Kashima. A Fast Augmented Lagrangian Algorithm for Learning Low-Rank Matrices. In Proc. 27th ICML, pages 1087-1094, 2010.
22. P. Tseng. Approximation Accuracy, Gradient Methods, and Error Bound for Structured Convex Optimization. Math. Program., 125(2):263-295, 2010.
23. P. Tseng and S. Yun. A Coordinate Gradient Descent Method for Nonsmooth Separable Minimization. Math. Program., 117(1-2):387-423, 2009.
24. M. White, Y. Yu, X. Zhang, and D. Schuurmans. Convex Multi-View Subspace Learning. In Proc. NIPS 2012, pages 1682-1690, 2012.
25. H. Zhang, J. Jiang, and Z.-Q. Luo. On the Linear Convergence of a Proximal Gradient Method for a Class of Nonsmooth Convex Minimization Problems. J. Oper. Res. Soc. China, 1(2):163-186, 2013.