Gradient methods for minimizing composite functions

Mathematical Programming

Volumn 140, Issue 1, 2013, Pages 125-161

  Nesterov, Yu ^a  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

1 Regularization; Black box model; Complexity theory; Convex Optimization; Local optimization; Nonsmooth optimization; Optimal methods; Structural optimization

Indexed keywords

1-REGULARIZATION; BLACK-BOX MODEL; COMPLEXITY THEORY; LOCAL OPTIMIZATIONS; NONSMOOTH OPTIMIZATION; OPTIMAL METHODS;

COMPUTATIONAL COMPLEXITY; CONVEX OPTIMIZATION; FUNCTIONS; GRADIENT METHODS; OPTIMIZATION; STRUCTURAL OPTIMIZATION;

PROBLEM SOLVING;

EID: 84879800501     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-012-0629-5     Document Type: Article

References (20)

1. Chen, S.; Donoho, D.; Saunders, M.: Atomic decomposition by basis pursuit. SIAM J. Sci. Comput. 20, 33-61 (1998)
2. Claerbout, J.; Muir, F.: Robust modelling of eratic data. Geophysics 38, 826-844 (1973)
3. Figueiredo, M.; Novak, R.; Wright, S.J.: Gradient projection for sparse reconstruction: application to compressed sensing and other inverse problems. Submitted for publication
4. Fukushima, M.; Mine, H.: A generalized proximal point algorithm for certain nonconvex problems. Int. J. Sys. Sci. 12(8), 989-1000 (1981)
5. Kim, S.-J.; Koh, K.; Lustig, M.; Boyd, S.; Gorinevsky, D.: A method for large-scale 1-regularized least-squares problems with applications in signal processing and statistics. Stanford University, March 20, Research report (2007)
6. Levy, S.; Fullagar, P.: Reconstruction of a sparse spike train from a portion of its spectrum and application to high-resolution deconvolution. Geophysics 46, 1235-1243 (1981)
7. Miller, A.: Subset Selection in Regression. Chapman and Hall, London (2002)
8. Nemirovsky, A.; Yudin, D.: Informational Complexity and Efficient Methods for Solution of Convex Extremal Problems. Wiley, New-York (1983)
9. Nesterov, Y.: Introductory Lectures on Convex Optimization. Kluwer, Boston (2004)
10. Nesterov, Y.: Smooth minimization of non-smooth functions. Math. Program. (A) 103(1), 127-152 (2005)
11. Nesterov, Y.: Gradient methods for minimizing composite objective function. CORE Discussion Paper \#2007/76, CORE (2007)
12. Nesterov, Y.: Rounding of convex sets and efficient gradient methods for linear programming problems. Optim. Methods Softw. 23(1), 109-135 (2008)
13. Nesterov, Y.: Accelerating the cubic regularization of Newton's method on convex problems. Math. Program. 112(1), 159-181 (2008)
14. Nesterov, Y.; Nemirovskii, A.: Interior Point Polynomial Methods in Convex Programming: Theory and Applications. SIAM, Philadelphia (1994)
15. Ortega, J.; Rheinboldt, W.: Iterative Solution of Nonlinear Equations in Several Variables. Academic Press, New York (1970)
16. Santosa, F.; Symes, W.: Linear inversion of band-limited reflection histograms. SIAM J. Sci. Stat. Comput. 7, 1307-1330 (1986)
17. Taylor, H.; Bank, S.; McCoy, J.: Deconvolution with the 1norm. Geophysics 44, 39-52 (1979)
18. Tibshirani, R.: Regression shrinkage and selection via the lasso. J. R. Stat. Soc. B 58, 267-288 (1996)
19. Tropp, J.: Just relax: convex programming methods for identifying sparse signals. IEEE Trans. Inf. Theory 51, 1030-1051 (2006)
20. Wright, S.J.: Solving 1-Regularized Regression Problems. Talk at International Conference "Combinatorics and Optimization", Waterloo (June 2007)