{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:53:01Z","timestamp":1786981981538,"version":"3.56.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,1,25]],"date-time":"2021-01-25T00:00:00Z","timestamp":1611532800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,25]],"date-time":"2021-01-25T00:00:00Z","timestamp":1611532800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Romanian Ministry of Education and Research, CNCS - UEFISCDI","award":["PN-III-P1-1.1-PD-2019-1123, within PNCDI III"],"award-info":[{"award-number":["PN-III-P1-1.1-PD-2019-1123, within PNCDI III"]}]},{"name":"Romanian Ministry of Education and Research, CNCS - UEFISCDI","award":["PN-III-P1-1.1-PD-2019-0825, within PNCDI III"],"award-info":[{"award-number":["PN-III-P1-1.1-PD-2019-0825, within PNCDI III"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1007\/s11590-021-01702-7","type":"journal-article","created":{"date-parts":[[2021,1,25]],"date-time":"2021-01-25T03:05:19Z","timestamp":1611543919000},"page":"2255-2273","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Stochastic proximal splitting algorithm for composite minimization"],"prefix":"10.1007","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9293-9386","authenticated-orcid":false,"given":"Andrei","family":"Patrascu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paul","family":"Irofti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,1,25]]},"reference":[{"issue":"3","key":"1702_CR1","doi-asserted-by":"publisher","first-page":"2257","DOI":"10.1137\/18M1230323","volume":"29","author":"H Asi","year":"2019","unstructured":"Asi, H., Duchi, J.C.: Stochastic (approximate) proximal point methods: convergence, optimality, and adaptivity. SIAM J. Optim. 29(3), 2257\u20132290 (2019)","journal-title":"SIAM J. Optim."},{"issue":"9","key":"1702_CR2","doi-asserted-by":"publisher","first-page":"3433","DOI":"10.1090\/S0002-9947-03-03136-2","volume":"355","author":"H Bauschke","year":"2003","unstructured":"Bauschke, H., Deutsch, F., Hundal, H., Park, S.-H.: Accelerating the convergence of the method of alternating projections. Trans. Am. Math. Soc. 355(9), 3433\u20133461 (2003)","journal-title":"Trans. Am. Math. Soc."},{"issue":"1","key":"1702_CR3","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s101070050083","volume":"86","author":"HH Bauschke","year":"1999","unstructured":"Bauschke, H.H., Borwein, J.M., Li, Wu: Strong conical hull intersection property, bounded linear regularity, jameson\u2019s property (g), and error bounds in convex optimization. Math. Program. 86(1), 135\u2013160 (1999)","journal-title":"Math. Program."},{"issue":"1","key":"1702_CR4","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."},{"issue":"4","key":"1702_CR5","doi-asserted-by":"publisher","first-page":"2235","DOI":"10.1137\/15M1017909","volume":"26","author":"P Bianchi","year":"2016","unstructured":"Bianchi, P.: Ergodic convergence of a stochastic proximal point algorithm. SIAM J. Optim. 26(4), 2235\u20132260 (2016)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1702_CR6","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1137\/18M1178244","volume":"29","author":"D Davis","year":"2019","unstructured":"Davis, D., Drusvyatskiy, D.: Stochastic model-based minimization of weakly convex functions. SIAM J. Optim. 29(1), 207\u2013239 (2019)","journal-title":"SIAM J. Optim."},{"key":"1702_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-7011-4","volume-title":"Sparse and redundant representations: from theory to applications in signal and image processing","author":"M Elad","year":"2010","unstructured":"Elad, M.: Sparse and redundant representations: from theory to applications in signal and image processing. Springer, New York (2010)"},{"key":"1702_CR8","doi-asserted-by":"crossref","unstructured":"Hallac, D., Leskovec, J., Boyd, S.: Network lasso: clustering and optimization in large graphs. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 387\u2013396 (2015)","DOI":"10.1145\/2783258.2783313"},{"issue":"3","key":"1702_CR9","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1109\/TAC.2012.2215413","volume":"58","author":"J Koshal","year":"2012","unstructured":"Koshal, J., Nedic, A., Shanbhag, U.V.: Regularized iterative stochastic approximation methods for stochastic variational inequality problems. IEEE Trans. Autom. Control 58(3), 594\u2013609 (2012)","journal-title":"IEEE Trans. Autom. Control"},{"key":"1702_CR10","unstructured":"Moulines, E., Bach, F.R.: Non-asymptotic analysis of stochastic approximation algorithms for machine learning. In: Advances in Neural Information Processing Systems, pp. 451\u2013459 (2011)"},{"key":"1702_CR11","doi-asserted-by":"crossref","unstructured":"Nedi\u0107, A.: Random projection algorithms for convex set intersection problems. In: 49th IEEE Conference on Decision and Control (CDC), pp. 7655\u20137660. IEEE (2010)","DOI":"10.1109\/CDC.2010.5717734"},{"issue":"2","key":"1702_CR12","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10107-011-0468-9","volume":"129","author":"A Nedi\u0107","year":"2011","unstructured":"Nedi\u0107, A.: Random algorithms for convex minimization problems. Math. Program. 129(2), 225\u2013253 (2011)","journal-title":"Math. Program."},{"issue":"4","key":"1702_CR13","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."},{"issue":"1","key":"1702_CR14","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), 125\u2013161 (2013)","journal-title":"Math. Program."},{"key":"1702_CR15","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course, vol. 87. Springer, US (2013)"},{"key":"1702_CR16","unstructured":"Nguyen, L.M., Nguyen, P.H., van Dijk, M., Richt\u00e1rik, P., Scheinberg, K., Tak\u00e1\u010d, M.: Sgd and hogwild! convergence without the bounded gradients assumption. arXiv preprint arXiv:1802.03801 (2018)"},{"key":"1702_CR17","doi-asserted-by":"crossref","unstructured":"P\u0103tra\u015fcu, A.: New nonasymptotic convergence rates of stochastic proximal point algorithm for stochastic convex optimization. Optimization, 1\u201329 (2020)","DOI":"10.1080\/02331934.2020.1761364"},{"issue":"1","key":"1702_CR18","first-page":"7204","volume":"18","author":"A Patrascu","year":"2017","unstructured":"Patrascu, A., Necoara, I.: Nonasymptotic convergence of stochastic proximal point methods for constrained convex optimization. J. Mach. Learn. Res. 18(1), 7204\u20137245 (2017)","journal-title":"J. Mach. Learn. Res."},{"key":"1702_CR19","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"2009","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis, vol. 317. Springer, Berlin (2009)"},{"key":"1702_CR20","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1988","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton, New Jersey (1988)"},{"issue":"1","key":"1702_CR21","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1080\/17442508208833217","volume":"7","author":"RT Rockafellar","year":"1982","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: On the interchange of subdifferentiation and conditional expectation for convex functionals. Stochastics 7(1), 173\u2013182 (1982)","journal-title":"Stochastics"},{"key":"1702_CR22","first-page":"1","volume":"82","author":"L Rosasco","year":"2019","unstructured":"Rosasco, L., Villa, S., V\u0169, B.C.: Convergence of stochastic proximal gradient algorithm. Appl. Math. Optim. 82, 1\u201327 (2019)","journal-title":"Appl. Math. Optim."},{"key":"1702_CR23","unstructured":"Ryu, E.K., Boyd, S.: Stochastic proximal iteration: a non-asymptotic improvement upon stochastic gradient descent. Author website, early draft (2016)"},{"issue":"5","key":"1702_CR24","doi-asserted-by":"publisher","first-page":"1832","DOI":"10.1109\/TAC.2019.2890888","volume":"64","author":"A Salim","year":"2019","unstructured":"Salim, A., Bianchi, P., Hachem, W.: Snake: a stochastic proximal gradient algorithm for regularized problems over large graphs. IEEE Trans. Autom. Control 64(5), 1832\u20131847 (2019)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"1","key":"1702_CR25","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-010-0420-4","volume":"127","author":"S Shalev-Shwartz","year":"2011","unstructured":"Shalev-Shwartz, S., Singer, Y., Srebro, N., Cotter, A.: Pegasos: primal estimated sub-gradient solver for svm. Math. Program. 127(1), 3\u201330 (2011)","journal-title":"Math. Program."},{"issue":"22","key":"1702_CR26","doi-asserted-by":"publisher","first-page":"6013","DOI":"10.1109\/TSP.2015.2461520","volume":"63","author":"W Shi","year":"2015","unstructured":"Shi, W., Ling, Q., Gang, W., Yin, W.: A proximal gradient algorithm for decentralized composite optimization. IEEE Trans. Signal Process. 63(22), 6013\u20136023 (2015)","journal-title":"IEEE Trans. Signal Process."},{"issue":"7","key":"1702_CR27","doi-asserted-by":"publisher","first-page":"131","DOI":"10.3390\/a12070131","volume":"12","author":"F Stoican","year":"2019","unstructured":"Stoican, F., Irofti, P.: Aiding dictionary learning through multi-parametric sparse representation. Algorithms 12(7), 131 (2019)","journal-title":"Algorithms"},{"key":"1702_CR28","unstructured":"Toulis, P., Tran, D., Airoldi, E.: Towards stability and optimality in stochastic gradient descent. In: Artificial Intelligence and Statistics, pp. 1290\u20131298 (2016)"},{"key":"1702_CR29","unstructured":"Varma, R., Lee, H., Kovacevic, J., Chi, Y.: Vector-valued graph trend filtering with non-convex penalties. IEEE Trans. Signal Inf. Process. Over Netw. 6, 48\u201362 (2019)"},{"issue":"1","key":"1702_CR30","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1137\/130931278","volume":"26","author":"M Wang","year":"2016","unstructured":"Wang, M., Bertsekas, D.P.: Stochastic first-order methods with random constraint projection. SIAM J. Optim. 26(1), 681\u2013717 (2016)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1702_CR31","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/s10589-017-9932-7","volume":"68","author":"X Wang","year":"2017","unstructured":"Wang, X., Wang, S., Zhang, H.: Inexact proximal stochastic gradient method for convex composite optimization. Comput. Optim. Appl. 68(3), 579\u2013618 (2017)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"1702_CR32","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1109\/TSIPN.2016.2605763","volume":"2","author":"Y Yankelevsky","year":"2016","unstructured":"Yankelevsky, Y., Elad, M.: Dual graph regularized dictionary learning. IEEE Trans. Signal Inf. Process. Over Netw. 2(4), 611\u2013624 (2016)","journal-title":"IEEE Trans. Signal Inf. Process. Over Netw."},{"key":"1702_CR33","unstructured":"Zhong, W., Kwok, J.: Accelerated stochastic gradient method for composite regularization. In: Artificial Intelligence and Statistics, pp. 1086\u20131094 (2014)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01702-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-021-01702-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01702-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,12]],"date-time":"2022-12-12T23:41:33Z","timestamp":1670888493000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-021-01702-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,25]]},"references-count":33,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["1702"],"URL":"https:\/\/doi.org\/10.1007\/s11590-021-01702-7","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,25]]},"assertion":[{"value":"3 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 January 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 January 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}