{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T04:50:18Z","timestamp":1773809418715,"version":"3.50.1"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,4,11]],"date-time":"2021-04-11T00:00:00Z","timestamp":1618099200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,11]],"date-time":"2021-04-11T00:00:00Z","timestamp":1618099200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1007\/s10107-020-01602-1","type":"journal-article","created":{"date-parts":[[2021,4,11]],"date-time":"2021-04-11T07:02:44Z","timestamp":1618124564000},"page":"225-269","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Parallel random block-coordinate forward\u2013backward algorithm: a unified convergence analysis"],"prefix":"10.1007","volume":"193","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0494-9101","authenticated-orcid":false,"given":"Saverio","family":"Salzo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Silvia","family":"Villa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,4,11]]},"reference":[{"key":"1602_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48311-5","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces, 2nd edn. Springer, New York (2017)","edition":"2"},{"issue":"4","key":"1602_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 the block coordinate descent type methods. SIAM J. Optim. 23(4), 2037\u20132060 (2013)","journal-title":"SIAM J. Optim."},{"key":"1602_CR3","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10107-011-0472-0","volume":"129","author":"DP Bertsekas","year":"2011","unstructured":"Bertsekas, D.P.: Incremental proximal methods for large scale convex optimization. Math. Program. Ser. B 129, 163 (2011)","journal-title":"Math. Program. Ser. B"},{"issue":"2","key":"1602_CR4","doi-asserted-by":"publisher","first-page":"1121","DOI":"10.1137\/140971233","volume":"25","author":"PL Combettes","year":"2015","unstructured":"Combettes, P.L., Pesquet, J.-C.: Stochastic quasi-Fej\u00e9r block-coordinate fixed point iterations with random sweeping. SIAM J. Optim. 25(2), 1121\u20131248 (2015)","journal-title":"SIAM J. Optim."},{"key":"1602_CR5","first-page":"1","volume":"174","author":"PL Combettes","year":"2018","unstructured":"Combettes, P.L., Pesquet, J.-C.: Stochastic quasi-Fej\u00e9r block-coordinate fixed point iterations with random sweeping II: mean-square and linear convergence. Math. Program. Ser. B 174, 1\u201319 (2018)","journal-title":"Math. Program. Ser. B"},{"key":"1602_CR6","doi-asserted-by":"publisher","first-page":"1168","DOI":"10.1137\/050626090","volume":"4","author":"PL Combettes","year":"2005","unstructured":"Combettes, P.L., Wajs, V.R.: Signal recovery by proximal forward\u2013backward splitting. Multiscale Model. Simul. 4, 1168\u20131200 (2005)","journal-title":"Multiscale Model. Simul."},{"key":"1602_CR7","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-319-41589-5_4","volume-title":"Splitting Methods in Communication, Imaging, Science, and Engineering","author":"D Davis","year":"2016","unstructured":"Davis, D., Yin, Y.: Convergence rate analysis of several splitting schemes. In: Glowinski, R., Osher, S.J., Yin, W. (eds.) Splitting Methods in Communication, Imaging, Science, and Engineering, pp. 115\u2013163. Springer, Cham (2016)"},{"key":"1602_CR8","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1287\/moor.2017.0889","volume":"43","author":"D Drusvyatskiy","year":"2018","unstructured":"Drusvyatskiy, D., Lewis, A.S.: Error bounds, quadratic growth, and linear convergence of proximal methods. Math. Oper. Res. 43, 919\u2013948 (2018)","journal-title":"Math. Oper. Res."},{"key":"1602_CR9","first-page":"783","volume":"48","author":"C D\u00fcnner","year":"2016","unstructured":"D\u00fcnner, C., Forte, S., Tak\u00e0\u010d, M., Jaggi, M.: Primal\u2013dual rates and certificates. Int. Conf. Mach. Learn. PMLR 48, 783\u2013792 (2016)","journal-title":"Int. Conf. Mach. Learn. PMLR"},{"key":"1602_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511779398","volume-title":"Probability, Theory and Examples","author":"R Durrett","year":"2010","unstructured":"Durrett, R.: Probability, Theory and Examples, 4th edn. Cambridge University Press, New York (2010)","edition":"4"},{"key":"1602_CR11","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/BF01071091","volume":"5","author":"YM Ermol\u2019ev","year":"1969","unstructured":"Ermol\u2019ev, Y.M.: On the method of generalized stochastic gradients and quasi-Fej\u00e9r sequences. Cybernetics 5, 208\u2013220 (1969)","journal-title":"Cybernetics"},{"key":"1602_CR12","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1137\/18M1168480","volume":"29","author":"O Fercoq","year":"2019","unstructured":"Fercoq, O., Bianchi, P.: A coordinate-descent primal\u2013dual algorithm with large step size and possibly nonseparable functions. SIAM J. Optim. 29, 100\u2013134 (2019)","journal-title":"SIAM J. Optim."},{"key":"1602_CR13","doi-asserted-by":"publisher","first-page":"1997","DOI":"10.1137\/130949993","volume":"25","author":"O Fercoq","year":"2015","unstructured":"Fercoq, O., Richt\u00e0rik, P.: Accelerated, parallel, and proximal coordinate descent. SIAM J. Optim. 25, 1997\u20132023 (2015)","journal-title":"SIAM J. Optim."},{"key":"1602_CR14","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10589-019-00137-2","volume":"75","author":"O Fercoq","year":"2020","unstructured":"Fercoq, O., Qu, Z.: Restarting the accelerated coordinate descent method with a rough strong convexity estimate. Comput. Optim. Appl. 75, 63\u201391 (2020)","journal-title":"Comput. Optim. Appl."},{"key":"1602_CR15","unstructured":"Garrigos, G., Rosasco, L., Villa, S.: Convergence of the forward\u2013backward algorithm: beyond the worst-case with the help of geometry. arXiv:1703.09477 (2017)"},{"key":"1602_CR16","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1007\/978-3-319-46128-1_50","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"H Karimi","year":"2016","unstructured":"Karimi, H., Nutini, J., Schmidt, M.: Linear convergence of gradient and proximal-gradient methods under the Polyak\u2013\u0141ojasiewicz condition. In: Frasconi, P., Landwehr, N., Manco, G., Vreeken, J. (eds.) Machine Learning and Knowledge Discovery in Databases, pp. 795\u2013811. Springer, Cham (2016)"},{"key":"1602_CR17","volume-title":"Infinite Sequences and Series","author":"K Knopp","year":"1956","unstructured":"Knopp, K.: Infinite Sequences and Series. Dover Publications Inc, New York (1956)"},{"key":"1602_CR18","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1137\/S1052623400376366","volume":"14","author":"KK Kiwiel","year":"2006","unstructured":"Kiwiel, K.K.: Convergence of approximate and incremental subgradient methods for convex optimization. SIAM J. Optim. 14, 807\u2013840 (2006)","journal-title":"SIAM J. Optim."},{"key":"1602_CR19","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1287\/moor.1100.0456","volume":"35","author":"D Leventhal","year":"2010","unstructured":"Leventhal, D., Lewis, A.S.: Randomized method for linear constraints: convergence rates and conditioning. Math. Oper. Res. 35, 641\u2013654 (2010)","journal-title":"Math. Oper. Res."},{"key":"1602_CR20","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s10589-017-9962-1","volume":"71","author":"J Lin","year":"2018","unstructured":"Lin, J., Rosasco, L., Villa, S., Zhou, D.-X.: Modified Fej\u00e9r sequences and applications. Comput. Optim. Appl. 71, 95\u2013113 (2018)","journal-title":"Comput. Optim. Appl."},{"key":"1602_CR21","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. Ser. A 152, 615\u2013642 (2015)","journal-title":"Math. Program. Ser. A"},{"key":"1602_CR22","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02096261","volume":"46","author":"Z-Q Luo","year":"1993","unstructured":"Luo, Z.-Q., Tseng, P.: Error bounds and convergence analysis of feasible descent methods: a general approach. Ann. Oper. Res. 46, 157\u2013178 (1993)","journal-title":"Ann. Oper. Res."},{"key":"1602_CR23","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1137\/130950288","volume":"26","author":"I Necoara","year":"2016","unstructured":"Necoara, I., Clipici, D.: Parallel random coordinate descent method for composite minimization: convergence analysis and error bounds. SIAM J. Optim. 26, 197\u2013226 (2016)","journal-title":"SIAM J. Optim."},{"key":"1602_CR24","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s10957-016-1058-z","volume":"173","author":"I Necoara","year":"2017","unstructured":"Necoara, I., Nesterov, Y., Glineur, F.: Random block coordinate descent methods for linearly constrained optimization over networks. J. Optim. Theory Appl. 173, 227\u2013254 (2017)","journal-title":"J. Optim. Theory Appl."},{"key":"1602_CR25","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, Y., Glineur, F.: Linear convergence of first order methods for non-strongly convex optimization. Math. Program. 175, 69\u2013107 (2019)","journal-title":"Math. Program."},{"key":"1602_CR26","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, 1574\u20131609 (2009)","journal-title":"SIAM J. Optim."},{"key":"1602_CR27","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 Academic Publishers, Boston (2004)"},{"key":"1602_CR28","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, 341\u2013362 (2012)","journal-title":"SIAM J. Optim."},{"key":"1602_CR29","first-page":"865","volume":"28","author":"Z Qu","year":"2015","unstructured":"Qu, Z., Richt\u00e0rik, P., Zhang, T.: Quartz: randomized dual coordinate ascent with arbitrary sampling. Adv. Neural Inform. Process. Syst. 28, 865\u2013873 (2015)","journal-title":"Adv. Neural Inform. Process. Syst."},{"key":"1602_CR30","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1080\/10556788.2016.1190360","volume":"31","author":"Z Qu","year":"2016","unstructured":"Qu, Z., Richt\u00e0rik, P.: Coordinate descent with arbitrary sampling I: algorithms and complexity. Optim. Method Softw. 31, 829\u2013857 (2016)","journal-title":"Optim. Method Softw."},{"key":"1602_CR31","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1080\/10556788.2016.1190361","volume":"31","author":"Z Qu","year":"2016","unstructured":"Qu, Z., Richt\u00e0rik, P.: Coordinate descent with arbitrary sampling II: expected separable over approximation. Optim. Methods Softw. 31, 858\u2013884 (2016)","journal-title":"Optim. Methods Softw."},{"key":"1602_CR32","first-page":"1","volume":"17","author":"P Richt\u00e0rik","year":"2016","unstructured":"Richt\u00e0rik, P., Tak\u00e0\u010d, M.: Distributed coordinate descent method for learning with big data. J. Mach. Learn. Res. 17, 1\u201325 (2016)","journal-title":"J. Mach. Learn. Res."},{"key":"1602_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-012-0614-z","volume":"144","author":"P Richt\u00e0rik","year":"2014","unstructured":"Richt\u00e0rik, P., Tak\u00e0\u010d, M.: Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function. Math. Program. Ser. A 144, 1\u201338 (2014)","journal-title":"Math. Program. Ser. A"},{"key":"1602_CR34","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/s10107-015-0901-6","volume":"156","author":"P Richt\u00e0rik","year":"2016","unstructured":"Richt\u00e0rik, P., Tak\u00e0\u010d, M.: Parallel coordinate descent methods for big data optimization. Math. Program. Ser. A 156, 156\u2013484 (2016)","journal-title":"Math. Program. Ser. A"},{"key":"1602_CR35","doi-asserted-by":"publisher","first-page":"1233","DOI":"10.1007\/s11590-015-0916-1","volume":"10","author":"P Richt\u00e0rik","year":"2016","unstructured":"Richt\u00e0rik, P., Tak\u00e0\u010d, M.: On optimal probabilities in stochastic coordinate descent methods. Optim. Lett. 10, 1233\u20131243 (2016)","journal-title":"Optim. Lett."},{"key":"1602_CR36","doi-asserted-by":"publisher","first-page":"2153","DOI":"10.1137\/16M1073741","volume":"27","author":"S Salzo","year":"2017","unstructured":"Salzo, S.: The variable metric forward\u2013backward splitting algorithm under mild differentiability assumptions. SIAM J. Optim. 27, 2153\u20132181 (2017)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1602_CR37","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(2), 262\u2013278 (2009)","journal-title":"J. Fourier Anal. Appl."},{"key":"1602_CR38","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1080\/10556788.2017.1392517","volume":"33","author":"R Tappenden","year":"2018","unstructured":"Tappenden, R., Tak\u00e0\u010d, M., Richt\u00e0rik, P.: On the complexity of parallel coordinate descent. Optim. Methods Softw. 33, 373\u2013395 (2018)","journal-title":"Optim. Methods Softw."},{"key":"1602_CR39","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10107-016-1009-3","volume":"161","author":"AB Taylor","year":"2017","unstructured":"Taylor, A.B., Hendrickx, J.M., Glineur, F.: Smooth strongly convex interpolation and exact worst-case performance of first-order methods. Math. Program. 161, 307\u2013345 (2017)","journal-title":"Math. Program."},{"key":"1602_CR40","first-page":"1523","volume":"15","author":"P-W Wang","year":"2014","unstructured":"Wang, P.-W., Lin, C.-J.: Iteration complexity of feasible descent methods for convex optimization. J. Mach. Learn. Res. 15, 1523\u20131548 (2014)","journal-title":"J. Mach. Learn. Res."},{"key":"1602_CR41","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-015-0892-3","volume":"151","author":"S Wright","year":"2015","unstructured":"Wright, S.: Coordinate descent algorithms. Math. Program. Ser. B 151, 3\u201334 (2015)","journal-title":"Math. Program. Ser. B"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-020-01602-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-020-01602-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-020-01602-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T18:13:18Z","timestamp":1650910398000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-020-01602-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,11]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["1602"],"URL":"https:\/\/doi.org\/10.1007\/s10107-020-01602-1","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,11]]},"assertion":[{"value":"15 June 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 April 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}