{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:24:38Z","timestamp":1740122678333,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,3,2]],"date-time":"2019-03-02T00:00:00Z","timestamp":1551484800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"crossref","award":["EP\/M028240","EP\/K040723"],"award-info":[{"award-number":["EP\/M028240","EP\/K040723"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"crossref"}]},{"name":"FP7 Marie Curie Career Integration Grant","award":["PCIG11-GA-2012-321698 SOC-MP-ES"],"award-info":[{"award-number":["PCIG11-GA-2012-321698 SOC-MP-ES"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s10589-019-00080-2","type":"journal-article","created":{"date-parts":[[2019,3,2]],"date-time":"2019-03-02T10:53:04Z","timestamp":1551523984000},"page":"387-410","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Empirical risk minimization: probabilistic complexity and stepsize strategy"],"prefix":"10.1007","volume":"73","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2143-978X","authenticated-orcid":false,"given":"Chin Pang","family":"Ho","sequence":"first","affiliation":[]},{"given":"Panos","family":"Parpas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,3,2]]},"reference":[{"issue":"1","key":"80_CR1","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). \n                    https:\/\/doi.org\/10.1137\/080716542","journal-title":"SIAM J. Imaging Sci."},{"issue":"4","key":"80_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). \n                    https:\/\/doi.org\/10.1137\/120887679","journal-title":"SIAM J. Optim."},{"issue":"2","key":"80_CR3","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1214\/14-AOS1204","volume":"42","author":"A Belloni","year":"2014","unstructured":"Belloni, A., Chernozhukov, V., Wang, L.: Pivotal estimation via square-root Lasso in nonparametric regression. Ann. Stat. 42(2), 757\u2013788 (2014). \n                    https:\/\/doi.org\/10.1214\/14-AOS1204","journal-title":"Ann. Stat."},{"issue":"2, Ser. A","key":"80_CR4","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/BF01585997","volume":"71","author":"JV Burke","year":"1995","unstructured":"Burke, J.V., Ferris, M.C.: A Gauss\u2013Newton method for convex composite optimization. Math. Program. 71(2, Ser. A), 179\u2013194 (1995). \n                    https:\/\/doi.org\/10.1007\/BF01585997","journal-title":"Math. Program."},{"issue":"8","key":"80_CR5","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1002\/cpa.20124","volume":"59","author":"EJ Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s, E.J., Romberg, J.K., Tao, T.: Stable signal recovery from incomplete and inaccurate measurements. Commun. Pure Appl. Math. 59(8), 1207\u20131223 (2006). \n                    https:\/\/doi.org\/10.1002\/cpa.20124","journal-title":"Commun. Pure Appl. Math."},{"issue":"4","key":"80_CR6","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). \n                    https:\/\/doi.org\/10.1109\/TIT.2006.871582","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1\u20132, Ser. A","key":"80_CR7","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10107-012-0541-z","volume":"138","author":"CC Gonzaga","year":"2013","unstructured":"Gonzaga, C.C., Karas, E.W.: Fine tuning Nesterov\u2019s steepest descent algorithm for differentiable convex programming. Math. Program. 138(1\u20132, Ser. A), 141\u2013166 (2013). \n                    https:\/\/doi.org\/10.1007\/s10107-012-0541-z","journal-title":"Math. Program."},{"key":"80_CR8","first-page":"12991","volume":"23","author":"V Koltchinskii","year":"2015","unstructured":"Koltchinskii, V., Mendelson, S.: Bounding the smallest singular value of a random matrix without concentration. Int. Math. Res. Not. 23, 12991\u201313008 (2015)","journal-title":"Int. Math. Res. Not."},{"issue":"3","key":"80_CR9","doi-asserted-by":"publisher","first-page":"1420","DOI":"10.1137\/130921428","volume":"24","author":"JD Lee","year":"2014","unstructured":"Lee, J.D., Sun, Y., Saunders, M.A.: Proximal Newton-type methods for minimizing composite functions. SIAM J. Optim. 24(3), 1420\u20131443 (2014). \n                    https:\/\/doi.org\/10.1137\/130921428","journal-title":"SIAM J. Optim."},{"key":"80_CR10","series-title":"Applied Optimization","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course. Applied Optimization, vol. 87. Kluwer Academic Publishers, Boston (2004). \n                    https:\/\/doi.org\/10.1007\/978-1-4419-8853-9"},{"issue":"1, Ser. B","key":"80_CR11","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite functions. Math. Program. 140(1, Ser. B), 125\u2013161 (2013). \n                    https:\/\/doi.org\/10.1007\/s10107-012-0629-5","journal-title":"Math. Program."},{"issue":"1\u20132, Ser. A","key":"80_CR12","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s10107-014-0790-0","volume":"152","author":"Y Nesterov","year":"2015","unstructured":"Nesterov, Y.: Universal gradient methods for convex optimization problems. Math. Program. 152(1\u20132, Ser. A), 381\u2013404 (2015). \n                    https:\/\/doi.org\/10.1007\/s10107-014-0790-0","journal-title":"Math. Program."},{"issue":"2","key":"80_CR13","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s12532-013-0051-x","volume":"5","author":"Z Qin","year":"2013","unstructured":"Qin, Z., Scheinberg, K., Goldfarb, D.: Efficient block-coordinate descent algorithms for the group Lasso. Math. Program. Comput. 5(2), 143\u2013169 (2013). \n                    https:\/\/doi.org\/10.1007\/s12532-013-0051-x","journal-title":"Math. Program. Comput."},{"key":"80_CR14","unstructured":"Qu, Z., Richtarik, P.: Coordinate descent with arbitrary sampling II: expected separable overapproximation. \n                    arXiv:1412.8063\n                    \n                   (2014)"},{"key":"80_CR15","unstructured":"Rudelson, M., Vershynin, R.: Non-asymptotic theory of random matrices: extreme singular values. In: Proceedings of the International Congress of Mathematicians, vol. III, pp. 1576\u20131602. Hindustan Book Agency, New Delhi (2010)"},{"issue":"1","key":"80_CR16","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1137\/110840054","volume":"23","author":"A Saha","year":"2013","unstructured":"Saha, A., Tewari, A.: On the nonasymptotic convergence of cyclic coordinate descent methods. SIAM J. Optim. 23(1), 576\u2013601 (2013). \n                    https:\/\/doi.org\/10.1137\/110840054","journal-title":"SIAM J. Optim."},{"key":"80_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107298019","volume-title":"Understanding Machine Learning: From Theory to Algorithms","author":"S Shalev-Shwartz","year":"2014","unstructured":"Shalev-Shwartz, S., Ben-David, S.: Understanding Machine Learning: From Theory to Algorithms. Cambridge University Press, Cambridge (2014)"},{"key":"80_CR18","first-page":"3385","volume":"14","author":"T Sun","year":"2013","unstructured":"Sun, T., Zhang, C.H.: Sparse matrix inversion with scaled Lasso. J. Mach. Learn. Res. 14, 3385\u20133418 (2013)","journal-title":"J. Mach. Learn. Res."},{"issue":"4","key":"80_CR19","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s10208-011-9099-z","volume":"12","author":"JA Tropp","year":"2012","unstructured":"Tropp, J.A.: User-friendly tail bounds for sums of random matrices. Found. Comput. Math. 12(4), 389\u2013434 (2012). \n                    https:\/\/doi.org\/10.1007\/s10208-011-9099-z","journal-title":"Found. Comput. Math."},{"issue":"3","key":"80_CR20","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1137\/0910036","volume":"10","author":"E Yamakawa","year":"1989","unstructured":"Yamakawa, E., Fukushima, M., Ibaraki, T.: An efficient trust region algorithm for minimizing nondifferentiable composite functions. SIAM J. Sci. Stat. Comput. 10(3), 562\u2013580 (1989). \n                    https:\/\/doi.org\/10.1137\/0910036","journal-title":"SIAM J. Sci. Stat. Comput."},{"issue":"1","key":"80_CR21","first-page":"1999","volume":"13","author":"GX Yuan","year":"2012","unstructured":"Yuan, G.X., Ho, C.H., Lin, C.J.: An improved GLMNET for L1-regularized logistic regression. J. Mach. Learn. Res. 13(1), 1999\u20132030 (2012)","journal-title":"J. Mach. Learn. Res."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00080-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-019-00080-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00080-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,29]],"date-time":"2020-02-29T19:12:55Z","timestamp":1583003575000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-019-00080-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,2]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["80"],"URL":"https:\/\/doi.org\/10.1007\/s10589-019-00080-2","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2019,3,2]]},"assertion":[{"value":"17 October 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 March 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}