{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T12:43:12Z","timestamp":1774528992147,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2018,9,25]],"date-time":"2018-09-25T00:00:00Z","timestamp":1537833600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["725594"],"award-info":[{"award-number":["725594"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1007\/s11590-018-1331-1","type":"journal-article","created":{"date-parts":[[2018,9,25]],"date-time":"2018-09-25T11:12:59Z","timestamp":1537873979000},"page":"1177-1187","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["On the linear convergence of the stochastic gradient method with constant step-size"],"prefix":"10.1007","volume":"13","author":[{"given":"Volkan","family":"Cevher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B\u0103\u0340ng C\u00f4ng","family":"V\u0169","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,25]]},"reference":[{"key":"1331_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9467-7","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"HH Bauschke","year":"2011","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces. Springer, New York (2011)"},{"key":"1331_CR2","first-page":"13","volume":"1","author":"PL Combettes","year":"2016","unstructured":"Combettes, P.L., Pesquet, J.-C.: Stochastic approximations and perturbations in forward-backward splitting for monotone operators. Pure Appl. Funct. Anal. 1, 13\u201337 (2016)","journal-title":"Pure Appl. Funct. Anal."},{"key":"1331_CR3","first-page":"2899","volume":"10","author":"JC Duchi","year":"2009","unstructured":"Duchi, J.C., Singer, Y.: Efficient online and batch learning using forward backward splitting. J. Mach. Learn. Res. 10, 2899\u20132934 (2009)","journal-title":"J. Mach. Learn. Res."},{"key":"1331_CR4","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s10107-015-0897-y","volume":"151","author":"M G\u00fcrb\u00fczbalaban","year":"2015","unstructured":"G\u00fcrb\u00fczbalaban, M., Ozdaglar, A., Parrilo, P.: A globally convergent incremental Newton method. Math. Program. 151, 283\u2013313 (2015)","journal-title":"Math. Program."},{"key":"1331_CR5","first-page":"2663","volume":"25","author":"N Roux Le","year":"2012","unstructured":"Le Roux, N., Schmidt, M., Bach, F.: A stochastic gradient method with an exponential convergence rate for strongly-convex optimization with finite training sets. Adv. Neural Inf. Process. Syst. 25, 2663\u20132671 (2012)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"1331_CR6","first-page":"263","volume-title":"Stochastic Optimization: Algorithms and Applications","author":"A Nedi\u0107","year":"2000","unstructured":"Nedi\u0107, A., Bertsekas, D.: Convergence rate of incremental subgradient algorithms. In: Uryasev, S., Pardalos, P. (eds.) Stochastic Optimization: Algorithms and Applications, pp. 263\u2013304. Springer, New York (2000)"},{"key":"1331_CR7","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/s10107-015-0864-7","volume":"155","author":"D Needell","year":"2016","unstructured":"Needell, D., Srebro, N., Ward, R.: Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm. Math. Program. 155, 549\u2013573 (2016)","journal-title":"Math. Program."},{"key":"1331_CR8","doi-asserted-by":"publisher","first-page":"1574","DOI":"10.1137\/070704277","volume":"19","author":"A Nemirovski","year":"2008","unstructured":"Nemirovski, A., Juditsky, A., Lan, G., Shapiro, A.: Robust stochastic approximation approach to stochastic programming. SIAM J. Optim. 19, 1574\u20131609 (2008)","journal-title":"SIAM J. Optim."},{"key":"1331_CR9","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/s10957-016-0893-2","volume":"169","author":"L Rosasco","year":"2016","unstructured":"Rosasco, L., Villa, S., V\u0169, B.C.: Stochastic forward-backward splitting for monotone inclusions. J. Optim. Theory Appl. 169, 388\u2013406 (2016)","journal-title":"J. Optim. Theory Appl."},{"key":"1331_CR10","unstructured":"Ryu, E., Boyd, S.: Stochastic proximal iteration: a non-asymptotic improvement upon stochastic gradient descent. \n                    http:\/\/web.stanford.edu\/~eryu\/\n                    \n                   (2016)"},{"key":"1331_CR11","unstructured":"Schmidt, M., Le Roux, N.: Fast convergence of stochastic Gradient descent under a strong growth condition (2013). \n                    https:\/\/arxiv.org\/pdf\/1308.6370.pdf"},{"key":"1331_CR12","unstructured":"Shamir, O., Zhang, T.: Stochastic gradient descent for non-smooth optimization: convergence results and optimal averaging schemes, ICML (2013)"},{"key":"1331_CR13","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1023\/A:1018366000512","volume":"11","author":"MV Solodov","year":"1998","unstructured":"Solodov, M.V.: Incremental gradient algorithms with stepsizes bounded away from zero. Comput. Optim. Appl. 11, 23\u201335 (1998)","journal-title":"Comput. Optim. Appl."},{"key":"1331_CR14","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/s00041-008-9030-4","volume":"15","author":"T Strohmer","year":"2009","unstructured":"Strohmer, T., Vershynin, R.: A randomized Kaczmarz algorithm with exponential convergence. J. Fourier Anal. Appl. 15, 262\u2013278 (2009)","journal-title":"J. Fourier Anal. Appl."},{"key":"1331_CR15","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1137\/S1052623495294797","volume":"8","author":"P Tseng","year":"1998","unstructured":"Tseng, P.: An incremental gradient (-projection) method with momentum term and adaptive stepsize rule. SIAM J. Optim. 8, 506\u2013531 (1998)","journal-title":"SIAM J. Optim."},{"key":"1331_CR16","doi-asserted-by":"publisher","first-page":"2057","DOI":"10.1137\/140961791","volume":"24","author":"L Xiao","year":"2014","unstructured":"Xiao, L., Zhang, T.: A proximal stochastic gradient method with progressive variance reduction. SIAM J. Optim. 24, 2057\u20132075 (2014)","journal-title":"SIAM J. Optim."},{"key":"1331_CR17","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1007\/s11590-014-0795-x","volume":"9","author":"H Zhang","year":"2015","unstructured":"Zhang, H., Cheng, L.: Restricted strong convexity and its applications to convergence analysis of gradient-type methods in convex optimization. Optim. Lett. 9, 961\u2013979 (2015)","journal-title":"Optim. Lett."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-018-1331-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-018-1331-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-018-1331-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,25]],"date-time":"2019-09-25T03:31:50Z","timestamp":1569382310000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-018-1331-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,25]]},"references-count":17,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["1331"],"URL":"https:\/\/doi.org\/10.1007\/s11590-018-1331-1","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9,25]]},"assertion":[{"value":"5 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 September 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 September 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}