{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T00:53:24Z","timestamp":1774745604051,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,1,2]],"date-time":"2019-01-02T00:00:00Z","timestamp":1546387200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2014\/14228-6"],"award-info":[{"award-number":["2014\/14228-6"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2013\/05475-7"],"award-info":[{"award-number":["2013\/05475-7"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2013\/07375-0"],"award-info":[{"award-number":["2013\/07375-0"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["302915\/2016-8"],"award-info":[{"award-number":["302915\/2016-8"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["306986\/2016-7"],"award-info":[{"award-number":["306986\/2016-7"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1007\/s10589-018-00056-8","type":"journal-article","created":{"date-parts":[[2019,1,2]],"date-time":"2019-01-02T12:12:52Z","timestamp":1546431172000},"page":"609-640","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Accelerating block coordinate descent methods with identification strategies"],"prefix":"10.1007","volume":"72","author":[{"given":"R.","family":"Lopes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6250-0137","authenticated-orcid":false,"given":"S. A.","family":"Santos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1340-965X","authenticated-orcid":false,"given":"P. J. S.","family":"Silva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,1,2]]},"reference":[{"key":"56_CR1","doi-asserted-by":"publisher","unstructured":"Andrew, G., Gao, J.: Scalable training of L1-regularized log-linear models. In: Proceedings of the 24th international conference on machine learning, ICML \u201907, pp. 33\u201340. ACM, New York, NY, USA (2007). https:\/\/doi.org\/10.1145\/1273496.1273501","DOI":"10.1145\/1273496.1273501"},{"issue":"4","key":"56_CR2","doi-asserted-by":"publisher","first-page":"2037","DOI":"10.1137\/120887679","volume":"23","author":"A Beck","year":"2013","unstructured":"Beck, A., Tetruashvili, L.: On the convergence of block coordinate descent type methods. SIAM J. Optim. 23(4), 2037\u20132060 (2013). https:\/\/doi.org\/10.1137\/120887679","journal-title":"SIAM J. Optim."},{"key":"56_CR3","unstructured":"Berg, E.V., Friedlander, M.P., Hennenfent, G., Herrmann, F., Saab, R., Y\u0131lmaz, \u00d6.: SPARCO: a testing framework for sparse reconstruction. Technical Report TR-2007-20, Department of Computer Science, University of British Columbia, Vancouver (2007)"},{"key":"56_CR4","doi-asserted-by":"publisher","unstructured":"Boisvert, R.F., Pozo, R., Remington, K., Barrett, R.F., Dongarra, J.J.: Matrix market: a web resource for test matrix collections, pp. 125\u2013137. Springer US, Boston, MA (1997). https:\/\/doi.org\/10.1007\/978-1-5041-2940-4_9","DOI":"10.1007\/978-1-5041-2940-4_9"},{"issue":"1","key":"56_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S Boyd","year":"2010","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn. 3(1), 1\u2013122 (2010)","journal-title":"Found. Trends Mach. Learn."},{"key":"56_CR6","unstructured":"Bradley, J.K., Kyrola, A., Bickson, D., Guestrin, C.: Parallel coordinate descent for $$\\ell _1$$ \u2113 1 -regularized loss minimization. In: ICML2011 (ed.) Proceedings of the 28th international conference on machine learning, pp. 1\u20138. The International Machine Learning Society, Bellevue, Washington, USA (2011). http:\/\/www.icml-2011.org\/papers\/231_icmlpaper.pdf"},{"issue":"6","key":"56_CR7","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E.J., Recht, B.: Exact matrix completion via convex optimization. Found. Comput. Math. 9(6), 717\u2013772 (2009). https:\/\/doi.org\/10.1007\/s10208-009-9045-5","journal-title":"Found. Comput. Math."},{"issue":"3","key":"56_CR8","first-page":"27","volume":"2","author":"CC Chang","year":"2011","unstructured":"Chang, C.C., Lin, C.J.: LIBSVM: a library for support vector machines. ACM Trans. Intell. Syst. Technol. (TIST) 2(3), 27 (2011)","journal-title":"ACM Trans. Intell. Syst. Technol. (TIST)"},{"issue":"3","key":"56_CR9","doi-asserted-by":"publisher","first-page":"1583","DOI":"10.1137\/16M1062259","volume":"27","author":"T Chen","year":"2017","unstructured":"Chen, T., Curtis, F., Robinson, D.: A reduced-space algorithm for minimizing $$\\ell _1$$ \u2113 1 -regularized convex functions. SIAM J. Optim. 27(3), 1583\u20131610 (2017). https:\/\/doi.org\/10.1137\/16M1062259","journal-title":"SIAM J. Optim."},{"key":"56_CR10","unstructured":"Csiba, D., Qu, Z., Richt\u00e1rik, P.: Stochastic dual coordinate ascent with adaptive probabilities. In: Proceedings of the 32nd international conference on international conference on machine learning, ICML\u201915, vol.\u00a037, pp. 674\u2013683. JMLR.org, Lille, France (2015). http:\/\/dl.acm.org\/citation.cfm?id=3045118.3045191"},{"issue":"1","key":"56_CR11","doi-asserted-by":"publisher","first-page":"1:1","DOI":"10.1145\/2049662.2049663","volume":"38","author":"TA Davis","year":"2011","unstructured":"Davis, T.A., Hu, Y.: The University of Florida sparse matrix collection. ACM Trans. Math. Softw. 38(1), 1:1\u20131:25 (2011). https:\/\/doi.org\/10.1145\/2049662.2049663","journal-title":"ACM Trans. Math. Softw."},{"issue":"1","key":"56_CR12","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1137\/141000737","volume":"26","author":"M Santis De","year":"2016","unstructured":"De Santis, M., Lucidi, S., Rinaldi, F.: A fast active set block coordinate descent algorithm for $$\\ell _1$$ \u2113 1 -regularized least squares. SIAM J. Optim. 26(1), 781\u2013809 (2016). https:\/\/doi.org\/10.1137\/141000737","journal-title":"SIAM J. Optim."},{"issue":"2","key":"56_CR13","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2), 201\u2013213 (2002). https:\/\/doi.org\/10.1007\/s101070100263","journal-title":"Math. Program."},{"issue":"4","key":"56_CR14","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL Donoho","year":"2006","unstructured":"Donoho, D.L.: Compressed sensing. IEEE Trans. Inf. Theory 52(4), 1289\u20131306 (2006). https:\/\/doi.org\/10.1109\/TIT.2006.871582","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"56_CR15","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1137\/S1052623496305882","volume":"9","author":"F Facchinei","year":"1998","unstructured":"Facchinei, F., Fischer, A., Kanzow, C.: On the accurate identification of active constraints. SIAM J. Optim. 9(1), 14\u201332 (1998). https:\/\/doi.org\/10.1137\/S1052623496305882","journal-title":"SIAM J. Optim."},{"issue":"4","key":"56_CR16","doi-asserted-by":"publisher","first-page":"1997","DOI":"10.1137\/130949993","volume":"25","author":"O Fercoq","year":"2015","unstructured":"Fercoq, O., Richt\u00e1rik, P.: Accelerated, parallel and proximal coordinate descent. SIAM J. Optim. 25(4), 1997\u20132013 (2015). https:\/\/doi.org\/10.1137\/130949993","journal-title":"SIAM J. Optim."},{"issue":"2","key":"56_CR17","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10589-018-9984-3","volume":"70","author":"K Fountoulakis","year":"2018","unstructured":"Fountoulakis, K., Tappenden, R.: A flexible coordinate descent method. Comput. Optim. Appl. 70(2), 351\u2013394 (2018). https:\/\/doi.org\/10.1007\/s10589-018-9984-3","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"56_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.18637\/jss.v033.i01","volume":"33","author":"J Friedman","year":"2010","unstructured":"Friedman, J., Hastie, T., Tibshirani, R.: Regularization paths for generalized linear models via coordinate descent. J. Stat. Softw. 33(1), 1\u201322 (2010). https:\/\/doi.org\/10.18637\/jss.v033.i01","journal-title":"J. Stat. Softw."},{"key":"56_CR19","unstructured":"Glasmachers, T., Dogan, U.: Accelerated coordinate descent with adaptive coordinate frequencies. In: Proceedings of the 5th Asian conference on machine learning (ACML), Proc. Mach. Learn. Res., vol.\u00a029, pp. 72\u201386. PMLR, Australian National University, Canberra, Australia (2013). http:\/\/proceedings.mlr.press\/v29\/Glasmachers13.html"},{"issue":"5","key":"56_CR20","doi-asserted-by":"publisher","first-page":"1012","DOI":"10.1080\/10556788.2012.656368","volume":"28","author":"D Kim","year":"2013","unstructured":"Kim, D., Sra, S., Dhillon, I.S.: A non-monotonic method for large-scale non-negative least squares. Optim. Methods Softw. 28(5), 1012\u20131039 (2013). https:\/\/doi.org\/10.1080\/10556788.2012.656368","journal-title":"Optim. Methods Softw."},{"issue":"4","key":"56_CR21","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1109\/JSTSP.2007.910971","volume":"1","author":"SJ Kim","year":"2007","unstructured":"Kim, S.J., Koh, K., Lustig, M., Boyd, S., Gorinevsky, D.: An interior-point method for large-scale $$\\ell _1$$ \u2113 1 -regularized least squares. IEEE J. Sel. Top. Signal Process. 1(4), 606\u2013617 (2007)","journal-title":"IEEE J. Sel. Top. Signal Process."},{"key":"56_CR22","unstructured":"Komarek, P.: Paul Komarek\u2019s webpage. http:\/\/komarix.org\/ac\/ds\/ . Accessed 29 January 2017"},{"key":"56_CR23","unstructured":"Lichman, M.: UCI Machine Learning Repository, University of California, Irvine, School of Information and Computer Sciences. http:\/\/archive.ics.uci.edu\/ml . Last updated 23 July 2017. Accessed 01 September 2017"},{"key":"56_CR24","volume-title":"Foundations of Machine Learning","author":"M Mohri","year":"2012","unstructured":"Mohri, M., Rostamizadeh, A., Talwalkar, A.: Foundations of Machine Learning. The MIT Press, Cambridge (2012)"},{"issue":"2","key":"56_CR25","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1137\/100802001","volume":"22","author":"Y Nesterov","year":"2012","unstructured":"Nesterov, Y.: Efficiency of coordinate descent methods on huge-scale optimization problems. SIAM J. Optim. 22(2), 341\u2013362 (2012). https:\/\/doi.org\/10.1137\/100802001","journal-title":"SIAM J. Optim."},{"key":"56_CR26","unstructured":"Ng, A.Y.: Feature selection, $${L}_1$$ L 1 vs. $${L}_2$$ L 2 regularization and rotational invariance. In: Proceedings of the 21st international conference on machine learning, p. 354 (2004). http:\/\/www.machinelearning.org\/proceedings\/icml2004\/papers\/354.pdf"},{"issue":"1","key":"56_CR27","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s10898-014-0151-9","volume":"61","author":"A Patrascu","year":"2015","unstructured":"Patrascu, A., Necoara, I.: Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization. J. Glob. Optim. 61(1), 19\u201346 (2015). https:\/\/doi.org\/10.1007\/s10898-014-0151-9","journal-title":"J. Glob. Optim."},{"issue":"5","key":"56_CR28","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1080\/10556788.2016.1190360","volume":"31","author":"Z Qu","year":"2016","unstructured":"Qu, Z., Richt\u00e1rik, P.: Coordinate descent with arbitrary sampling I: algorithms and complexity. Optim. Methods Softw. 31(5), 829\u2013857 (2016). https:\/\/doi.org\/10.1080\/10556788.2016.1190360","journal-title":"Optim. Methods Softw."},{"key":"56_CR29","doi-asserted-by":"publisher","unstructured":"Richt\u00e1rik, P., Tak\u00e1\u010d, M.: Efficient serial and parallel coordinate descent methods for huge-scale truss topology design, pp. 27\u201332. Springer, Berlin, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29210-1_5","DOI":"10.1007\/978-3-642-29210-1_5"},{"issue":"1","key":"56_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-012-0614-z","volume":"144","author":"P Richt\u00e1rik","year":"2014","unstructured":"Richt\u00e1rik, P., Tak\u00e1\u010d, M.: Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function. Math. Program. 144(1), 1\u201338 (2014). https:\/\/doi.org\/10.1007\/s10107-012-0614-z","journal-title":"Math. Program."},{"issue":"1","key":"56_CR31","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/s10107-015-0901-6","volume":"156","author":"P Richt\u00e1rik","year":"2016","unstructured":"Richt\u00e1rik, P., Tak\u00e1\u010d, M.: Parallel coordinate descent methods for big data optimization. Math. Program. 156(1), 433\u2013484 (2016). https:\/\/doi.org\/10.1007\/s10107-015-0901-6","journal-title":"Math. Program."},{"key":"56_CR32","unstructured":"Schmidt, M.: Graphical model structure learning with l1-regularization. Ph.D. thesis, University of British Columbia, Vancouver (2010)"},{"key":"56_CR33","unstructured":"Slawski, M.: Problem-specific analysis of non-negative least squares solvers with a focus on instances with sparse solutions (working paper) (2013). https:\/\/sites.google.com\/site\/slawskimartin\/publications . Accessed 01 September 2017"},{"issue":"1","key":"56_CR34","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/s10957-016-0867-4","volume":"170","author":"R Tappenden","year":"2016","unstructured":"Tappenden, R., Richt\u00e1rik, P., Gondzio, J.: Inexact coordinate descent: complexity and preconditioning. J. Optim. Theory Appl. 170(1), 144\u2013176 (2016). https:\/\/doi.org\/10.1007\/s10957-016-0867-4","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"56_CR35","doi-asserted-by":"crossref","first-page":"267","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. Ser. B 58(1), 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc. Ser. B"},{"issue":"1","key":"56_CR36","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10107-007-0170-0","volume":"117","author":"P Tseng","year":"2009","unstructured":"Tseng, P., Yun, S.: A coordinate gradient descent method for nonsmooth separable minimization. Math. Program. 117(1), 387\u2013423 (2009). https:\/\/doi.org\/10.1007\/s10107-007-0170-0","journal-title":"Math. Program."},{"issue":"6","key":"56_CR37","doi-asserted-by":"publisher","first-page":"1127","DOI":"10.1080\/10556788.2011.591398","volume":"27","author":"Z Wen","year":"2012","unstructured":"Wen, Z., Yin, W., Zhang, H., Goldfarb, D.: On the convergence of an active-set method for $$\\ell _1$$ \u2113 1 minimization. Optim. Methods Softw. 27(6), 1127\u20131146 (2012). https:\/\/doi.org\/10.1080\/10556788.2011.591398","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"56_CR38","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-015-0892-3","volume":"151","author":"SJ Wright","year":"2015","unstructured":"Wright, S.J.: Coordinate descent algorithms. Math. Program. 151(1), 3\u201334 (2015). https:\/\/doi.org\/10.1007\/s10107-015-0892-3","journal-title":"Math. Program."},{"issue":"7","key":"56_CR39","doi-asserted-by":"publisher","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. IEEE Trans. Signal Process. 57(7), 2479\u20132493 (2009). https:\/\/doi.org\/10.1109\/TSP.2009.2016892","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"56_CR40","doi-asserted-by":"publisher","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. Ser. B (Stat. Methodol.) 68(1), 49\u201367 (2006). https:\/\/doi.org\/10.1111\/j.1467-9868.2005.00532.x","journal-title":"J. R. Stat. Soc. Ser. B (Stat. Methodol.)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-00056-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-018-00056-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-00056-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,13]],"date-time":"2024-07-13T19:26:26Z","timestamp":1720898786000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-018-00056-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,2]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["56"],"URL":"https:\/\/doi.org\/10.1007\/s10589-018-00056-8","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,2]]},"assertion":[{"value":"22 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 January 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}