{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T08:14:45Z","timestamp":1776327285057,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,8,22]],"date-time":"2022-08-22T00:00:00Z","timestamp":1661126400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,8,22]],"date-time":"2022-08-22T00:00:00Z","timestamp":1661126400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100014440","name":"Ministerio de Ciencia, Innovaci\u00f3n y Universidades","doi-asserted-by":"publisher","award":["PGC2018-097960-B-C22"],"award-info":[{"award-number":["PGC2018-097960-B-C22"]}],"id":[{"id":"10.13039\/100014440","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100014440","name":"Ministerio de Ciencia, Innovaci\u00f3n y Universidades","doi-asserted-by":"publisher","award":["PRE2019-090751"],"award-info":[{"award-number":["PRE2019-090751"]}],"id":[{"id":"10.13039\/100014440","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"publisher","award":["PGC2018-097960-B-C22"],"award-info":[{"award-number":["PGC2018-097960-B-C22"]}],"id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Wallenberg Al, Autonomous Systems and Software Program","award":["305286"],"award-info":[{"award-number":["305286"]}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"crossref","award":["DE200100063"],"award-info":[{"award-number":["DE200100063"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004895","name":"European Social Fund","doi-asserted-by":"publisher","award":["PRE2019-090751"],"award-info":[{"award-number":["PRE2019-090751"]}],"id":[{"id":"10.13039\/501100004895","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100011596","name":"Conselleria d\u2019Educaci\u00f3, Investigaci\u00f3, Cultura i Esport","doi-asserted-by":"publisher","award":["AICO\/2021\/165"],"award-info":[{"award-number":["AICO\/2021\/165"]}],"id":[{"id":"10.13039\/501100011596","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100009092","name":"Universidad de Alicante","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100009092","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2023,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this work, we propose and analyse forward-backward-type algorithms for finding a zero of the sum of finitely many monotone operators, which are not based on reduction to a two operator inclusion in the product space. Each iteration of the studied algorithms requires one resolvent evaluation per set-valued operator, one forward evaluation per cocoercive operator, and two forward evaluations per monotone operator. Unlike existing methods, the structure of the proposed algorithms are suitable for distributed, decentralised implementation in ring networks without needing global summation to enforce consensus between nodes.<\/jats:p>","DOI":"10.1007\/s10589-022-00400-z","type":"journal-article","created":{"date-parts":[[2022,8,22]],"date-time":"2022-08-22T12:09:12Z","timestamp":1661170152000},"page":"845-870","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Distributed forward-backward methods for ring networks"],"prefix":"10.1007","volume":"86","author":[{"given":"Francisco J.","family":"Arag\u00f3n-Artacho","sequence":"first","affiliation":[]},{"given":"Yura","family":"Malitsky","sequence":"additional","affiliation":[]},{"given":"Matthew K.","family":"Tam","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2361-2037","authenticated-orcid":false,"given":"David","family":"Torregrosa-Bel\u00e9n","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,22]]},"reference":[{"issue":"2","key":"400_CR1","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/BF03007664","volume":"26","author":"J-B Baillon","year":"1977","unstructured":"Baillon, J.-B., Haddad, G.: Quelques propri\u00e9t\u00e9s des op\u00e9rateurs angle-born\u00e9s et $$n$$-cycliquement monotones. Isr. J. Math. 26(2), 137\u2013150 (1977)","journal-title":"Isr. J. Math."},{"key":"400_CR2","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T.: Monotone operators associated with saddle-functions and minimax problems. In: Browder, F.E. (ed.) Nonlinear Functional Analysis Part Proceedings of Symposia in Pure Mathematics, vol. 18, pp. 241\u2013250. American Mathematical Soc, Providence (1970)","DOI":"10.1090\/pspum\/018.1\/0285942"},{"issue":"2","key":"400_CR3","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1137\/S0363012998338806","volume":"38","author":"P Tseng","year":"2000","unstructured":"Tseng, P.: A modified forward-backward splitting method for maximal monotone mappings. SIAM J. Control Optim. 38(2), 431\u2013446 (2000). https:\/\/doi.org\/10.1137\/S0363012998338806","journal-title":"SIAM J. Control Optim."},{"issue":"4","key":"400_CR4","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-Valued Var. Anal. 25(4), 829\u2013858 (2017). https:\/\/doi.org\/10.1007\/s11228-017-0421-z","journal-title":"Set-Valued Var. Anal."},{"key":"400_CR5","doi-asserted-by":"publisher","DOI":"10.1186\/s13663-021-00701-8","author":"MN Dao","year":"2021","unstructured":"Dao, M.N., Phan, H.M.: An adaptive splitting algorithm for the sum of three operators. Fixed Point Theory Algorithms Sci. Eng. (2021). https:\/\/doi.org\/10.1186\/s13663-021-00701-8","journal-title":"Fixed Point Theory Algorithms Sci. Eng."},{"key":"400_CR6","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1007\/s11228-022-00631-6","volume":"30","author":"FJ Arag\u00f3n-Artacho","year":"2022","unstructured":"Arag\u00f3n-Artacho, F.J., Torregrosa-Bel\u00e9n, D.: A direct proof of convergence of Davis\u2013Yin splitting algorithm allowing larger stepsizes. Set-Valued Var. Anal. 30, 1011\u20131029 (2022). https:\/\/doi.org\/10.1007\/s11228-022-00631-6","journal-title":"Set-Valued Var. Anal."},{"key":"400_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2020.125248","volume":"381","author":"J Rieger","year":"2020","unstructured":"Rieger, J., Tam, M.K.: Backward-forward-reflected-backward splitting for three operator monotone inclusions. Appl. Math. Comput. 381, 125248 (2020). https:\/\/doi.org\/10.1016\/j.amc.2020.125248","journal-title":"Appl. Math. Comput."},{"issue":"3","key":"400_CR8","doi-asserted-by":"publisher","first-page":"1199","DOI":"10.1137\/120872802","volume":"6","author":"H Raguet","year":"2013","unstructured":"Raguet, H., Fadili, J., Peyr\u00e9, G.: A generalized forward-backward splitting. SIAM J. Imaging Sci. 6(3), 1199\u20131226 (2013). https:\/\/doi.org\/10.1137\/120872802","journal-title":"SIAM J. Imaging Sci."},{"key":"400_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-020-01565-3","author":"PR Johnstone","year":"2020","unstructured":"Johnstone, P.R., Eckstein, J.: Projective splitting with forward steps. Math. Program. (2020). https:\/\/doi.org\/10.1007\/s10107-020-01565-3","journal-title":"Math. Program."},{"issue":"1","key":"400_CR10","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). https:\/\/doi.org\/10.1007\/s10589-020-00238-3","journal-title":"Comput. Optim. Appl."},{"key":"400_CR11","volume-title":"Parallel and Distributed Computation: Numerical Methods","author":"D Bertsekas","year":"1989","unstructured":"Bertsekas, D., Tsitsiklis, J.: Parallel and Distributed Computation: Numerical Methods. Prentice-Hall, Englewood Cliffs (1989)"},{"key":"400_CR12","doi-asserted-by":"publisher","first-page":"776825","DOI":"10.3389\/frsip.2021.776825","volume":"1","author":"L Condat","year":"2022","unstructured":"Condat, L., Malinovsky, G., Richt\u00e1rik, P.: Distributed proximal splitting algorithms with rates and acceleration. Front. Signal Process. 1, 776825 (2022). https:\/\/doi.org\/10.3389\/frsip.2021.776825","journal-title":"Front. Signal Process."},{"issue":"3","key":"400_CR13","doi-asserted-by":"publisher","first-page":"1451","DOI":"10.1137\/18M1207260","volume":"26","author":"Y Malitsky","year":"2020","unstructured":"Malitsky, Y., Tam, M.K.: A forward-backward splitting method for monotone inclusions without cocoercivity. SIAM J. Optim. 26(3), 1451\u20131472 (2020). https:\/\/doi.org\/10.1137\/18M1207260","journal-title":"SIAM J. Optim."},{"key":"400_CR14","unstructured":"Malitsky, Y., Tam, M.K.: Resolvent splitting for sums of monotone operators with minimal lifting (2021). http:\/\/arxiv.org\/abs\/2108.02897"},{"issue":"1","key":"400_CR15","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(1), 233\u2013273 (2020). https:\/\/doi.org\/10.1007\/s10107-019-01403-1","journal-title":"Math. Program."},{"key":"400_CR16","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, Berlin (2017). https:\/\/doi.org\/10.1007\/978-3-319-48311-5","edition":"2"},{"key":"400_CR17","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1215\/S0012-7094-62-02933-2","volume":"29","author":"GJ Minty","year":"1962","unstructured":"Minty, G.J.: Monotone (nonlinear) operators in Hilbert space. Duke Math. J. 29, 341\u2013346 (1962)","journal-title":"Duke Math. J."},{"key":"400_CR18","doi-asserted-by":"crossref","unstructured":"Arag\u00f3n-Artacho, F.J., Bo\u0163, R.I., Torregrosa-Bel\u00e9n, D.: A primal-dual splitting algorithm for composite monotone inclusions with minimal lifting (2022). http:\/\/arxiv.org\/abs\/2202.09665","DOI":"10.1007\/s11075-022-01405-9"},{"key":"400_CR19","unstructured":"Bauschke, H.H., Singh, S., Wang, X.: The splitting algorithms by Ryu, by Malitsky-Tam, and by Campoy applied to normal cones of linear subspaces converge strongly to the projection onto the intersection (2022). http:\/\/arxiv.org\/abs\/2203.03832"},{"issue":"2","key":"400_CR20","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). https:\/\/doi.org\/10.1137\/14096668X","journal-title":"SIAM J. Optim."},{"key":"400_CR21","first-page":"1","volume":"3","author":"H Attouch","year":"1996","unstructured":"Attouch, H., Th\u00e9ra, M.: A general duality principle for the sum of two operators. J. Convex Anal. 3, 1\u201324 (1996)","journal-title":"J. Convex Anal."},{"issue":"3","key":"400_CR22","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1007\/s00245-019-09597-8","volume":"80","author":"ER Csetnek","year":"2019","unstructured":"Csetnek, E.R., Malitsky, Y., Tam, M.K.: Shadow Douglas-Rachford splitting for monotone inclusions. Appl. Math. Comput. 80(3), 665\u2013678 (2019). https:\/\/doi.org\/10.1007\/s00245-019-09597-8","journal-title":"Appl. Math. Comput."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00400-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-022-00400-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00400-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T12:12:13Z","timestamp":1699877533000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-022-00400-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,22]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["400"],"URL":"https:\/\/doi.org\/10.1007\/s10589-022-00400-z","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,22]]},"assertion":[{"value":"2 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 July 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 August 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}