{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:46:50Z","timestamp":1740124010435,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,12,2]],"date-time":"2022-12-02T00:00:00Z","timestamp":1669939200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,12,2]],"date-time":"2022-12-02T00:00:00Z","timestamp":1669939200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2023,1]]},"abstract":"Abstract<\/jats:title>We consider the convergence behavior using the relaxed Peaceman\u2013Rachford splitting method to solve the monotone inclusion problem $$0 \\in (A + B)(u)$$<\/jats:tex-math>\n \n 0<\/mml:mn>\n \u2208<\/mml:mo>\n (<\/mml:mo>\n A<\/mml:mi>\n +<\/mml:mo>\n B<\/mml:mi>\n )<\/mml:mo>\n (<\/mml:mo>\n u<\/mml:mi>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, where $$A, B: \\Re ^n \\rightrightarrows \\Re ^n$$<\/jats:tex-math>\n \n A<\/mml:mi>\n ,<\/mml:mo>\n B<\/mml:mi>\n :<\/mml:mo>\n \n \u211c<\/mml:mi>\n n<\/mml:mi>\n <\/mml:msup>\n \u21c9<\/mml:mo>\n \n \u211c<\/mml:mi>\n n<\/mml:mi>\n <\/mml:msup>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> are maximal $$\\beta $$<\/jats:tex-math>\n \u03b2<\/mml:mi>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-strongly monotone operators, $$n \\ge 1$$<\/jats:tex-math>\n \n n<\/mml:mi>\n \u2265<\/mml:mo>\n 1<\/mml:mn>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> and $$\\beta > 0$$<\/jats:tex-math>\n \n \u03b2<\/mml:mi>\n ><\/mml:mo>\n 0<\/mml:mn>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. Under a technical assumption, convergence of iterates using the method on the problem is proved when either A<\/jats:italic> or B<\/jats:italic> is single-valued, and the fixed relaxation parameter $$\\theta $$<\/jats:tex-math>\n \u03b8<\/mml:mi>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> lies in the interval $$(2 + \\beta , 2 + \\beta + \\min \\{ \\beta , 1\/\\beta \\})$$<\/jats:tex-math>\n \n (<\/mml:mo>\n 2<\/mml:mn>\n +<\/mml:mo>\n \u03b2<\/mml:mi>\n ,<\/mml:mo>\n 2<\/mml:mn>\n +<\/mml:mo>\n \u03b2<\/mml:mi>\n +<\/mml:mo>\n min<\/mml:mo>\n {<\/mml:mo>\n \u03b2<\/mml:mi>\n ,<\/mml:mo>\n 1<\/mml:mn>\n \/<\/mml:mo>\n \u03b2<\/mml:mi>\n }<\/mml:mo>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. With this convergence result, we address an open problem that is not settled in Monteiro et al. (Computat Optim Appl 70:763\u2013790, 2018) on the convergence of these iterates for $$\\theta \\in (2 + \\beta , 2 + \\beta + \\min \\{ \\beta , 1\/\\beta \\})$$<\/jats:tex-math>\n \n \u03b8<\/mml:mi>\n \u2208<\/mml:mo>\n (<\/mml:mo>\n 2<\/mml:mn>\n +<\/mml:mo>\n \u03b2<\/mml:mi>\n ,<\/mml:mo>\n 2<\/mml:mn>\n +<\/mml:mo>\n \u03b2<\/mml:mi>\n +<\/mml:mo>\n min<\/mml:mo>\n {<\/mml:mo>\n \u03b2<\/mml:mi>\n ,<\/mml:mo>\n 1<\/mml:mn>\n \/<\/mml:mo>\n \u03b2<\/mml:mi>\n }<\/mml:mo>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. Pointwise convergence rate results and R<\/jats:italic>-linear convergence rate results when $$\\theta $$<\/jats:tex-math>\n \u03b8<\/mml:mi>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> lies in the interval $$[2 + \\beta , 2 + \\beta + \\min \\{\\beta , 1\/\\beta \\})$$<\/jats:tex-math>\n \n [<\/mml:mo>\n 2<\/mml:mn>\n +<\/mml:mo>\n \u03b2<\/mml:mi>\n ,<\/mml:mo>\n 2<\/mml:mn>\n +<\/mml:mo>\n \u03b2<\/mml:mi>\n +<\/mml:mo>\n min<\/mml:mo>\n {<\/mml:mo>\n \u03b2<\/mml:mi>\n ,<\/mml:mo>\n 1<\/mml:mn>\n \/<\/mml:mo>\n \u03b2<\/mml:mi>\n }<\/mml:mo>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> are also provided in the paper. Our analysis to achieve these results is atypical and hence novel. Numerical experiments on the weighted Lasso minimization problem are conducted to test the validity of the assumption.\n<\/jats:p>","DOI":"10.1007\/s10957-022-02136-6","type":"journal-article","created":{"date-parts":[[2022,12,2]],"date-time":"2022-12-02T17:03:48Z","timestamp":1670000628000},"page":"298-323","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Convergence Rates for the Relaxed Peaceman-Rachford Splitting Method on a Monotone Inclusion Problem"],"prefix":"10.1007","volume":"196","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0696-4698","authenticated-orcid":false,"given":"Chee-Khian","family":"Sim","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,2]]},"reference":[{"key":"2136_CR1","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10898-021-01057-4","volume":"82","author":"S Bartz","year":"2022","unstructured":"Bartz, S., Dao, M.N., Phan, H.M.: Conical averagedness and convergence analysis of fixed point algorithms. J. Glob. Optim. 82, 351\u2013373 (2022)","journal-title":"J. Glob. Optim."},{"key":"2136_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9467-7","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"H Bauschke","year":"2011","unstructured":"Bauschke, H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces. Springer, Berlin (2011)"},{"key":"2136_CR3","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., Cruz, J.Y.B., 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":"2136_CR4","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., Cruz, J.Y.B., 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. Algorithm. 73, 33\u201376 (2016)","journal-title":"Numer. Algorithm."},{"key":"2136_CR5","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":"2136_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.: Enhancing sparsity by reweighted $$l_1$$ minimization. J. Fourier Anal. Appl. 14, 877\u2013905 (2008)","journal-title":"J. Fourier Anal. Appl."},{"key":"2136_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, 475\u2013504 (2004)","journal-title":"Optimization"},{"key":"2136_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, 727\u2013748 (2009)","journal-title":"J. Convex Anal."},{"key":"2136_CR9","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\u2013Rachford splitting algorithm for the sum of two operators. SIAM J. Optim. 29, 2697\u20132724 (2019)","journal-title":"SIAM J. Optim."},{"key":"2136_CR10","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":"2136_CR11","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, Scientific Computation book series","author":"D Davis","year":"2016","unstructured":"Davis, D., Yin, W.: Convergence rate analysis of several splitting schemes. In: Glowinski, R., Osher, S., Yin, W. (eds.) Splitting Methods in Communication, Imaging, Science, and Engineering, Scientific Computation book series, pp. 115\u2013163. Springer, Cham (2016)"},{"key":"2136_CR12","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, 783\u2013805 (2017)","journal-title":"Math. Oper. Res."},{"key":"2136_CR13","first-page":"4307","volume":"72","author":"Y Dong","year":"2010","unstructured":"Dong, Y., Fischer, A.: A family of operator splitting methods revisited, Nonlinear. Analysis 72, 4307\u20134315 (2010)","journal-title":"Analysis"},{"key":"2136_CR14","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":"2136_CR15","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. Springer, Berlin (2003)"},{"key":"2136_CR16","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, 2241\u20132270 (2017)","journal-title":"J. Fixed Point Theory Appl."},{"key":"2136_CR17","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":"2136_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. Programm. Ser. A 153, 715\u2013722 (2015)","journal-title":"Math. Programm. Ser. A"},{"key":"2136_CR19","first-page":"187","volume-title":"Studies and Essays, Courant Anniversary Volume","author":"F John","year":"1948","unstructured":"John, F.: Extremum problems with inequalities as side conditions. In: Friedrichs, K.O., Neugebauer, O.E., Stoker, J.J. (eds.) Studies and Essays, Courant Anniversary Volume, pp. 187\u2013204. Wiley (Interscience), New York (1948)"},{"key":"2136_CR20","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, 964\u2013979 (1979)","journal-title":"SIAM J. Numer. Anal."},{"key":"2136_CR21","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0022-247X(67)90163-1","volume":"17","author":"OL Mangasarian","year":"1967","unstructured":"Mangasarian, O.L., Fromovitz, S.: The Fritz John necessary optimality conditions in the presence of equality and inequality constraints. J. Math. Anal. Appl. 17, 37\u201347 (1967)","journal-title":"J. Math. Anal. Appl."},{"key":"2136_CR22","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1007\/s10589-018-9996-z","volume":"70","author":"RDC Monteiro","year":"2018","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. Comput. Optim. Appl. 70, 763\u2013790 (2018)","journal-title":"Comput. Optim. Appl."},{"key":"2136_CR23","unstructured":"Sim, C.-K.: A note on convergence using the relaxed Peaceman-Rachford splitting method on the sum of two maximal strongly monotone operators, unpublished manuscript, August (2020) (https:\/\/drive.google.com\/file\/d\/1Yf5rn21mhof4j3u8qQRlFVzONfbtn6jV\/view)"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-022-02136-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-022-02136-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-022-02136-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T16:41:12Z","timestamp":1673282472000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-022-02136-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,2]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["2136"],"URL":"https:\/\/doi.org\/10.1007\/s10957-022-02136-6","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2022,12,2]]},"assertion":[{"value":"31 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 November 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 December 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}