{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:38:58Z","timestamp":1740145138858,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,12,14]],"date-time":"2022-12-14T00:00:00Z","timestamp":1670976000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,14]],"date-time":"2022-12-14T00:00:00Z","timestamp":1670976000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"PGMO and EDF"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1007\/s11590-022-01957-8","type":"journal-article","created":{"date-parts":[[2022,12,14]],"date-time":"2022-12-14T09:03:05Z","timestamp":1671008585000},"page":"1271-1277","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On a new simple algorithm to compute the resolvents"],"prefix":"10.1007","volume":"17","author":[{"given":"Ba Khiet","family":"Le","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9022-6406","authenticated-orcid":false,"given":"Michel","family":"Th\u00e9ra","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,14]]},"reference":[{"issue":"3","key":"1957_CR1","doi-asserted-by":"publisher","first-page":"2227","DOI":"10.1137\/18M1230207","volume":"29","author":"H Attouch","year":"2019","unstructured":"Attouch, H., Chbani, Z., Riahi, H.: Fast proximal methods via time scaling of damped inertial dynamics. SIAM J. Optim. 29(3), 2227\u20132256 (2019). https:\/\/doi.org\/10.1137\/18M1230207","journal-title":"SIAM J. Optim."},{"key":"1957_CR2","doi-asserted-by":"crossref","unstructured":"Martinet, B.: R\u00e9gularisation d\u2019in\u00e9quations variationnelles par approximations successives. Rev. Fran\u00e7aise Informat. Recherche Op\u00e9rationnelle 4(S\u00e9r. R-3), 154\u2013158 (1970)","DOI":"10.1051\/m2an\/197004R301541"},{"issue":"2","key":"1957_CR3","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s10444-011-9243-y","volume":"38","author":"CA Micchelli","year":"2013","unstructured":"Micchelli, C.A., Shen, L., Xu, Y., Zeng, X.: Proximity algorithms for the L1\/TV image denoising model. Adv. Comput. Math. 38(2), 401\u2013426 (2013). https:\/\/doi.org\/10.1007\/s10444-011-9243-y","journal-title":"Adv. Comput. Math."},{"issue":"5","key":"1957_CR4","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Monotone operators and the proximal point algorithm. SIAM J. Control. Optim. 14(5), 877\u2013898 (1976). https:\/\/doi.org\/10.1137\/0314056","journal-title":"SIAM J. Control. Optim."},{"issue":"6","key":"1957_CR5","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). https:\/\/doi.org\/10.1137\/0716071","journal-title":"SIAM J. Numer. Anal."},{"issue":"4","key":"1957_CR6","doi-asserted-by":"publisher","first-page":"2241","DOI":"10.1007\/s11784-017-0417-1","volume":"19","author":"P Giselsson","year":"2017","unstructured":"Giselsson, P.: Tight global linear convergence rate bounds for Douglas-Rachford splitting. J. Fixed Point Theory Appl. 19(4), 2241\u20132270 (2017). https:\/\/doi.org\/10.1007\/s11784-017-0417-1","journal-title":"J. Fixed Point Theory Appl."},{"issue":"2","key":"1957_CR7","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/s10107-014-0805-x","volume":"153","author":"B He","year":"2015","unstructured":"He, B., Yuan, X.: On the convergence rate of Douglas-Rachford operator splitting method. Math. Program. 153(2), 715\u2013722 (2015). https:\/\/doi.org\/10.1007\/s10107-014-0805-x","journal-title":"Math. Program."},{"issue":"4","key":"1957_CR8","doi-asserted-by":"publisher","first-page":"1681","DOI":"10.3934\/jimo.2020040","volume":"17","author":"Y Ma","year":"2021","unstructured":"Ma, Y., Liao, L.Z.: The Glowinski-Le Tallec splitting method revisited: a general convergence and convergence rate analysis. J. Ind. Manag. Optim. 17(4), 1681\u20131711 (2021). https:\/\/doi.org\/10.3934\/jimo.2020040","journal-title":"J. Ind. Manag. Optim."},{"issue":"8","key":"1957_CR9","doi-asserted-by":"publisher","first-page":"2861","DOI":"10.1007\/s11590-021-01718-z","volume":"15","author":"S Adly","year":"2021","unstructured":"Adly, S., Le, B.K.: Douglas-Rachford splitting algorithm for solving state-dependent maximal monotone inclusions. Optim. Lett. 15(8), 2861\u20132878 (2021). https:\/\/doi.org\/10.1007\/s11590-021-01718-z","journal-title":"Optim. Lett."},{"issue":"3","key":"1957_CR10","doi-asserted-by":"publisher","first-page":"87","DOI":"10.4067\/s0719-06462014000300007","volume":"16","author":"A Moudafi","year":"2014","unstructured":"Moudafi, A.: Computing the resolvent of composite operators. Cubo 16(3), 87\u201396 (2014). https:\/\/doi.org\/10.4067\/s0719-06462014000300007","journal-title":"Cubo"},{"issue":"2","key":"1957_CR11","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0022-247X(79)90234-8","volume":"72","author":"GB Passty","year":"1979","unstructured":"Passty, G.B.: Ergodic convergence to a zero of the sum of monotone operators in Hilbert space. J. Math. Anal. Appl. 72(2), 383\u2013390 (1979). https:\/\/doi.org\/10.1016\/0022-247X(79)90234-8","journal-title":"J. Math. Anal. Appl."},{"issue":"1\u20132","key":"1957_CR12","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s10107-018-1350-9","volume":"180","author":"V Apidopoulos","year":"2020","unstructured":"Apidopoulos, V., Aujol, J.F., Dossal, C.: Convergence rate of inertial forward-backward algorithm beyond Nesterov\u2019s rule. Math. Program. 180(1\u20132), 137\u2013156 (2020). https:\/\/doi.org\/10.1007\/s10107-018-1350-9","journal-title":"Math. Program."},{"issue":"2","key":"1957_CR13","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/s10589-021-00291-6","volume":"80","author":"FJ Arag\u00f3n Artacho","year":"2021","unstructured":"Arag\u00f3n Artacho, F.J., Campoy, R., Tam, M.K.: Strengthened splitting methods for computing resolvents. Comput. Optim. Appl. 80(2), 549\u2013585 (2021). https:\/\/doi.org\/10.1007\/s10589-021-00291-6","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"1957_CR14","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1137\/17M1114739","volume":"28","author":"H Attouch","year":"2018","unstructured":"Attouch, H., Cabot, A.: Convergence rates of inertial forward-backward algorithms. SIAM J. Optim. 28(1), 849\u2013874 (2018). https:\/\/doi.org\/10.1137\/17M1114739","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1957_CR15","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/s00245-019-09584-z","volume":"80","author":"H Attouch","year":"2019","unstructured":"Attouch, H., Cabot, A.: Convergence of a relaxed inertial forward-backward algorithm for structured monotone inclusions. Appl. Math. Optim. 80(3), 547\u2013598 (2019). https:\/\/doi.org\/10.1007\/s00245-019-09584-z","journal-title":"Appl. Math. Optim."},{"issue":"2","key":"1957_CR16","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/S1052623495290179","volume":"7","author":"GHG Chen","year":"1997","unstructured":"Chen, G.H.G., Rockafellar, R.T.: Convergence rates in forward-backward splitting. SIAM J. Optim. 7(2), 421\u2013444 (1997). https:\/\/doi.org\/10.1137\/S1052623495290179","journal-title":"SIAM J. Optim."},{"key":"1957_CR17","doi-asserted-by":"publisher","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex analysis and monotone operator theory in Hilbert spaces. CMS books in mathematics\/Ouvrages de math\u00e9matiques de la SMC. Springer, New York (2011). https:\/\/doi.org\/10.1007\/978-1-4419-9467-7","DOI":"10.1007\/978-1-4419-9467-7"},{"issue":"1\u20132","key":"1957_CR18","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10107-020-01500-6","volume":"189","author":"HH Bauschke","year":"2021","unstructured":"Bauschke, H.H., Moursi, W.M., Wang, X.: Generalized monotone operators and their averaged resolvents. Math. Program. 189(1\u20132), 55\u201374 (2021). https:\/\/doi.org\/10.1007\/s10107-020-01500-6","journal-title":"Math. Program."},{"issue":"4","key":"1957_CR19","doi-asserted-by":"publisher","first-page":"2697","DOI":"10.1137\/18M121160X","volume":"29","author":"MN Dao","year":"2019","unstructured":"Dao, M.N., Phan, H.M.: Adaptive Douglas-Rachford splitting algorithm for the sum of two operators. SIAM J. Optim. 29(4), 2697\u20132724 (2019). https:\/\/doi.org\/10.1137\/18M121160X","journal-title":"SIAM J. Optim."},{"key":"1957_CR20","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."},{"issue":"5","key":"1957_CR21","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1007\/s11590-019-01432-x","volume":"14","author":"MN Dao","year":"2020","unstructured":"Dao, M.N., Phan, H.M.: Computing the resolvent of the sum of operators with application to best approximation problems. Optim. Lett. 14(5), 1193\u20131205 (2020). https:\/\/doi.org\/10.1007\/s11590-019-01432-x","journal-title":"Optim. Lett."},{"issue":"1","key":"1957_CR22","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). https:\/\/doi.org\/10.1137\/080716542","journal-title":"SIAM J. Imaging Sci."},{"issue":"3","key":"1957_CR23","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1007\/s10957-015-0746-4","volume":"166","author":"A Chambolle","year":"2015","unstructured":"Chambolle, A., Dossal, C.: On the convergence of the iterates of the \u201cfast iterative shrinkage\/thresholding algorithm\u2019\u2019. J. Optim. Theory Appl. 166(3), 968\u2013982 (2015). https:\/\/doi.org\/10.1007\/s10957-015-0746-4","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"1957_CR24","first-page":"543","volume":"269","author":"YE Nesterov","year":"1983","unstructured":"Nesterov, Y.E.: A method for solving the convex programming problem with convergence rate $$O(1\/k^{2})$$. Dokl. Akad. Nauk SSSR 269(3), 543\u2013547 (1983)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"1957_CR25","doi-asserted-by":"publisher","unstructured":"Nesterov, Y.: Introductory lectures on convex optimization, applied optimization, vol.\u00a087. Kluwer Academic Publishers, Boston, MA (2004). https:\/\/doi.org\/10.1007\/978-1-4419-8853-9. A basic course","DOI":"10.1007\/978-1-4419-8853-9"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01957-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-022-01957-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01957-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T15:16:58Z","timestamp":1685114218000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-022-01957-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,14]]},"references-count":25,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["1957"],"URL":"https:\/\/doi.org\/10.1007\/s11590-022-01957-8","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2022,12,14]]},"assertion":[{"value":"8 February 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 December 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 December 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 competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}