{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:46:35Z","timestamp":1740123995516,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,2,22]],"date-time":"2021-02-22T00:00:00Z","timestamp":1613952000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,2,22]],"date-time":"2021-02-22T00:00:00Z","timestamp":1613952000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100006595","name":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii","doi-asserted-by":"publisher","award":["NO Grants 20142021, project ELO-Hyp, contract No. 24\/2020"],"award-info":[{"award-number":["NO Grants 20142021, project ELO-Hyp, contract No. 24\/2020"]}],"id":[{"id":"10.13039\/501100006595","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":[[2021,4]]},"DOI":"10.1007\/s10957-021-01821-2","type":"journal-article","created":{"date-parts":[[2021,2,22]],"date-time":"2021-02-22T05:03:11Z","timestamp":1613970191000},"page":"66-95","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["General Convergence Analysis of Stochastic First-Order Methods for Composite Optimization"],"prefix":"10.1007","volume":"189","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1102-2654","authenticated-orcid":false,"given":"Ion","family":"Necoara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,22]]},"reference":[{"unstructured":"Atchade, Y.F., Fort, G., Moulines, E.: On stochastic proximal gradient algorithms. arXiv:1402.2365 (2014)","key":"1821_CR1"},{"issue":"9","key":"1821_CR2","doi-asserted-by":"publisher","first-page":"3614","DOI":"10.1109\/TSP.2006.879312","volume":"54","author":"D Blatt","year":"2006","unstructured":"Blatt, D., Hero, A.O.: Energy based sensor network source localization via projection onto convex sets. IEEE Trans. Signal Process. 54(9), 3614\u20133619 (2006)","journal-title":"IEEE Trans. Signal Process."},{"issue":"6","key":"1821_CR3","doi-asserted-by":"publisher","first-page":"1340","DOI":"10.1137\/0331063","volume":"31","author":"JV Burke","year":"1993","unstructured":"Burke, J.V., Ferris, M.C.: Weak sharp minima in mathematical programming. SIAM J. Control Optim. 31(6), 1340\u20131359 (1993)","journal-title":"SIAM J. Control Optim."},{"key":"1821_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9467-7","volume-title":"Convex analysis and monotone operator theory in Hilbert spaces","author":"H Bauschke","year":"2011","unstructured":"Bauschke, H., Combettes, P.: Convex analysis and monotone operator theory in Hilbert spaces. Springer, New York (2011)"},{"key":"1821_CR5","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/16M1080173","volume":"60","author":"L Bottou","year":"2018","unstructured":"Bottou, L., Curtis, F., Nocedal, J.: Optimization methods for large-scale machine learning. SIAM Rev. 60, 223\u2013311 (2018)","journal-title":"SIAM Rev."},{"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. Now Publishers (2011)","key":"1821_CR6"},{"key":"1821_CR7","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s10107-013-0677-5","volume":"146","author":"O Devolder","year":"2014","unstructured":"Devolder, O., Glineur, F., Nesterov, Yu.: First-order methods of smooth convex optimization with inexact oracle. Math. Program. 146, 37\u201375 (2014)","journal-title":"Math. Program."},{"key":"1821_CR8","first-page":"2899","volume":"10","author":"J Duchi","year":"2009","unstructured":"Duchi, J., 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."},{"unstructured":"Lacoste-Julien, S., Schmidt, M., Bach, F.: A simpler approach to obtaining an $${\\cal{O}}(1\/t)$$ convergence rate for projected stochastic subgradient descent. arXiv:1212.2002 (2012)","key":"1821_CR9"},{"issue":"1","key":"1821_CR10","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10107-010-0434-y","volume":"133","author":"G Lan","year":"2012","unstructured":"Lan, G.: An optimal method for stochastic composite optimization. Math. Program. 133(1), 365\u2013397 (2012)","journal-title":"Math. Program."},{"unstructured":"Moulines, E., Bach, F.: Non-asymptotic analysis of stochastic approximation algorithms for machine learning. In: Shawe-Taylor, J., Zemel, R., Bartlett, P., Pereira, F., Weinberger, K.Q. (eds.) Advances in Neural Information Processing Systems, vol. 24. Curran Associates, Inc. (2011)","key":"1821_CR11"},{"issue":"1","key":"1821_CR12","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10107-018-1232-1","volume":"175","author":"I Necoara","year":"2019","unstructured":"Necoara, I., Nesterov, Yu., Glineur, F.: Linear convergence of first order methods for non-strongly convex optimization. Math. Program. 175(1), 69\u2013107 (2019)","journal-title":"Math. Program."},{"issue":"4","key":"1821_CR13","doi-asserted-by":"publisher","first-page":"2814","DOI":"10.1137\/18M1167061","volume":"29","author":"I Necoara","year":"2019","unstructured":"Necoara, I., Richtarik, P., Patrascu, A.: Randomized projection methods for convex feasibility problems: conditioning and convergence rates. SIAM J. Optim. 29(4), 2814\u20132852 (2019)","journal-title":"SIAM J. Optim."},{"issue":"5","key":"1821_CR14","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1016\/j.jprocont.2010.12.010","volume":"21","author":"I Necoara","year":"2011","unstructured":"Necoara, I., Nedelcu, V., Dumitrache, I.: Parallel and distributed optimization methods for estimation and control in networks. J. Process Control 21(5), 756\u2013766 (2011)","journal-title":"J. Process Control"},{"issue":"5","key":"1821_CR15","doi-asserted-by":"publisher","first-page":"3109","DOI":"10.1137\/120897547","volume":"52","author":"V Nedelcu","year":"2014","unstructured":"Nedelcu, V., Necoara, I., Tran Dinh, Q.: Computational complexity of inexact gradient augmented lagrangian methods: application to constrained MPC. SIAM J. Control Optim. 52(5), 3109\u20133134 (2014)","journal-title":"SIAM J. Control Optim."},{"issue":"3","key":"1821_CR16","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1007\/s00245-019-09609-7","volume":"8","author":"A Nedich","year":"2019","unstructured":"Nedich, A., Necoara, I.: Random minibatch projection algorithms for convex problems with functional constraints. Appl. Math. Optim. 8(3), 801\u2013833 (2019)","journal-title":"Appl. Math. Optim."},{"key":"1821_CR17","first-page":"263","volume-title":"Stochastic optimization: algorithms and applications","author":"A Nedich","year":"2000","unstructured":"Nedich, A., Bertsekas, D.: Convergence rate of incremental subgradient algorithms. In: Uryasev, S., Pardalos, P. (eds.) Stochastic optimization: algorithms and applications, pp. 263\u2013304. Springer, Berlin (2000)"},{"issue":"4","key":"1821_CR18","doi-asserted-by":"publisher","first-page":"1574","DOI":"10.1137\/070704277","volume":"19","author":"A Nemirovski","year":"2009","unstructured":"Nemirovski, A., Juditsky, A., Lan, G., Shapiro, A.: Robust stochastic approximation approach to stochastic programming. SIAM J. Optim. 19(4), 1574\u20131609 (2009)","journal-title":"SIAM J. Optim."},{"key":"1821_CR19","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. Kluwer, Boston (2004)"},{"issue":"198","key":"1821_CR20","first-page":"1","volume":"18","author":"A Patrascu","year":"2018","unstructured":"Patrascu, A., Necoara, I.: Nonasymptotic convergence of stochastic proximal point algorithms for constrained convex optimization. J. Mach. Learn. Res. 18(198), 1\u201342 (2018)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"1821_CR21","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/0041-5553(69)90061-5","volume":"9","author":"B Polyak","year":"1969","unstructured":"Polyak, B.: Minimization of unsmooth functionals. Comput. Math. Math. Phys. 9(3), 14\u201329 (1969)","journal-title":"Comput. Math. Math. Phys."},{"unstructured":"Polyak, B.: Introduction to optimization. Optimization Software. Optimization Software, Inc., New York (1987)","key":"1821_CR22"},{"doi-asserted-by":"publisher","unstructured":"Rosasco, L., Villa, S., Vu, B.C.: Convergence of stochastic proximal gradient algorithm. Appl. Math. Optim. https:\/\/doi.org\/10.1007\/s00245-019-09617-7 (2019)","key":"1821_CR23","DOI":"10.1007\/s00245-019-09617-7"},{"unstructured":"Ryu, E., Boyd, S.: Stochastic proximal iteration: a non-asymptotic improvement upon stochastic gradient descent. http:\/\/web.stanford.edu\/~eryu\/ (2016)","key":"1821_CR24"},{"unstructured":"Schmidt, M., Le Roux, N.: Fast convergence of stochastic gradient descent under a strong growth condition. arXiv:1308.6370 (2013)","key":"1821_CR25"},{"unstructured":"Schmidt, M., Le Roux, N., Bach, F.: Convergence rates of inexact proximal-gradient methods for convex optimization. In: Shawe-Taylor, J., Zemel, R., Bartlett, P., Pereira, F., Weinberger, K.Q. (eds.) Advances in Neural Information Processing Systems, vol. 24. Curran Associates, Inc. (2011)","key":"1821_CR26"},{"unstructured":"Toulis, P., Tran, D., Airoldi, E.M.: Towards stability and optimality in stochastic gradient descent. In: International conference on artificial intelligence and statistics (2016)","key":"1821_CR27"},{"doi-asserted-by":"crossref","unstructured":"Tibshirani, R.: The solution path of the generalized Lasso. Ph.d. Thesis, Stanford University (2011)","key":"1821_CR28","DOI":"10.1214\/11-AOS878"},{"issue":"6","key":"1821_CR29","first-page":"1","volume":"19","author":"T Yang","year":"2018","unstructured":"Yang, T., Lin, Q.: RSG: Beating subgradient method without smoothness and strong convexity. J. Mach. Learn. Res. 19(6), 1\u201333 (2018)","journal-title":"J. Mach. Learn. Res."},{"issue":"4","key":"1821_CR30","doi-asserted-by":"publisher","first-page":"2057","DOI":"10.1137\/140961791","volume":"24","author":"L Xiao","year":"2015","unstructured":"Xiao, L., Zhang, T.: A proximal stochastic gradient method with progressive variance reduction. SIAM J. Optim. 24(4), 2057\u20132075 (2015)","journal-title":"SIAM J. Optim."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-021-01821-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-021-01821-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-021-01821-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,31]],"date-time":"2021-03-31T20:13:53Z","timestamp":1617221633000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-021-01821-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,22]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["1821"],"URL":"https:\/\/doi.org\/10.1007\/s10957-021-01821-2","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2021,2,22]]},"assertion":[{"value":"8 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 January 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}