Accelerated proximal gradient methods for nonconvex programming

Advances in Neural Information Processing Systems

Volumn 2015-January, Issue , 2015, Pages 379-387

  Li, Huan ^a,b   Lin, Zhouchen ^a,b  

^a Peking University   (China)

^b SHANGHAI JIAO TONG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CONVEX OPTIMIZATION; GRADIENT METHODS; INFORMATION SCIENCE; LEARNING SYSTEMS; OPTIMIZATION;

ACCELERATED PROXIMAL GRADIENT METHODS; ACCUMULATION POINTS; DESCENT PROPERTIES; NON-CONVEX PROGRAMMING; NONSMOOTH OPTIMIZATION PROBLEMS; NUMBER OF ITERATIONS; NUMERICAL RESULTS; OBJECTIVE FUNCTIONS;

ITERATIVE METHODS;

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

References (26)

1. F. Yun, editor. Low-rank and sparse modeling for visual analysis. Springer, 2014. 1
2. E. J. Candes, M. B. Wakin, and S. P. Boyd. Enhancing sparsity by reweighted l1 minimization. Journal of Fourier Analysis and Applications, 14(5):877-905, 2008. 1
3. T. Zhang. Analysis of multi-stage convex relaxation for sparse regularization. The Journal of Machine Learning Rearch, 11:1081-1107, 2010. 1, 7
4. S. Foucart and M. J. Lai. Sparsest solutions of underdeterminied linear systems via lq minimization for 0 < q κ 1. Applied and Computational Harmonic Analysis, 26(3):395-407, 2009. 1
5. C. H. Zhang. Nearly unbiased variable selection under minimax concave penalty. The Annals of Statistics, 38(2):894-942, 2010. 1
6. D. Geman and C. Yang. Nonlinear image recovery with half-quadratic regularization. IEEE Transactions on Image Processing, 4(7):932-946, 1995. 1
7. J. Fan and R. Li. Variable selection via nonconcave penalized likelihood and its oracle properties. Journal of the American Statistical Association, 96(456):1348-1360, 2001. 1
8. K. Mohan and M. Fazel. Iterative reweighted algorithms for matrix rank minimization. The Journal of Machine Learning Research, 13(1):3441-3473, 2012. 1, 2
9. Y. E. Nesterov. A method for unconstrained convex minimization problem with the rate of convergence O (1/k2). Soviet Mathematics Doklady, 27(2):372-376, 1983. 1
10. Y. E. Nesterov. Smooth minimization of nonsmooth functions. Mathematical programming, 103(1):127-152, 2005. 1
11. Y. E. Nesterov. Gradient methods for minimizing composite objective functions. Technical report, Center for Operations Research and Econometrics (CORE), Catholie University of Louvain, 2007. 1
12. A. Beck and M. Teboulle. Fast gradient-based algorithms for constrained total variation image denoising and deblurring problems. IEEE Transactions on Image Processing, 18(11):2419-2434, 2009. 1, 2, 3, 4, 5
13. A. Beck and M. Teboulle. A fast iterative shrinkage thresholding algorithm for linear inverse problems. SIAM J. Imaging Sciences, 2(1):183-202, 2009. 1, 2, 3, 4, 5
14. P. Tseng. On accelerated proximal gradient methods for convex-concave optimization. Technical report, University of Washington, Seattle, 2008. 1
15. S. Ghadimi and G. Lan. Accelerated gradient methods for nonconvex nonlinear and stochastic programming. arXiv preprint arXiv:1310.3787, 2013. 1, 2
16. H. Attouch, J. Bolte, and B. F. Svaier. Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods. Mathematical Programming, 137:91-129, 2013. 2, 4, 5
17. P. Frankel, G. Garrigos, and J. Peypouquet. Splitting methods with variable metric for Kurdykałojasiewicz functions and general convergence rates. Journal of Optimization Theory and Applications, 165:874-900, 2014. 2, 5
18. P. Ochs, Y. Chen, T. Brox, and T. Pock. IPiano: Inertial proximal algorithms for nonconvex optimization. SIAM J. Image Sciences, 7(2):1388-1419, 2014. 2
19. P. Gong, C. Zhang, Z. Lu, J. Huang, and J. Ye. A general iterative shrinkage and thresholding algorithm for nonconvex regularized optimization problems. In ICML, pages 37-45, 2013. 2, 7
20. W. Zhong and J. Kwok. Gradient descent with proximal average for nonconvex and composite regularization. In AAAI, 2014. 2
21. P. Ochs, A. Dosovitskiy, T. Brox, and T. Pock. On iteratively reweighted algorithms for non-smooth non-convex optimization in computer vision. SIAM J. Imaging Sciences, 2014. 2
22. R. L. Bot, E. R. Csetnek, and S. László. An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions. Preprint, 2014. 2, 7
23. J. Bolte, S. Sabach, and M. Teboulle. Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Mathematical Programming, 146(1-2):459-494, 2014. 3, 5
24. H. Zhang and W. W. Hager. A nonmonotone line search technique and its application to unconstrained optimization. SIAM J. Optimization, 14:1043-1056, 2004. 5, 6
25. S. K. Shevade and S. S. Keerthi. A simple and efficient algorithm for gene selection using sparse logistic regression. Bioinformatics, 19(17):2246-2253, 2003. 7
26. A. Genkin, D. D. Lewis, and D. Madigan. Large-scale bayesian logistic regression for text categorization. Technometrics, 49(14):291-304, 2007. 7