{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T11:18:44Z","timestamp":1764587924546,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,3,20]],"date-time":"2018-03-20T00:00:00Z","timestamp":1521504000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2018,3,20]],"date-time":"2018-03-20T00:00:00Z","timestamp":1521504000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI-1300221"],"award-info":[{"award-number":["CMMI-1300221"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Centre of Operational Research and Logistics, University of Portsmouth"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s10589-018-9996-z","type":"journal-article","created":{"date-parts":[[2018,3,20]],"date-time":"2018-03-20T05:55:41Z","timestamp":1521525341000},"page":"763-790","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Complexity of the relaxed Peaceman\u2013Rachford splitting method for the sum of two maximal strongly monotone operators"],"prefix":"10.1007","volume":"70","author":[{"given":"Renato D. C.","family":"Monteiro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0696-4698","authenticated-orcid":false,"given":"Chee-Khian","family":"Sim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,20]]},"reference":[{"key":"9996_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9467-7","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"HH Bauschke","year":"2011","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces. Springer, Berlin (2011)"},{"key":"9996_CR2","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.jat.2014.06.002","volume":"185","author":"HH Bauschke","year":"2014","unstructured":"Bauschke, H.H., Bello Cruz, J.Y., Nghia, T.T.A., Phan, H.M., Wang, X.: The rate of linear convergence of the Douglas\u2013Rachford algorithm for subspaces is the cosine of the Friedrichs angle. J. Approx. Theory 185, 63\u201379 (2014)","journal-title":"J. Approx. Theory"},{"key":"9996_CR3","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s11075-015-0085-4","volume":"73","author":"HH Bauschke","year":"2016","unstructured":"Bauschke, H.H., Bello Cruz, J.Y., Nghia, T.T.A., Phan, H.M., Wang, X.: Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas\u2013Rachford methods for two subspaces. Numer. Algorithms 73, 33\u201376 (2016)","journal-title":"Numer. Algorithms"},{"key":"9996_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jmaa.2014.06.075","volume":"421","author":"HH Bauschke","year":"2015","unstructured":"Bauschke, H.H., Noll, D., Phan, H.M.: Linear and strong convergence of algorithms involving averaged nonexpansive operators. J. Math. Anal. Appl. 421, 1\u201320 (2015)","journal-title":"J. Math. Anal. Appl."},{"key":"9996_CR5","doi-asserted-by":"crossref","unstructured":"Burachik, R.S., Sagastiz\u00e1bal, C.A., Svaiter, B.F.: $$\\varepsilon $$-enlargements of maximal monotone operators: theory and applications. Reformulation: Nonsmooth, piecewise smooth, semismooth and smoothing methods (Lausanne 1997), vol. 22 of Applied Optimization, pp. 25\u201343. Kluwer Academic Publishers, Dordrecht, The Netherlands (1999)","DOI":"10.1007\/978-1-4757-6388-1_2"},{"issue":"5\u20136","key":"9996_CR6","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1007\/s00041-008-9045-x","volume":"14","author":"EJ Candes","year":"2008","unstructured":"Candes, E.J., Wakin, M.B., Boyd, S.P.: Enhancing sparsity by reweighted $$l_1$$ minimization. J. Fourier Anal. Appl. 14(5\u20136), 877\u2013905 (2008)","journal-title":"J. Fourier Anal. Appl."},{"issue":"5\u20136","key":"9996_CR7","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1080\/02331930412331327157","volume":"53","author":"PL Combettes","year":"2004","unstructured":"Combettes, P.L.: Solving monotone inclusions via compositions of nonexpansive averaged operators. Optimization 53(5\u20136), 475\u2013504 (2004)","journal-title":"Optimization"},{"issue":"3","key":"9996_CR8","first-page":"727","volume":"16","author":"PL Combettes","year":"2009","unstructured":"Combettes, P.L.: Iterative construction of the resolvent of a sum of maximal monotone operators. J. Convex Anal. 16(3), 727\u2013748 (2009)","journal-title":"J. Convex Anal."},{"key":"9996_CR9","doi-asserted-by":"publisher","first-page":"1760","DOI":"10.1137\/140992291","volume":"25","author":"D Davis","year":"2015","unstructured":"Davis, D.: Convergence rate analysis of the forward-Douglas\u2013Rachford splitting scheme. SIAM J. Optim. 25, 1760\u20131786 (2015)","journal-title":"SIAM J. Optim."},{"key":"9996_CR10","doi-asserted-by":"crossref","unstructured":"Davis, D., Yin, W.: Convergence rate analysis of several splitting schemes. arXiv preprint \n                    arXiv:1406.4834v3\n                    \n                   (2015)","DOI":"10.1007\/978-3-319-41589-5_4"},{"issue":"3","key":"9996_CR11","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1287\/moor.2016.0827","volume":"42","author":"D Davis","year":"2017","unstructured":"Davis, D., Yin, W.: Faster convergence rates of relaxed Peaceman\u2013Rachford and ADMM under regularity assumptions. Math. Oper. Res. 42(3), 783\u2013805 (2017)","journal-title":"Math. Oper. Res."},{"key":"9996_CR12","doi-asserted-by":"publisher","first-page":"4307","DOI":"10.1016\/j.na.2010.02.010","volume":"72","author":"Y Dong","year":"2010","unstructured":"Dong, Y., Fischer, A.: A family of operator splitting methods revisited. Nonlinear Anal. 72, 4307\u20134315 (2010)","journal-title":"Nonlinear Anal."},{"key":"9996_CR13","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\u2013Rachford splitting method and the proximal point algorithm for maximal monotone operators. Math. Program. 55, 293\u2013318 (1992)","journal-title":"Math. Program."},{"key":"9996_CR14","volume-title":"Finite-Dimensional Variational Inequalities and Complementarity Problem","author":"F Facchinei","year":"2003","unstructured":"Facchinei, F., Pang, J.-S.: Finite-Dimensional Variational Inequalities and Complementarity Problem, vol. II. Springer, New York (2003)"},{"issue":"4","key":"9996_CR15","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\u2013Rachford splitting. J. Fixed Point Theory Appl. 19(4), 2241\u20132270 (2017)","journal-title":"J. Fixed Point Theory Appl."},{"key":"9996_CR16","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1109\/TAC.2016.2564160","volume":"62","author":"P Giselsson","year":"2017","unstructured":"Giselsson, P., Boyd, S.: Linear convergence and metric selection for Douglas\u2013Rachford splitting and ADMM. IEEE Trans. Autom. Control 62, 532\u2013544 (2017)","journal-title":"IEEE Trans. Autom. Control"},{"key":"9996_CR17","doi-asserted-by":"crossref","unstructured":"Goncalves, M.L.N., Melo, J.G., Monteiro, R.D.C.: Improved pointwise iteration-complexity of a regularized ADMM and of a regularized non-Euclidean HPE framework. arXiv preprint \n                    arXiv:1601.01140v1\n                    \n                   (2016)","DOI":"10.1137\/16M1055530"},{"key":"9996_CR18","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\u2013Rachford operator splitting method. Math. Program. Ser. A 153, 715\u2013722 (2015)","journal-title":"Math. Program. Ser. A"},{"key":"9996_CR19","doi-asserted-by":"publisher","first-page":"2182","DOI":"10.1137\/130943649","volume":"25","author":"Y He","year":"2015","unstructured":"He, Y., Monteiro, R.D.C.: Accelerating block-decomposition first-order methods for solving composite saddle-point and two-player Nash equilibrium problems. SIAM J. Optim. 25, 2182\u20132211 (2015)","journal-title":"SIAM J. Optim."},{"key":"9996_CR20","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1137\/14096757X","volume":"26","author":"Y He","year":"2016","unstructured":"He, Y., Monteiro, R.D.C.: An accelerated HPE-type algorithm for a class of composite convex\u2013concave saddle-point problems. SIAM J. Optim. 26, 29\u201356 (2016)","journal-title":"SIAM J. Optim."},{"key":"9996_CR21","doi-asserted-by":"crossref","unstructured":"Kolossoski, O., Monteiro, R.D.C.: An accelerated non-Euclidean hybrid proximal extragradient-type algorithm for convex-concave saddle-point problems. Preprint (2015)","DOI":"10.1080\/10556788.2016.1266355"},{"issue":"6","key":"9996_CR22","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1137\/0716071","volume":"16","author":"P-L 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."},{"issue":"4","key":"9996_CR23","doi-asserted-by":"publisher","first-page":"1965","DOI":"10.1137\/130931862","volume":"25","author":"RDC Monteiro","year":"2015","unstructured":"Monteiro, R.D.C., Sicre, M.R., Svaiter, B.F.: A hybrid proximal extragradient self-concordant primal barrier method for monotone variational inequalities. SIAM J. Optim. 25(4), 1965\u20131996 (2015)","journal-title":"SIAM J. Optim."},{"key":"9996_CR24","unstructured":"Monteiro, R.D.C, Sim, C.-K.: Complexity of the relaxed Peaceman\u2013Rachford splitting method for the sum of two maximal strongly monotone operators. \n                    http:\/\/arxiv.org\/abs\/1611.03567\n                    \n                   (2017). arXiv preprint \n                    arXiv:1611.03567v2"},{"key":"9996_CR25","doi-asserted-by":"publisher","first-page":"2755","DOI":"10.1137\/090753127","volume":"20","author":"RDC Monteiro","year":"2010","unstructured":"Monteiro, R.D.C., Svaiter, B.F.: On the complexity of the hybrid proximal extragradient method for the iterates and the ergodic mean. SIAM J. Optim. 20, 2755\u20132787 (2010)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"9996_CR26","doi-asserted-by":"publisher","first-page":"1688","DOI":"10.1137\/100801652","volume":"21","author":"RDC Monteiro","year":"2011","unstructured":"Monteiro, R.D.C., Svaiter, B.F.: Complexity of variants of Tseng\u2019s modified F\u2013B splitting and Korpelevich\u2019s methods for hemivariational inequalities with applications to saddle-point and convex optimization problems. SIAM J. Optim. 21(4), 1688\u20131720 (2011)","journal-title":"SIAM J. Optim."},{"key":"9996_CR27","doi-asserted-by":"publisher","first-page":"1688","DOI":"10.1137\/100801652","volume":"21","author":"RDC Monteiro","year":"2011","unstructured":"Monteiro, R.D.C., Svaiter, B.F.: Complexity of variants of Tseng\u2019s modified F\u2013B splitting and Korpelevich\u2019s methods of hemi-variational inequalities with applications to saddle point and convex optimization problems. SIAM J. Optim. 21, 1688\u20131720 (2011)","journal-title":"SIAM J. Optim."},{"key":"9996_CR28","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1090\/S0002-9947-1970-0282272-5","volume":"149","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: On the maximality of sums of nonlinear monotone operators. Trans. Am. Math. Soc. 149, 75\u201388 (1970)","journal-title":"Trans. Am. Math. Soc."},{"key":"9996_CR29","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, 877\u2013898 (1976)","journal-title":"SIAM J. Control Optim."},{"key":"9996_CR30","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1023\/A:1008777829180","volume":"7","author":"MV Solodov","year":"1999","unstructured":"Solodov, M.V., Svaiter, B.F.: A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator. Set-Valued Var. Anal. 7, 323\u2013345 (1999)","journal-title":"Set-Valued Var. Anal."},{"key":"9996_CR31","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1287\/moor.25.2.214.12222","volume":"25","author":"MV Solodov","year":"2000","unstructured":"Solodov, M.V., Svaiter, B.F.: An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions. Math. Oper. Res. 25, 214\u2013230 (2000)","journal-title":"Math. Oper. Res."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-018-9996-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-9996-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-9996-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T10:59:58Z","timestamp":1589713198000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-018-9996-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,20]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["9996"],"URL":"https:\/\/doi.org\/10.1007\/s10589-018-9996-z","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2018,3,20]]},"assertion":[{"value":"3 November 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 March 2018","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}