{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T01:49:35Z","timestamp":1784598575482,"version":"3.55.0"},"reference-count":80,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T00:00:00Z","timestamp":1657670400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T00:00:00Z","timestamp":1657670400000},"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":["J Optim Theory Appl"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s10957-022-02061-8","type":"journal-article","created":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T14:03:57Z","timestamp":1657721037000},"page":"102-130","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Dualize, Split, Randomize: Toward Fast Nonsmooth Optimization Algorithms"],"prefix":"10.1007","volume":"195","author":[{"given":"Adil","family":"Salim","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7087-1002","authenticated-orcid":false,"given":"Laurent","family":"Condat","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Konstantin","family":"Mishchenko","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"Richt\u00e1rik","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,7,13]]},"reference":[{"issue":"6","key":"2061_CR1","doi-asserted-by":"publisher","first-page":"2787","DOI":"10.1109\/TAC.2020.3009363","volume":"66","author":"SA Alghunaim","year":"2021","unstructured":"Alghunaim, S.A., Ryu, E.K., Yuan, K., Sayed, A.H.: Decentralized proximal gradient algorithms with linear convergence rates. IEEE Trans. Autom. Control 66(6), 2787\u20132794 (2021)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"4","key":"2061_CR2","doi-asserted-by":"publisher","first-page":"2076","DOI":"10.1137\/130950616","volume":"24","author":"A Alotaibi","year":"2014","unstructured":"Alotaibi, A., Combettes, P.L., Shahzad, N.: Solving coupled composite monotone inclusions by successive Fej\u00e9r approximations of their Kuhn-Tucker set. SIAM J. Optim. 24(4), 2076\u20132095 (2014)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2061_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000015","volume":"4","author":"F Bach","year":"2012","unstructured":"Bach, F., Jenatton, R., Mairal, J., Obozinski, G.: Optimization with sparsity-inducing penalties. Found. Trends Mach. Learn. 4(1), 1\u2013106 (2012)","journal-title":"Found. Trends Mach. Learn."},{"issue":"1","key":"2061_CR4","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1109\/JSAIT.2020.2985917","volume":"1","author":"D Basu","year":"2020","unstructured":"Basu, D., Data, D., Karakus, C., Diggavi, S.N.: Qsparse-Local-SGD: distributed SGD with quantization, sparsification, and local computations. IEEE J. Select. Areas Inform. Theor. 1(1), 217\u2013226 (2020)","journal-title":"IEEE J. Select. Areas Inform. Theor."},{"key":"2061_CR5","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"},{"key":"2061_CR6","doi-asserted-by":"crossref","unstructured":"Beck, A.: First-Order Methods in Optimization. SIAM, MOS-SIAM Series on Optimization (2017)","DOI":"10.1137\/1.9781611974997"},{"key":"2061_CR7","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/978-1-4939-1124-0_3","volume-title":"Mathematics Without Boundaries: Surveys in Interdisciplinary Research","author":"RI Bo\u0163","year":"2014","unstructured":"Bo\u0163, R.I., Csetnek, E.R., Hendrich, C.: Recent developments on primal-dual splitting methods with applications to convex minimization. In: Pardalos, P.M., Rassias, T.M. (eds.) Mathematics Without Boundaries: Surveys in Interdisciplinary Research, pp. 57\u201399. Springer, New York (2014)"},{"issue":"1","key":"2061_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S Boyd","year":"2011","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 (2011)","journal-title":"Found. Trends Mach. Learn."},{"key":"2061_CR9","doi-asserted-by":"crossref","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press (2004)","DOI":"10.1017\/CBO9780511804441"},{"issue":"3","key":"2061_CR10","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1137\/090769521","volume":"3","author":"K Bredies","year":"2010","unstructured":"Bredies, K., Kunisch, K., Pock, T.: Total generalized variation. SIAM J. Imaging Sci. 3(3), 492\u2013526 (2010)","journal-title":"SIAM J. Imaging Sci."},{"issue":"1","key":"2061_CR11","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/s10851-010-0251-1","volume":"40","author":"A Chambolle","year":"2011","unstructured":"Chambolle, A., Pock, T.: A first-order primal-dual algorithm for convex problems with applications to imaging. J. Math. Imaging Vis. 40(1), 120\u2013145 (2011)","journal-title":"J. Math. Imaging Vis."},{"key":"2061_CR12","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1017\/S096249291600009X","volume":"25","author":"A Chambolle","year":"2016","unstructured":"Chambolle, A., Pock, T.: An introduction to continuous optimization for imaging. Acta Numer. 25, 161\u2013319 (2016)","journal-title":"Acta Numer."},{"issue":"1\u20132","key":"2061_CR13","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s10107-015-0957-3","volume":"159","author":"A Chambolle","year":"2016","unstructured":"Chambolle, A., Pock, T.: On the ergodic convergence rates of a first-order primal-dual algorithm. Math. Program. 159(1\u20132), 253\u2013287 (2016)","journal-title":"Math. Program."},{"issue":"3","key":"2061_CR14","first-page":"27","volume":"2","author":"CC Chang","year":"2011","unstructured":"Chang, C.C., Lin, C.J.: LibSVM: a library for support vector machines. ACM Trans. Intell. Syst. Technol. (TIST) 2(3), 27 (2011)","journal-title":"ACM Trans. Intell. Syst. Technol. (TIST)"},{"issue":"2","key":"2061_CR15","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/29\/2\/025011","volume":"29","author":"P Chen","year":"2013","unstructured":"Chen, P., Huang, J., Zhang, X.: A primal-dual fixed point algorithm for convex separable minimization with applications to image restoration. Inverse Probl. 29(2), 025011 (2013)","journal-title":"Inverse Probl."},{"key":"2061_CR16","doi-asserted-by":"crossref","unstructured":"Combettes, P.L., Condat, L., Pesquet, J.C., V\u0169, B.C.: A forward\u2013backward view of some primal\u2013dual optimization methods in image recovery. In: Proc. of IEEE ICIP. Paris, France (2014)","DOI":"10.1109\/ICIP.2014.7025841"},{"issue":"1\u20132","key":"2061_CR17","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/s10107-016-1044-0","volume":"168","author":"PL Combettes","year":"2018","unstructured":"Combettes, P.L., Eckstein, J.: Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions. Math. Program. 168(1\u20132), 645\u2013672 (2018)","journal-title":"Math. Program."},{"issue":"4","key":"2061_CR18","doi-asserted-by":"publisher","first-page":"1905","DOI":"10.1137\/18M1224763","volume":"12","author":"PL Combettes","year":"2019","unstructured":"Combettes, P.L., Glaudin, L.E.: Proximal activation of smooth functions in splitting algorithms for convex image recovery. SIAM J. Imaging Sci. 12(4), 1905\u20131935 (2019)","journal-title":"SIAM J. Imaging Sci."},{"key":"2061_CR19","volume-title":"Fixed-Point Algorithms for Inverse Problems in Science and Engineering","author":"PL Combettes","year":"2010","unstructured":"Combettes, P.L., Pesquet, J.C.: Proximal splitting methods in signal processing. In: Bauschke, H.H., Burachik, R., Combettes, P.L., Elser, V., Luke, D.R., Wolkowicz, H. (eds.) Fixed-Point Algorithms for Inverse Problems in Science and Engineering. Springer-Verlag, New York (2010)"},{"issue":"2","key":"2061_CR20","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s11228-011-0191-y","volume":"20","author":"PL Combettes","year":"2012","unstructured":"Combettes, P.L., Pesquet, J.C.: Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators. Set-Val. Var. Anal. 20(2), 307\u2013330 (2012)","journal-title":"Set-Val. Var. Anal."},{"key":"2061_CR21","doi-asserted-by":"publisher","first-page":"3878","DOI":"10.1109\/TSP.2021.3069677","volume":"69","author":"PL Combettes","year":"2021","unstructured":"Combettes, P.L., Pesquet, J.C.: Fixed point strategies in data science. IEEE Trans. Signal Process. 69, 3878\u20133905 (2021)","journal-title":"IEEE Trans. Signal Process."},{"issue":"2","key":"2061_CR22","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/s10957-012-0245-9","volume":"158","author":"L Condat","year":"2013","unstructured":"Condat, L.: A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms. J. Optim. Theory Appl. 158(2), 460\u2013479 (2013)","journal-title":"J. Optim. Theory Appl."},{"issue":"8","key":"2061_CR23","first-page":"1054","volume":"21","author":"L Condat","year":"2014","unstructured":"Condat, L.: A generic proximal algorithm for convex optimization\u2013application to total variation minimization. IEEE Signal Process. Lett. 21(8), 1054\u20131057 (2014)","journal-title":"IEEE Signal Process. Lett."},{"issue":"3","key":"2061_CR24","doi-asserted-by":"publisher","first-page":"1258","DOI":"10.1137\/16M1075247","volume":"10","author":"L Condat","year":"2017","unstructured":"Condat, L.: Discrete total variation: new definition and minimization. SIAM J. Imaging Sci. 10(3), 1258\u20131290 (2017)","journal-title":"SIAM J. Imaging Sci."},{"key":"2061_CR25","doi-asserted-by":"crossref","unstructured":"Condat, L., Kitahara, D., Contreras, A., Hirabayashi, A.: Proximal splitting algorithms for convex optimization: a tour of recent advances, with new twists. SIAM Review . To appear (2022)","DOI":"10.1137\/20M1379344"},{"key":"2061_CR26","doi-asserted-by":"publisher","unstructured":"Condat, L., Malinovsky, G., Richt\u00e1rik, P.: Distributed proximal splitting algorithms with rates and acceleration. Front. Signal Process. (2022). https:\/\/doi.org\/10.3389\/frsip.2021.776825","DOI":"10.3389\/frsip.2021.776825"},{"issue":"3","key":"2061_CR27","doi-asserted-by":"publisher","first-page":"1246","DOI":"10.1137\/120895068","volume":"6","author":"C Couprie","year":"2013","unstructured":"Couprie, C., Grady, L., Najman, L., Pesquet, J.C., Talbot, H.: Dual constrained TV-based regularization on graphs. SIAM J. Imaging Sci. 6(3), 1246\u20131273 (2013)","journal-title":"SIAM J. Imaging Sci."},{"key":"2061_CR28","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1007\/s11228-017-0421-z","volume":"25","author":"D Davis","year":"2017","unstructured":"Davis, D., Yin, W.: A three-operator splitting scheme and its optimization applications. Set-Val. Var. Anal. 25, 829\u2013858 (2017)","journal-title":"Set-Val. Var. Anal."},{"key":"2061_CR29","unstructured":"Defazio, A., Bach, F., Lacoste-Julien, S.: Saga: A fast incremental gradient method with support for non-strongly convex composite objectives. In: Z.\u00a0Ghahramani, M.\u00a0Welling, C.\u00a0Cortes, N.\u00a0Lawrence, K.\u00a0Weinberger (eds.) Advances in Neural Information Processing Systems, vol.\u00a027. Curran Associates, Inc. (2014)"},{"issue":"2","key":"2061_CR30","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.orl.2015.02.001","volume":"43","author":"Y Drori","year":"2015","unstructured":"Drori, Y., Sabach, S., Teboulle, M.: A simple algorithm for a class of nonsmooth convex concave saddle-point problems. Oper. Res. Lett. 43(2), 209\u2013214 (2015)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"2061_CR31","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1137\/15M102873X","volume":"9","author":"J Duran","year":"2016","unstructured":"Duran, J., Moeller, M., Sbert, C., Cremers, D.: Collaborative total variation: A general framework for vectorial TV models. SIAM J. Imaging Sci. 9(1), 116\u2013151 (2016)","journal-title":"SIAM J. Imaging Sci."},{"key":"2061_CR32","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/BF01581204","volume":"55","author":"J Eckstein","year":"1992","unstructured":"Eckstein, J., Bertsekas, D.P.: On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators. Math. Program. 55, 293\u2013318 (1992)","journal-title":"Math. Program."},{"issue":"1","key":"2061_CR33","first-page":"173","volume":"111","author":"J Eckstein","year":"2008","unstructured":"Eckstein, J., Svaiter, B.F.: A family of projective splitting methods for the sum of two maximal monotone operators. Math. Program. 111(1), 173\u2013199 (2008)","journal-title":"Math. Program."},{"issue":"1","key":"2061_CR34","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0898-1221(76)90003-1","volume":"2","author":"D Gabay","year":"1976","unstructured":"Gabay, D., Mercier, B.: A dual algorithm for the solution of nonlinear variational problems via finite element approximation. Comput. Math. Appl. 2(1), 17\u201340 (1976)","journal-title":"Comput. Math. Appl."},{"key":"2061_CR35","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1051\/m2an\/197509R200411","volume":"9","author":"R Glowinski","year":"1975","unstructured":"Glowinski, R., Marrocco, A.: Sur l\u2019approximation par \u00e9l\u00e9ments finis d\u2019ordre un, et la r\u00e9solution par p\u00e9nalisation-dualit\u00e9 d\u2019une classe de probl\u00e8mes de Dirichlet non lin\u00e9aires. Revue Fran\u00e7aise d\u2019Automatique, Informatique et Recherche Op\u00e9rationnelle 9, 41\u201376 (1975)","journal-title":"Revue Fran\u00e7aise d\u2019Automatique, Informatique et Recherche Op\u00e9rationnelle"},{"key":"2061_CR36","unstructured":"Gorbunov, E., Hanzely, F., Richt\u00e1rik, P.: A unified theory of SGD: Variance reduction, sampling, quantization and coordinate descent. In: S.\u00a0Chiappa, R.\u00a0Calandra (eds.) Proc. of Int. Conf. Artif. Intell. Stat. (AISTATS), vol. PMLR 108, pp. 680\u2013690 (2020)"},{"key":"2061_CR37","unstructured":"Gower, R.M., Loizou, N., Qian, X., Sailanbayev, A., Shulgin, E., Richt\u00e1rik, P.: SGD: General analysis and improved rates. In: K.\u00a0Chaudhuri, R.\u00a0Salakhutdinov (eds.) Proc. of 36th Int. Conf. Machine Learning (ICML), vol. PMLR 97, pp. 5200\u20135209 (2019)"},{"issue":"11","key":"2061_CR38","doi-asserted-by":"publisher","first-page":"1968","DOI":"10.1109\/JPROC.2020.3028013","volume":"108","author":"RM Gower","year":"2020","unstructured":"Gower, R.M., Schmidt, M., Bach, F., Richt\u00e1rik, P.: Variance-reduced methods for machine learning. Proc. IEEE 108(11), 1968\u20131983 (2020)","journal-title":"Proc. IEEE"},{"key":"2061_CR39","unstructured":"Hofmann, T., Lucchi, A., Lacoste-Julien, S., McWilliams, B.: Variance reduced stochastic gradient descent with neighbors. In: C.\u00a0Cortes, N.\u00a0Lawrence, D.\u00a0Lee, M.\u00a0Sugiyama, R.\u00a0Garnett (eds.) Advances in Neural Information Processing Systems, vol.\u00a028, pp. 2305\u20132313. Curran Associates, Inc. (2015)"},{"key":"2061_CR40","unstructured":"Johnson, R., Zhang, T.: Accelerating stochastic gradient descent using predictive variance reduction. In: C.\u00a0Burges, L.\u00a0Bottou, M.\u00a0Welling, Z.\u00a0Ghahramani, K.\u00a0Weinberger (eds.) Advances in Neural Information Processing Systems, vol.\u00a026, pp. 315\u2013323. Curran Associates, Inc. (2013)"},{"issue":"3","key":"2061_CR41","doi-asserted-by":"publisher","first-page":"1931","DOI":"10.1137\/18M1203523","volume":"29","author":"PR Johnstone","year":"2019","unstructured":"Johnstone, P.R., Eckstein, J.: Convergence rates for projective splitting. SIAM J. Optim. 29(3), 1931\u20131957 (2019)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2061_CR42","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10589-020-00238-3","volume":"78","author":"PR Johnstone","year":"2021","unstructured":"Johnstone, P.R., Eckstein, J.: Single-forward-step projective splitting: exploiting cocoercivity. Comput. Optim. Appl. 78(1), 125\u2013166 (2021)","journal-title":"Comput. Optim. Appl."},{"key":"2061_CR43","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/s10107-020-01565-3","volume":"191","author":"PR Johnstone","year":"2022","unstructured":"Johnstone, P.R., Eckstein, J.: Projective splitting with forward steps. Math. Program. 191, 631\u2013670 (2022)","journal-title":"Math. Program."},{"issue":"6","key":"2061_CR44","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1109\/MSP.2014.2377273","volume":"32","author":"N Komodakis","year":"2015","unstructured":"Komodakis, N., Pesquet, J.C.: Playing with duality: an overview of recent primal-dual approaches for solving large-scale optimization problems. IEEE Signal Process. Mag. 32(6), 31\u201354 (2015)","journal-title":"IEEE Signal Process. Mag."},{"key":"2061_CR45","unstructured":"Kovalev, D., Horv\u00e1th, S., Richt\u00e1rik, P.: Don\u2019t jump through hoops and remove those loops: SVRG and Katyusha are better without the outer loop. In: A.\u00a0Kontorovich, G.\u00a0Neu (eds.) Proc. of Int. Conf. Algo. Learn. Theory (ALT), vol. PMLR 117, pp. 451\u2013467 (2020)"},{"key":"2061_CR46","unstructured":"Kovalev, D., Salim, A., Richt\u00e1rik, P.: Optimal and practical algorithms for smooth and strongly convex decentralized optimization. In: H.\u00a0Larochelle, M.\u00a0Ranzato, R.\u00a0Hadsell, M.\u00a0Balcan, H.\u00a0Lin (eds.) Advances in Neural Information Processing Systems, vol.\u00a033, pp. 18342\u201318352. Curran Associates, Inc. (2020)"},{"key":"2061_CR47","doi-asserted-by":"crossref","unstructured":"Lan, G.: First-order and Stochastic Optimization Methods for Machine Learning. Springer Cham (2020)","DOI":"10.1007\/978-3-030-39568-1"},{"key":"2061_CR48","unstructured":"LeCun, Y., Cortes, C.: MNIST handwritten digit database (2010). http:\/\/yann.lecun.com\/exdb\/mnist\/"},{"issue":"3","key":"2061_CR49","doi-asserted-by":"publisher","first-page":"1795","DOI":"10.1137\/18M122902X","volume":"30","author":"H Li","year":"2020","unstructured":"Li, H., Lin, Z.: Revisiting EXTRA for smooth distributed optimization. SIAM J. Optim. 30(3), 1795\u20131821 (2020)","journal-title":"SIAM J. Optim."},{"issue":"37","key":"2061_CR50","first-page":"50","volume":"3","author":"T Li","year":"2020","unstructured":"Li, T., Sahu, A.K., Talwalkar, A., Smith, V.: Federated learning: Challenges, methods, and future directions. IEEE Signal Process. Mag. 3(37), 50\u201360 (2020)","journal-title":"IEEE Signal Process. Mag."},{"issue":"6","key":"2061_CR51","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1137\/0716071","volume":"16","author":"PL Lions","year":"1979","unstructured":"Lions, P.L., Mercier, B.: Splitting algorithms for the sum of two nonlinear operators. SIAM J. Numer. Anal. 16(6), 964\u2013979 (1979)","journal-title":"SIAM J. Numer. Anal."},{"key":"2061_CR52","doi-asserted-by":"crossref","unstructured":"Loris, I., Verhoeven, C.: On a generalization of the iterative soft-thresholding algorithm for the case of non-separable penalty. Inverse Probl. 27(12) (2011)","DOI":"10.1088\/0266-5611\/27\/12\/125007"},{"issue":"1","key":"2061_CR53","first-page":"2165","volume":"17","author":"A Mokhtari","year":"2016","unstructured":"Mokhtari, A., Ribeiro, A.: DSA: Decentralized double stochastic averaging gradient algorithm. J. Mach. Learn. Res. 17(1), 2165\u20132199 (2016)","journal-title":"J. Mach. Learn. Res."},{"key":"2061_CR54","doi-asserted-by":"crossref","unstructured":"Nesterov, Y.: Lectures on Convex Optimization, vol. 137. Springer (2018)","DOI":"10.1007\/978-3-319-91578-4_2"},{"key":"2061_CR55","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s10107-018-1321-1","volume":"79","author":"D O\u2019Connor","year":"2020","unstructured":"O\u2019Connor, D., Vandenberghe, L.: On the equivalence of the primal-dual hybrid gradient method and Douglas-Rachford splitting. Math. Program. 79, 85\u2013108 (2020)","journal-title":"Math. Program."},{"key":"2061_CR56","doi-asserted-by":"crossref","unstructured":"Palomar, D.P., Eldar, Y.C. (eds.): Convex Optimization in Signal Processing and Communications. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511804458"},{"issue":"1","key":"2061_CR57","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1561\/2400000003","volume":"3","author":"N Parikh","year":"2014","unstructured":"Parikh, N., Boyd, S.: Proximal algorithms. Found. Trends Optim. 3(1), 127\u2013239 (2014)","journal-title":"Found. Trends Optim."},{"key":"2061_CR58","unstructured":"Pedregosa, F., Fatras, K., Casotto, M.: Proximal splitting meets variance reduction. In: K.\u00a0Chaudhuri, M.\u00a0Sugiyama (eds.) Proc. of Int. Conf. Artif. Intell. Stat. (AISTATS), vol. PMLR 89, pp. 1\u201310 (2019)"},{"issue":"4","key":"2061_CR59","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1214\/15-STS530","volume":"30","author":"NG Polson","year":"2015","unstructured":"Polson, N.G., Scott, J.G., Willard, B.T.: Proximal algorithms in statistics and machine learning. Statist. Sci. 30(4), 559\u2013581 (2015)","journal-title":"Statist. Sci."},{"issue":"12","key":"2061_CR60","doi-asserted-by":"publisher","first-page":"1827","DOI":"10.1109\/LSP.2017.2752261","volume":"24","author":"N Pustelnik","year":"2017","unstructured":"Pustelnik, N., Condat, L.: Proximity operator of a sum of functions; application to depth map estimation. IEEE Signal Process. Lett. 24(12), 1827\u20131831 (2017)","journal-title":"IEEE Signal Process. Lett."},{"issue":"1\u20134","key":"2061_CR61","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0167-2789(92)90242-F","volume":"60","author":"L Rudin","year":"1992","unstructured":"Rudin, L., Osher, S., Fatemi, E.: Nonlinear total variation based noise removal algorithms. Phys. D 60(1\u20134), 259\u2013268 (1992)","journal-title":"Phys. D"},{"key":"2061_CR62","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s10107-019-01403-1","volume":"182","author":"EK Ryu","year":"2020","unstructured":"Ryu, E.K.: Uniqueness of DRS as the 2 operator resolvent-splitting and impossibility of 3 operator resolvent-splitting. Math. Program. 182, 233\u2013273 (2020)","journal-title":"Math. Program."},{"key":"2061_CR63","doi-asserted-by":"crossref","unstructured":"Salim, A., Bianchi, P., Hachem, W.: Snake: a stochastic proximal gradient algorithm for regularized problems over large graphs. IEEE Trans. Automat. Contr. 64(5), 1832\u20131847 (2019)","DOI":"10.1109\/TAC.2019.2890888"},{"key":"2061_CR64","unstructured":"Salim, A., Condat, L., Kovalev, D., Richt\u00e1rik, P.: An optimal algorithm for strongly convex minimization under affine constraints. In: G.\u00a0Camps-Valls, F.J.R. Ruiz, I.\u00a0Valera (eds.) Proc. of Int. Conf. Artif. Intell. Stat. (AISTATS), vol. PMLR 151, pp. 4482\u20134498 (2022)"},{"key":"2061_CR65","doi-asserted-by":"crossref","unstructured":"Sattler, F., Wiedemann, S., K.-R. M\u00fcller, Samek, W.: Robust and communication-efficient federated learning from non-i.i.d. data. IEEE Trans. Neural Networks and Learning Systems 31(9), 3400\u20133413 (2020)","DOI":"10.1109\/TNNLS.2019.2944481"},{"key":"2061_CR66","unstructured":"Scaman, K., Bach, F., Bubeck, S., Lee, Y.T., Massouli\u00e9, L.: Optimal algorithms for smooth and strongly convex distributed optimization in networks. In: D.\u00a0Precup, Y.W. Teh (eds.) Proc. of 34th Int. Conf. Machine Learning (ICML), vol. PMLR 70, pp. 3027\u20133036 (2017)"},{"issue":"2","key":"2061_CR67","doi-asserted-by":"publisher","first-page":"944","DOI":"10.1137\/14096668X","volume":"25","author":"W Shi","year":"2015","unstructured":"Shi, W., Ling, Q., Wu, G., Yin, W.: EXTRA: An exact first-order algorithm for decentralized consensus optimization. SIAM J. Optim. 25(2), 944\u2013966 (2015)","journal-title":"SIAM J. Optim."},{"key":"2061_CR68","doi-asserted-by":"crossref","unstructured":"Starck, J.L., Murtagh, F., Fadili, J.: Sparse Image and Signal Processing: Wavelets, Curvelets. Cambridge University Press, Morphological Diversity (2010)","DOI":"10.1017\/CBO9780511730344"},{"issue":"3","key":"2061_CR69","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1561\/2600000008","volume":"3","author":"G Stathopoulos","year":"2016","unstructured":"Stathopoulos, G., Shukla, H., Szucs, A., Pu, Y., Jones, C.N.: Operator splitting methods in control. Found. Trends Syst. Control 3(3), 249\u2013362 (2016)","journal-title":"Found. Trends Syst. Control"},{"issue":"1","key":"2061_CR70","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1137\/100788100","volume":"49","author":"BF Svaiter","year":"2011","unstructured":"Svaiter, B.F.: On weak convergence of the Douglas-Rachford method. SIAM J. Control. Optim. 49(1), 280\u2013287 (2011)","journal-title":"SIAM J. Control. Optim."},{"key":"2061_CR71","doi-asserted-by":"publisher","first-page":"1222","DOI":"10.1002\/cjs.11617","volume":"49","author":"JK Tay","year":"2021","unstructured":"Tay, J.K., Friedman, J., Tibshirani, R.: Principal component-guided sparse regression. Can. J. Stat. 49, 1222\u20131257 (2021)","journal-title":"Can. J. Stat."},{"issue":"3","key":"2061_CR72","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1007\/s10444-011-9254-8","volume":"38","author":"BC V\u0169","year":"2013","unstructured":"V\u0169, B.C.: A splitting algorithm for dual monotone inclusions involving cocoercive operators. Adv. Comput. Math. 38(3), 667\u2013681 (2013)","journal-title":"Adv. Comput. Math."},{"key":"2061_CR73","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-015-0892-3","volume":"151","author":"SJ Wright","year":"2015","unstructured":"Wright, S.J.: Coordinate descent algorithms. Math. Program. 151, 3\u201334 (2015)","journal-title":"Math. Program."},{"issue":"4","key":"2061_CR74","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(4), 2057\u20132075 (2014)","journal-title":"SIAM J. Optim."},{"key":"2061_CR75","doi-asserted-by":"crossref","unstructured":"Xu, H., Ho, C.Y., Abdelmoniem, A.M., Dutta, A., Bergou, E.H., Karatsenidis, K., Canini, M., Kalnis, P.: GRACE: A compressed communication framework for distributed machine learning. In: Proc. of 41st IEEE Int. Conf. Distributed Computing Systems (ICDCS), pp. 561\u2013572 (2021)","DOI":"10.1109\/ICDCS51616.2021.00060"},{"key":"2061_CR76","doi-asserted-by":"publisher","first-page":"3555","DOI":"10.1109\/TSP.2021.3086579","volume":"69","author":"J Xu","year":"2021","unstructured":"Xu, J., Tian, Y., Sun, Y., Scutari, G.: Distributed algorithms for composite optimization: unified framework and convergence analysis. IEEE Trans. Signal Process. 69, 3555\u20133570 (2021)","journal-title":"IEEE Trans. Signal Process."},{"issue":"3","key":"2061_CR77","doi-asserted-by":"publisher","first-page":"1698","DOI":"10.1007\/s10915-018-0680-3","volume":"76","author":"M Yan","year":"2018","unstructured":"Yan, M.: A new Primal-Dual algorithm for minimizing the sum of three functions with a linear operator. J. Sci. Comput. 76(3), 1698\u20131717 (2018)","journal-title":"J. Sci. Comput."},{"key":"2061_CR78","unstructured":"Yurtsever, A., Vu, B.C., Cevher, V.: Stochastic three-composite convex minimization. In: D.\u00a0Lee, M.\u00a0Sugiyama, U.\u00a0Luxburg, I.\u00a0Guyon, R.\u00a0Garnett (eds.) Advances in Neural Information Processing Systems, vol.\u00a029, pp. 4329\u20134337. Curran Associates, Inc. (2016)"},{"key":"2061_CR79","unstructured":"Zhang, L., Mahdavi, M., Jin, R.: Linear convergence with condition number independent access of full gradients. In: C.\u00a0Burges, L.\u00a0Bottou, M.\u00a0Welling, Z.\u00a0Ghahramani, K.\u00a0Weinberger (eds.) Advances in Neural Information Processing Systems, vol. 26, pp. 980\u2013988. Curran Associates, Inc. (2013)"},{"key":"2061_CR80","unstructured":"Zhao, R., Cevher, V.: Stochastic three-composite convex minimization with a linear operator. In: A.\u00a0Storkey, F.\u00a0Perez-Cruz (eds.) Proc. of Int. Conf. Artif. Intell. Stat. (AISTATS), vol. PMLR 84, pp. 765\u2013774 (2018)"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-022-02061-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-022-02061-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-022-02061-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,24]],"date-time":"2023-11-24T14:35:56Z","timestamp":1700836556000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-022-02061-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,13]]},"references-count":80,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["2061"],"URL":"https:\/\/doi.org\/10.1007\/s10957-022-02061-8","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,13]]},"assertion":[{"value":"19 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 June 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 July 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}