{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T17:50:16Z","timestamp":1778781016144,"version":"3.51.4"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2012,12,4]],"date-time":"2012-12-04T00:00:00Z","timestamp":1354579200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1007\/s10107-012-0614-z","type":"journal-article","created":{"date-parts":[[2012,12,3]],"date-time":"2012-12-03T04:33:25Z","timestamp":1354509205000},"page":"1-38","source":"Crossref","is-referenced-by-count":360,"title":["Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function"],"prefix":"10.1007","volume":"144","author":[{"given":"Peter","family":"Richt\u00e1rik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Tak\u00e1\u010d","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,12,4]]},"reference":[{"key":"614_CR1","unstructured":"Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Athena Scientific (1999)"},{"key":"614_CR2","doi-asserted-by":"crossref","first-page":"963","DOI":"10.1110\/ps.0242703","volume":"12","author":"AA Canutescu","year":"2003","unstructured":"Canutescu, A.A., Dunbrack, R.L.: Cyclic coordinate descent: a robotics algorithm for protein loop closure. Protein Sci. 12, 963\u2013972 (2003)","journal-title":"Protein Sci."},{"key":"614_CR3","first-page":"1369","volume":"9","author":"K-W Chang","year":"2008","unstructured":"Chang, K.-W., Hsieh, C.-J., Lin, C.-J.: Coordinate descent method for large-scale $$l_2$$ -loss linear support vector machines. J. Mach. Learn. Res. 9, 1369\u20131398 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"614_CR4","unstructured":"Friedman, J., Hastie, T., Robert, T.: A Note on the Group Lasso and a Sparse Group Lasso. Technical report (2010)"},{"key":"614_CR5","doi-asserted-by":"crossref","unstructured":"Hsieh, C.-J., Chang, K.-W., Lin, C.-J., Sathiya Keerthi, S., Sundararajan, S.: A dual coordinate descent method for large-scale linear svm. In ICML 2008, pp. 408\u2013415 (2008)","DOI":"10.1145\/1390156.1390208"},{"issue":"3","key":"614_CR6","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1287\/moor.1100.0456","volume":"35","author":"D Leventhal","year":"2010","unstructured":"Leventhal, D., Lewis, A.S.: Randomized methods for linear constraints: convergence rates and conditioning. Math. Oper. Res 35(3), 641\u2013654 (2010)","journal-title":"Math. Oper. Res"},{"key":"614_CR7","unstructured":"Lewis, A.S., Wright, S.J.: A Proximal Method for Composite Minimization. Technical report (2008)"},{"key":"614_CR8","doi-asserted-by":"crossref","first-page":"487","DOI":"10.3934\/ipi.2009.3.487","volume":"3","author":"Y Li","year":"2009","unstructured":"Li, Y., Osher, S.: Coordinate descent optimization for $$l_1$$ minimization with application to compressed sensing: a greedy algorithm. Inverse Probl. Imaging 3, 487\u2013503 (2009)","journal-title":"Inverse Probl. Imaging"},{"key":"614_CR9","unstructured":"Luo, Z.Q., Tseng, P.: A coordinate gradient descent method for nonsmooth separable minimization. J. Optim. Theory Appl. 72 (1) (2002)"},{"key":"614_CR10","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1111\/j.1467-9868.2007.00627.x","volume":"70","author":"L Meier","year":"2008","unstructured":"Meier, L., Van De Geer, S., Buhlmann, P.: The group lasso for logistic regression. J. R. Stat. Soc. B 70, 53\u201371 (2008)","journal-title":"J. R. Stat. Soc. B"},{"key":"614_CR11","doi-asserted-by":"crossref","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course, 1st edn. Springer, Netherlands (2004)","DOI":"10.1007\/978-1-4419-8853-9"},{"key":"614_CR12","unstructured":"Nesterov, Y.: Gradient Methods for Minimizing Composite Objective Function. Core discussion paper $$\\#$$ 2007\/76, Universit\u00e9 catholique de Louvain, Center for Operations Research and Econometrics (CORE) (2007)"},{"key":"614_CR13","unstructured":"Nesterov, Y.: Efficiency of coordinate descent methods on huge-scale optimization problems. SIAM J. Optim. 22, 341\u2013362 (2012)"},{"key":"614_CR14","unstructured":"Qin, Z., Scheinberg, K., Goldfarb, D.: Efficient Block-Coordinate Descent Algorithms for the Group Lasso. Technical report (2010)"},{"key":"614_CR15","unstructured":"Richt\u00e1rik, P., Tak\u00e1\u010d, M.: Efficiency of randomized coordinate descent methods on minimization problems with a composite objective function. In: 4th Workshop on Signal Processing with Adaptive Sparse Structured, Representations (2011)"},{"key":"614_CR16","doi-asserted-by":"crossref","unstructured":"Richt\u00e1rik, P., Tak\u00e1\u010d, M.: Efficient serial and parallel coordinate descent method for huge-scale truss topology design. In: Operations Research Proceedings 2011, pp. 27\u201332. Springer (2012)","DOI":"10.1007\/978-3-642-29210-1_5"},{"key":"614_CR17","unstructured":"Saha, A., Tewari, A.: On the Finite Time Convergence of Cyclic Coordinate Descent Methods. CoRR, abs\/1005.2146 (2010)"},{"key":"614_CR18","doi-asserted-by":"crossref","unstructured":"Shalev-Shwartz, S., Tewari, A.: Stochastic methods for $$l_1$$ regularized loss minimization. In: Proceedings of the 26th International Conference on, Machine Learning (2009)","DOI":"10.1145\/1553374.1553493"},{"key":"614_CR19","unstructured":"Strohmer, T., Vershynin, R.: A randomized kaczmarz algorithm with exponential convergence. J. Fourier Anal. Appl. 15, 262\u2013278 (2009)"},{"key":"614_CR20","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the lasso. J. R. Stat. Soc. B 58, 268\u2013288 (1996)","journal-title":"J. R. Stat. Soc. B"},{"key":"614_CR21","unstructured":"Tseng, P.: Convergence of a block coordinate descent method for nondifferentiable minimization. J. Optim. Theory Appl. 109, 475\u2013494 (2001)"},{"key":"614_CR22","doi-asserted-by":"crossref","unstructured":"Tseng, P., Yun, S., Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization. J. Optim. Theory Appl. 140, 513\u2013535 (2009). doi: 10.1007\/s10957-008-9458-3","DOI":"10.1007\/s10957-008-9458-3"},{"key":"614_CR23","unstructured":"Tseng, P., Yun, S.: A coordinate gradient descent method for nonsmooth separable minimization. Math. Program. Ser. B, 117, 387\u2013423 (2009)"},{"key":"614_CR24","doi-asserted-by":"crossref","unstructured":"Wen, Z., Goldfarb, D., Scheinberg, K.: Block coordinate descent methods for semidefinite programming. In: Anjos, M.F., Lasserre, J.B. (eds.) Handbook on Semidefinite, Cone and Polynomial Optimization: Theory, Algorithms, Software and Applications. Springer (forthcoming)","DOI":"10.1007\/978-1-4614-0769-0_19"},{"key":"614_CR25","unstructured":"Wright, S.J.: University of Wisconsin, Accelerated Block-Coordinate Relaxation for Regularized Optimization. Technical report (2010)"},{"key":"614_CR26","doi-asserted-by":"crossref","first-page":"2479","DOI":"10.1109\/TSP.2009.2016892","volume":"57","author":"SJ Wright","year":"2009","unstructured":"Wright, S.J., Nowak, R.D., Figueiredo, M.A.T.: Sparse reconstruction by separable approximation. Trans. Sig. Proc 57, 2479\u20132493 (2009)","journal-title":"Trans. Sig. Proc"},{"issue":"1","key":"614_CR27","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1214\/07-AOAS147","volume":"2","author":"TT Wu","year":"2008","unstructured":"Wu, T.T., Lange, K.: Coordinate descent algorithms for lasso penalized regression. Ann. Appl. Stat. 2(1), 224\u2013244 (2008)","journal-title":"Ann. Appl. Stat."},{"issue":"1","key":"614_CR28","first-page":"3183","volume":"11","author":"G-X Yuan","year":"2010","unstructured":"Yuan, G.-X., Chang, K.-W., Hsieh, C.-J., Lin, C.-J.: A comparison of optimization methods and software for large-scale $$l_1$$ -regularized linear classification. J. Mach. Learn. Res. 11(1), 3183\u20133234 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"614_CR29","doi-asserted-by":"crossref","unstructured":"Yuan, G.-X., Ho, C.-H., Lin, C.-J.: Recent Advances of Large-Scale Linear Classification. Technical report (2012)","DOI":"10.1109\/JPROC.2012.2188013"},{"key":"614_CR30","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1111\/j.1467-9868.2005.00532.x","volume":"68","author":"M Yuan","year":"2006","unstructured":"Yuan, M., Lin, Y.: Model selection and estimation in regression with grouped variables. J. R. Stat. Soc. B 68, 49\u201367 (2006)","journal-title":"J. R. Stat. Soc. B"},{"key":"614_CR31","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/s10589-009-9251-8","volume":"48","author":"S Yun","year":"2011","unstructured":"Yun, S., Toh, K.-C.: A coordinate gradient descent method for $$ l_1$$ -regularized convex minimization. Comput. Optim. Appl. 48, 273\u2013307 (2011)","journal-title":"Comput. Optim. Appl."},{"key":"614_CR32","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1111\/j.1467-9868.2005.00503.x","volume":"67","author":"H Zou","year":"2005","unstructured":"Zou, H., Hastie, T.: Regularization and variable selection via the elastic net. J. R. Stat. Soc. B 67, 301\u2013320 (2005)","journal-title":"J. R. Stat. Soc. B"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0614-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-012-0614-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0614-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T10:04:46Z","timestamp":1714644286000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-012-0614-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12,4]]},"references-count":32,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["614"],"URL":"https:\/\/doi.org\/10.1007\/s10107-012-0614-z","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12,4]]}}}