{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T23:03:09Z","timestamp":1781737389906,"version":"3.54.5"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,3,31]],"date-time":"2013-03-31T00:00:00Z","timestamp":1364688000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1007\/s12532-013-0051-x","type":"journal-article","created":{"date-parts":[[2013,3,30]],"date-time":"2013-03-30T06:37:19Z","timestamp":1364625439000},"page":"143-169","source":"Crossref","is-referenced-by-count":117,"title":["Efficient block-coordinate descent algorithms for the Group Lasso"],"prefix":"10.1007","volume":"5","author":[{"given":"Zhiwei","family":"Qin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Katya","family":"Scheinberg","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Donald","family":"Goldfarb","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,3,31]]},"reference":[{"key":"51_CR1","first-page":"1179","volume":"9","author":"F Bach","year":"2008","unstructured":"Bach, F.: Consistency of the group Lasso and multiple kernel learning. J. Mach. Learn. Res. 9, 1179\u20131225 (2008)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"51_CR2","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imag. Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imag. Sci."},{"key":"51_CR3","unstructured":"van den Berg, E., Friedlander, M.: Joint-sparse recovery from multiple measurements. arXiv 904 (2009)"},{"key":"51_CR4","unstructured":"van den Berg, E., Friedlander, M.: Sparse Optimization With Least-squares Constraints. Tech. rep., Technical Report TR-2010-02, Department of Computer Science, University of British Columbia, Columbia (2010)"},{"key":"51_CR5","unstructured":"van den Berg, E., Schmidt, M., Friedlander, M., Murphy, K.: Group sparsity via linear-time projection. Tech. rep., Technical Report TR-2008-09, Department of Computer Science, University of British Columbia, Columbia (2008)"},{"issue":"2","key":"51_CR6","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TIT.2005.862083","volume":"52","author":"E Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s, E., Romberg, J., Tao, T.: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. Inform Theory IEEE Trans 52(2), 489\u2013509 (2006)","journal-title":"Inform Theory IEEE Trans"},{"key":"51_CR7","first-page":"12","volume":"54","author":"J Chen","year":"2006","unstructured":"Chen, J., Huo, X.: Theoretical results on sparse representations of multiple-measurement vectors. IEEE Trans. Signal Process. 54, 12 (2006)","journal-title":"IEEE Trans. Signal Process."},{"issue":"2","key":"51_CR8","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"E Dolan","year":"2002","unstructured":"Dolan, E., Mor\u00e9, J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2), 201\u2013213 (2002)","journal-title":"Math. Program."},{"issue":"4","key":"51_CR9","first-page":"1289","volume":"52","author":"D Donoho","year":"2006","unstructured":"Donoho, D.: Compressed sensing, information theory. IEEE Trans. 52(4), 1289\u20131306 (2006)","journal-title":"IEEE Trans."},{"key":"51_CR10","unstructured":"Friedman, J., Hastie, T., Tibshirani, R.: A note on the group lasso and a sparse group lasso. preprint, Leipzig (2010)"},{"key":"51_CR11","doi-asserted-by":"crossref","unstructured":"Jacob, L., Obozinski, G., Vert, J.: Group Lasso with overlap and graph Lasso. In: Proceedings of the 26th Annual International Conference on Machine Learning, ACM, New York, pp. 433\u2013440 (2009)","DOI":"10.1145\/1553374.1553431"},{"key":"51_CR12","unstructured":"Kim, D., Sra, S., Dhillon, I.: A scalable trust-region algorithm with application to mixed-norm regression. vol. 1. In: Internetional Conference Machine Learning (ICML), Atlanta (2010)"},{"key":"51_CR13","unstructured":"Kim, S., Xing, E.: Tree-guided group lasso for multi-task regression with structured sparsity. In: Proceedings of the 27th Annual International Conference on, Machine Learning, New York (2010)"},{"key":"51_CR14","unstructured":"Liu, J., Ji, S., Ye, J.: Multi-task feature learning via efficient l 2, 1-norm minimization. In: Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence, AUAI Press, Corvallis, pp. 339\u2013348 (2009)"},{"key":"51_CR15","volume-title":"SLEP: Sparse Learning with Efficient Projections","author":"J Liu","year":"2009","unstructured":"Liu, J., Ji, S., Ye, J.: SLEP: Sparse Learning with Efficient Projections. Arizona State University, Arizona (2009)"},{"issue":"1","key":"51_CR16","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1186\/1471-2105-8-60","volume":"8","author":"S Ma","year":"2007","unstructured":"Ma, S., Song, X., Huang, J.: Supervised group Lasso with applications to microarray data analysis. BMC bioinformatics 8(1), 60 (2007)","journal-title":"BMC bioinformatics"},{"issue":"1","key":"51_CR17","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. Royal Stat. Soc. Ser. B (Stat. Methodol.) 70(1), 53\u201371 (2008)","journal-title":"J. Royal Stat. Soc. Ser. B (Stat. Methodol.)"},{"key":"51_CR18","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1137\/0904038","volume":"4","author":"J Mor\u00e9","year":"1983","unstructured":"Mor\u00e9, J., Sorensen, D.: Computing a trust region step. SIAM J. Sci. Statist. Comput. 4, 553 (1983)","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"51_CR19","unstructured":"Nesterov, Y.: Efficiency of coordinate descent methods on huge-scale optimization problems. CORE Discussion Papers, Belgique (2010)"},{"key":"51_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/b98874","volume-title":"Numerical optimization","author":"J Nocedal","year":"1999","unstructured":"Nocedal, J., Wright, S.: Numerical optimization. Springer verlag, New York (1999)"},{"issue":"7","key":"51_CR21","doi-asserted-by":"crossref","first-page":"1505","DOI":"10.1016\/j.sigpro.2011.01.012","volume":"91","author":"A Rakotomamonjy","year":"2011","unstructured":"Rakotomamonjy, A.: Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms. Sig. Process. 91(7), 1505\u20131526 (2011)","journal-title":"Sig. Process."},{"key":"51_CR22","doi-asserted-by":"crossref","unstructured":"Richt\u00e1rik, P., Tak\u00e1\u010d, M.: Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function. Arxiv, preprint arXiv:1107.2848 (2011)","DOI":"10.1007\/s10107-012-0614-z"},{"key":"51_CR23","doi-asserted-by":"crossref","unstructured":"Roth, V., Fischer, B.: The group-lasso for generalized linear models: uniqueness of solutions and efficient algorithms. In: Proceedings of the 25th international conference on Machine learning, ACM, Bellevue, pp. 848\u2013855 (2008)","DOI":"10.1145\/1390156.1390263"},{"issue":"43","key":"51_CR24","doi-asserted-by":"crossref","first-page":"15,545","DOI":"10.1073\/pnas.0506580102","volume":"102","author":"A Subramanian","year":"2005","unstructured":"Subramanian, A., Tamayo, P., Mootha, V., Mukherjee, S., Ebert, B., Gillette, M., Paulovich, A., Pomeroy, S., Golub, T., Lander, E., et al.: Gene set enrichment analysis: a knowledge-based approach for interpreting genome-wide expression profiles. Proc. Natl Acad. Sci. U.S.A. 102(43), 15,545 (2005)","journal-title":"Proc. Natl Acad. Sci. U.S.A."},{"key":"51_CR25","volume-title":"Efficient Recovery of Jointly Sparse Vectors","author":"L Sun","year":"2009","unstructured":"Sun, L., Liu, J., Chen, J., Ye, J.: Efficient Recovery of Jointly Sparse Vectors. NIPS, Canada, (2009)"},{"issue":"1","key":"51_CR26","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"Tibshirani R","year":"1966","unstructured":"R, Tibshirani: Regression shrinkage and selection via the lasso. J. Royal Statist. Soc. Ser. B (Methodol.) 58(1), 267\u2013288 (1966)","journal-title":"J. Royal Statist. Soc. Ser. B (Methodol.)"},{"issue":"3","key":"51_CR27","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1023\/A:1017501703105","volume":"109","author":"P Tseng","year":"2001","unstructured":"Tseng, P.: Convergence of a block coordinate descent method for nondifferentiable minimization. J. Optim. Theory Appl. 109(3), 475\u2013494 (2001)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"51_CR28","doi-asserted-by":"crossref","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)","journal-title":"Math. Program."},{"issue":"25","key":"51_CR29","doi-asserted-by":"crossref","first-page":"1999","DOI":"10.1056\/NEJMoa021967","volume":"347","author":"M Vijver Van De","year":"2002","unstructured":"Van De Vijver, M., He, Y., van\u2019t Veer, L., Dai, H., Hart, A., Voskuil, D., Schreiber, G., Peterse, J., Roberts, C., Marton, M., et al.: A gene-expression signature as a predictor of survival in breast cancer. N. Engl. J. Med. 347(25), 1999 (2002)","journal-title":"N. Engl. J. Med."},{"key":"51_CR30","unstructured":"Vandenberghe, L.: Gradient methods for nonsmooth problems. EE236C course notes (2008)"},{"issue":"7","key":"51_CR31","doi-asserted-by":"crossref","first-page":"2479","DOI":"10.1109\/TSP.2009.2016892","volume":"57","author":"S Wright","year":"2009","unstructured":"Wright, S., Nowak, R., Figueiredo, M.: Sparse reconstruction by separable approximation. IEEE Trans. Signal Process. 57(7), 2479\u20132493 (2009)","journal-title":"IEEE Trans. Signal Process."},{"key":"51_CR32","unstructured":"Yang, H., Xu, Z., King, I., Lyu, M.: Online learning for group lasso. In: 27th Intl Conf. on Machine Learning (ICML2010). Citeseer (2010)"},{"issue":"1","key":"51_CR33","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. Royal Statist. Soc. Ser. B (Statist. Methodol.) 68(1), 49\u201367 (2006)","journal-title":"J. Royal Statist. Soc. Ser. B (Statist. Methodol.)"},{"issue":"2","key":"51_CR34","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. Royal Statist. Soc. Ser. B (Statist. Methodol.) 67(2), 301\u2013320 (2005)","journal-title":"J. Royal Statist. Soc. Ser. B (Statist. Methodol.)"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-013-0051-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-013-0051-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-013-0051-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,8]],"date-time":"2024-05-08T04:36:47Z","timestamp":1715143007000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-013-0051-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,31]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["51"],"URL":"https:\/\/doi.org\/10.1007\/s12532-013-0051-x","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3,31]]}}}