{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T11:36:01Z","timestamp":1770896161433,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,2,29]],"date-time":"2020-02-29T00:00:00Z","timestamp":1582934400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,29]],"date-time":"2020-02-29T00:00:00Z","timestamp":1582934400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1447449"],"award-info":[{"award-number":["1447449"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1628384"],"award-info":[{"award-number":["1628384"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1634579"],"award-info":[{"award-number":["1634579"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1740707"],"award-info":[{"award-number":["1740707"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006224","name":"Argonne National Laboratory","doi-asserted-by":"publisher","award":["3F-30222"],"award-info":[{"award-number":["3F-30222"]}],"id":[{"id":"10.13039\/100006224","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006224","name":"Argonne National Laboratory","doi-asserted-by":"publisher","award":["8F-30039"],"award-info":[{"award-number":["8F-30039"]}],"id":[{"id":"10.13039\/100006224","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["N660011824020"],"award-info":[{"award-number":["N660011824020"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1007\/s10957-020-01639-4","type":"journal-article","created":{"date-parts":[[2020,2,29]],"date-time":"2020-02-29T08:02:37Z","timestamp":1582963357000},"page":"151-187","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Inexact Variable Metric Stochastic Block-Coordinate Descent for Regularized Optimization"],"prefix":"10.1007","volume":"185","author":[{"given":"Ching-pei","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen J.","family":"Wright","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,29]]},"reference":[{"issue":"1","key":"1639_CR1","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)","journal-title":"J. R. Stat. Soc. Ser. B (Stat. Methodol.)"},{"issue":"1","key":"1639_CR2","doi-asserted-by":"publisher","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., B\u00fchlmann, P.: The group LASSO for logistic regression. J. R. Stat. Soc. Ser. B (Stat. Methodol.) 70(1), 53\u201371 (2008)","journal-title":"J. R. Stat. Soc. Ser. B (Stat. Methodol.)"},{"issue":"2\u20133","key":"1639_CR3","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1023\/A:1013637720281","volume":"47","author":"K Crammer","year":"2002","unstructured":"Crammer, K., Singer, Y.: On the learnability and design of output codes for multiclass problems. Mach. Learn. 47(2\u20133), 201\u2013233 (2002)","journal-title":"Mach. Learn."},{"key":"1639_CR4","doi-asserted-by":"crossref","unstructured":"Lebanon, G., Lafferty, J.D.: Boosting and maximum likelihood for exponential models. In: Advances in Neural Information Processing Systems, pp. 447\u2013454 (2002)","DOI":"10.7551\/mitpress\/1120.003.0062"},{"issue":"Sep","key":"1639_CR5","first-page":"1453","volume":"6","author":"I Tsochantaridis","year":"2005","unstructured":"Tsochantaridis, I., Joachims, T., Hofmann, T., Altun, Y.: Large margin methods for structured and interdependent output variables. J. Mach. Learn. Res. 6(Sep), 1453\u20131484 (2005)","journal-title":"J. Mach. Learn. Res."},{"issue":"5","key":"1639_CR6","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1162\/NECO_a_00434","volume":"25","author":"C Lee","year":"2013","unstructured":"Lee, C., Lin, C.J.: A study on L2-loss (squared hinge-loss) multi-class SVM. Neural Comput. 25(5), 1302\u20131323 (2013)","journal-title":"Neural Comput."},{"issue":"2","key":"1639_CR7","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)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1639_CR8","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)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"1639_CR9","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)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"1639_CR10","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/s10898-016-0405-9","volume":"66","author":"E Chouzenoux","year":"2016","unstructured":"Chouzenoux, E., Pesquet, J.C., Repetti, A.: A block coordinate variable metric forward\u2013backward algorithm. J. Global Optim. 66(3), 457\u2013485 (2016)","journal-title":"J. Global Optim."},{"key":"1639_CR11","unstructured":"Sun, R., Hong, M.: Improved iteration complexity bounds of cyclic block coordinate descent for convex problems. In: Advances in Neural Information Processing Systems, pp. 1306\u20131314 (2015)"},{"issue":"1","key":"1639_CR12","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)","journal-title":"Math. Program."},{"issue":"3","key":"1639_CR13","doi-asserted-by":"publisher","first-page":"1567","DOI":"10.1137\/130937755","volume":"24","author":"S Yun","year":"2014","unstructured":"Yun, S.: On the iteration complexity of cyclic coordinate gradient descent methods. SIAM J. Optim. 24(3), 1567\u20131580 (2014)","journal-title":"SIAM J. Optim."},{"key":"1639_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-019-01437-5","author":"R Sun","year":"2019","unstructured":"Sun, R., Ye, Y.: Worst-case complexity of cyclic coordinate descent: $${O}(n^2)$$ gap with randomized version. Math. Program. (2019). https:\/\/doi.org\/10.1007\/s10107-019-01437-5","journal-title":"Math. Program."},{"issue":"2","key":"1639_CR15","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1137\/15M1019325","volume":"26","author":"S Bonettini","year":"2016","unstructured":"Bonettini, S., Loris, I., Porta, F., Prato, M.: Variable metric inexact line-search-based methods for nonsmooth optimization. SIAM J. Optim. 26(2), 891\u2013921 (2016)","journal-title":"SIAM J. Optim."},{"key":"1639_CR16","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s10589-019-00059-z","volume":"72","author":"C Lee","year":"2019","unstructured":"Lee, C., Wright, S.J.: Inexact successive quadratic approximation for regularized optimization. Comput. Optim. Appl. 72, 641\u2013674 (2019)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"1639_CR17","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/BF01442169","volume":"11","author":"JB Hiriart-Urruty","year":"1984","unstructured":"Hiriart-Urruty, J.B., Strodiot, J.J., Nguyen, V.H.: Generalized hessian matrix and second-order optimality conditions for problems with $${C}^{1,1}$$ data. Appl. Math. Optim. 11(1), 43\u201356 (1984)","journal-title":"Appl. Math. Optim."},{"issue":"3","key":"1639_CR18","doi-asserted-by":"publisher","first-page":"1246","DOI":"10.1093\/imanum\/dry040","volume":"39","author":"C Lee","year":"2019","unstructured":"Lee, C., Wright, S.J.: Random permutations fix a worst case for cyclic coordinate descent. IMA J. Numer. Anal. 39(3), 1246\u20131275 (2019)","journal-title":"IMA J. Numer. Anal."},{"key":"1639_CR19","doi-asserted-by":"crossref","unstructured":"Wright, S.J., Lee, C.: Analyzing random permutations for cyclic coordinate descent. Math. Comput. (2020). (To appear)","DOI":"10.1090\/mcom\/3530"},{"issue":"1","key":"1639_CR20","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. Global Optim. 61(1), 19\u201346 (2015)","journal-title":"J. Global Optim."},{"issue":"1","key":"1639_CR21","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1137\/100808563","volume":"22","author":"SJ Wright","year":"2012","unstructured":"Wright, S.J.: Accelerated block-coordinate relaxation for regularized optimization. SIAM J. Optim. 22(1), 159\u2013186 (2012)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1639_CR22","first-page":"6741","volume":"18","author":"X Li","year":"2017","unstructured":"Li, X., Zhao, T., Arora, R., Liu, H., Hong, M.: On faster convergence of cyclic block coordinate descent-type methods for strongly convex minimization. J. Mach. Learn. Res. 18(1), 6741\u20136764 (2017)","journal-title":"J. Mach. Learn. Res."},{"issue":"1\u20132","key":"1639_CR23","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s10107-016-0997-3","volume":"160","author":"K Scheinberg","year":"2016","unstructured":"Scheinberg, K., Tang, X.: Practical inexact proximal quasi-Newton method with global complexity analysis. Math. Program. 160(1\u20132), 495\u2013529 (2016)","journal-title":"Math. Program."},{"issue":"3","key":"1639_CR24","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s10589-017-9964-z","volume":"69","author":"H Ghanbari","year":"2018","unstructured":"Ghanbari, H., Scheinberg, K.: Proximal quasi-Newton methods for regularized convex optimization with linear and accelerated sublinear convergence rates. Comput. Optim. Appl. 69(3), 597\u2013627 (2018)","journal-title":"Comput. Optim. Appl."},{"key":"1639_CR25","unstructured":"Peng, W., Zhang, H., Zhang, X.: Global complexity analysis of inexact successive quadratic approximation methods for regularized optimization under mild assumptions. Tech. rep. (2018)"},{"key":"1639_CR26","unstructured":"Nutini, J., Schmidt, M., Laradji, I., Friedlander, M., Koepke, H.: Coordinate descent converges faster with the gauss-southwell rule than random selection. In: International Conference on Machine Learning, pp. 1632\u20131641 (2015)"},{"key":"1639_CR27","unstructured":"Nutini, J., Laradji, I., Schmidt, M.: Let\u2019s make block coordinate descent go fast: Faster greedy rules, message-passing, active-set complexity, and superlinear convergence. Tech. rep. (2017). arXiv:1712.08859"},{"issue":"1\u20132","key":"1639_CR28","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/s10107-014-0800-2","volume":"152","author":"Z Lu","year":"2015","unstructured":"Lu, Z., Xiao, L.: On the complexity analysis of randomized block-coordinate descent methods. Math. Program. 152(1\u20132), 615\u2013642 (2015)","journal-title":"Math. Program."},{"key":"1639_CR29","unstructured":"Zhao, P., Zhang, T.: Stochastic optimization with importance sampling for regularized loss minimization. In: Proceedings of the 32nd International Conference on Machine Learning (2015)"},{"key":"1639_CR30","unstructured":"Lee, C., Wright, S.J.: First-order algorithms converge faster than $${O}(1\/k)$$ on convex problems. In: Proceedings of the 36th International Conference on Machine Learning (2019)"},{"key":"1639_CR31","doi-asserted-by":"publisher","first-page":"33","DOI":"10.3389\/fams.2018.00033","volume":"4","author":"X He","year":"2018","unstructured":"He, X., Tappenden, R., Takac, M.: Dual free adaptive minibatch sdca for empirical risk minimization. Front. Appl. Math. Stat. 4, 33 (2018)","journal-title":"Front. Appl. Math. Stat."},{"issue":"3","key":"1639_CR32","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1145\/355744.355749","volume":"3","author":"AJ Walker","year":"1977","unstructured":"Walker, A.J.: An efficient method for generating discrete random variables with general distributions. ACM Trans. Math. Softw. 3(3), 253\u2013256 (1977)","journal-title":"ACM Trans. Math. Softw."},{"key":"1639_CR33","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, 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc. Ser. B"},{"issue":"7","key":"1639_CR34","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)","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"1639_CR35","doi-asserted-by":"publisher","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. Imaging Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"key":"1639_CR36","unstructured":"Carmon, Y., Duchi, J.C., Hinder, O., Sidford, A.: Convex until proven guilty: dimension-free acceleration of gradient descent on non-convex functions. In: International Conference on Machine Learning, pp. 654\u2013663. JMLR.org (2017)"},{"issue":"2","key":"1639_CR37","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1080\/00401706.1974.10489171","volume":"16","author":"AE Beaton","year":"1974","unstructured":"Beaton, A.E., Tukey, J.W.: The fitting of power series, meaning polynomials, illustrated on band-spectroscopic data. Technometrics 16(2), 147\u2013185 (1974)","journal-title":"Technometrics"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-020-01639-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-020-01639-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-020-01639-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T09:58:28Z","timestamp":1722506308000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-020-01639-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,29]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["1639"],"URL":"https:\/\/doi.org\/10.1007\/s10957-020-01639-4","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,29]]},"assertion":[{"value":"24 June 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 January 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 February 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}