{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T11:30:00Z","timestamp":1777462200925,"version":"3.51.4"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,12,21]],"date-time":"2015-12-21T00:00:00Z","timestamp":1450656000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s11075-015-0085-4","type":"journal-article","created":{"date-parts":[[2015,12,21]],"date-time":"2015-12-21T00:50:34Z","timestamp":1450659034000},"page":"33-76","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":32,"title":["Optimal Rates of Linear Convergence of Relaxed Alternating Projections and Generalized Douglas-Rachford Methods for Two Subspaces"],"prefix":"10.1007","volume":"73","author":[{"given":"Heinz H.","family":"Bauschke","sequence":"first","affiliation":[]},{"given":"J. Y.","family":"Bello Cruz","sequence":"additional","affiliation":[]},{"given":"Tran T. A.","family":"Nghia","sequence":"additional","affiliation":[]},{"given":"Hung M.","family":"Pha","sequence":"additional","affiliation":[]},{"given":"Xianfu","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,21]]},"reference":[{"key":"85_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10957-013-0488-0","volume":"163","author":"FJ Arag\u00f3n Artacho","year":"2014","unstructured":"Arag\u00f3n Artacho, F.J., Borwein, J.M., Tam, M.K.: Recent results on Douglas-Rachford methods for combinatorial optimization problems. J. Optim. Theory Appl. 163, 1\u201330 (2014)","journal-title":"J. Optim. Theory Appl."},{"key":"85_CR2","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1137\/S0036144593251710","volume":"38","author":"HH Bauschke","year":"1996","unstructured":"Bauschke, H.H., Borwein, J.M.: On projection algorithms for solving convex feasibility problems. SIAM Rev. 38, 367\u2013426 (1996)","journal-title":"SIAM Rev."},{"key":"85_CR3","doi-asserted-by":"publisher","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex analysis and monotone operator theory in Hilbert spaces. Springer (2011)","DOI":"10.1007\/978-1-4419-9467-7"},{"key":"85_CR4","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s11075-005-9010-6","volume":"4","author":"HH Bauschke","year":"2006","unstructured":"Bauschke, H.H., Combettes, P.L., Kruk, S.G.: Extrapolation algorithm for affine-convex feasibility problems. Numer. Algorithms 4, 239\u2013274 (2006)","journal-title":"Numer. Algorithms"},{"key":"85_CR5","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-Rachford algorithm for subspaces is the cosine of the Friedrichs angle. J. Approx. Theory 185, 63\u201379 (2014)","journal-title":"J. Approx. Theory"},{"key":"85_CR6","doi-asserted-by":"publisher","first-page":"3433","DOI":"10.1090\/S0002-9947-03-03136-2","volume":"355","author":"HH Bauschke","year":"2003","unstructured":"Bauschke, H.H., Deutsch, F., Hundal, H., Park, S.-H.: Accelerating the convergence of the method of alternating projections. Trans. Amer. Math. Soc. 355, 3433\u20133461 (2003)","journal-title":"Trans. Amer. Math. Soc."},{"key":"85_CR7","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1023\/B:JOTA.0000025708.31430.22","volume":"120","author":"HH Bauschke","year":"2004","unstructured":"Bauschke, H.H., Kruk, S.G.: Reflection-projection method for convex feasibility problems with an obtuse cone. J. Optim. Theory Appl. 120, 503\u2013531 (2004)","journal-title":"J. Optim. Theory Appl."},{"key":"85_CR8","unstructured":"Bauschke, H.H., Dao, M.N., Noll, D., Phan, H.M.: Proximal point algorithm, Douglas-Rachford algorithm and alternating projections: a case study. J Convex Anal. (to appear)"},{"key":"85_CR9","doi-asserted-by":"publisher","first-page":"579","DOI":"10.2307\/2005662","volume":"27","author":"A Bj\u00f6rck","year":"1973","unstructured":"Bj\u00f6rck, A., Golub, G.H.: Numerical methods for computing angles between linear subspaces. Math. Comp. 27, 579\u2013594 (1973)","journal-title":"Math. Comp."},{"key":"85_CR10","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971262","volume-title":"Nonnegative matrices in the mathematical sciences","author":"A Berman","year":"1994","unstructured":"Berman, A., Plemmons, R.J.: Nonnegative matrices in the mathematical sciences. SIAM, Philadelphia (1994)"},{"key":"85_CR11","doi-asserted-by":"crossref","unstructured":"Cegielski, A.: Iterative methods for fixed point problems in Hilbert spaces. Springer (2012)","DOI":"10.1007\/978-3-642-30901-4"},{"key":"85_CR12","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1137\/070698750","volume":"19","author":"A Cegielski","year":"2008","unstructured":"Cegielski, A., Suchocka, A.: Relaxed alternating projection methods. SIAM J. Optim. 19, 1093\u20131106 (2008)","journal-title":"SIAM J. Optim."},{"key":"85_CR13","doi-asserted-by":"publisher","unstructured":"Censor, Y., Elfving, T., Herman, G.T., Nikazad, T.: On diagonally relaxed orthogonal projection methods. SIAM J. Sci. Comput. 30, 473\u2013504 (2007\/08)","DOI":"10.1137\/050639399"},{"key":"85_CR14","volume-title":"Proximal splitting methods in signal processing, Fixed-point algorithms for inverse problems in science and engineering, 185\u2013212, Springer Optim. Appl., 49","author":"PL Combettes","year":"2011","unstructured":"Combettes, P.L., Pesquet, J.C.: Proximal splitting methods in signal processing, Fixed-point algorithms for inverse problems in science and engineering, 185\u2013212, Springer Optim. Appl., 49. Springer, New York (2011)"},{"key":"85_CR15","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":"85_CR16","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1090\/mcom\/2965","volume":"85","author":"L Demanet","year":"2016","unstructured":"Demanet, L., Zhang, X.: Eventual linear convergence of the Douglas-Rachford iteration for basis pursuit. Math. Comput. 85, 209\u2013238 (2016)","journal-title":"Math. Comput."},{"key":"85_CR17","doi-asserted-by":"publisher","unstructured":"Deutsch, F.: The angle between subspaces of a Hilbert space. In: Singh, S.P. (ed.) Approximation theory, wavelets and applications, pp 107\u2013130. Kluwer (1995)","DOI":"10.1007\/978-94-015-8577-4_7"},{"key":"85_CR18","doi-asserted-by":"publisher","unstructured":"Deutsch, F.: Best approximations in inner product spaces. Springer (2001)","DOI":"10.1007\/978-1-4684-9298-9"},{"key":"85_CR19","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1090\/S0002-9947-1956-0084194-4","volume":"82","author":"J Douglas","year":"1956","unstructured":"Douglas, J., Rachford, H.H.: On the numerical solution of heat conduction problems in two and three space variables. Trans. Amer. Math. Soc. 82, 421\u2013439 (1956)","journal-title":"Trans. Amer. Math. Soc."},{"key":"85_CR20","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."},{"key":"85_CR21","first-page":"321","volume":"37","author":"T Elfving","year":"2010","unstructured":"Elfving, T., Nikazad, T., Hansen, P.C.: Semi-convergence and relaxation parameters for a class of SIRT algorithms. Electron. Trans. Numer. Anal. 37, 321\u2013336 (2010)","journal-title":"Electron. Trans. Numer. Anal."},{"key":"85_CR22","doi-asserted-by":"publisher","DOI":"10.1137\/9781611971941","volume-title":"Alternating projection methods, fundamentals of algorithms 8","author":"R Escalante","year":"2011","unstructured":"Escalante, R., Raydan, M.: Alternating projection methods, fundamentals of algorithms 8. SIAM, Philadelphia (2011)"},{"key":"85_CR23","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0377-0427(89)90296-3","volume":"26","author":"WB Gearhart","year":"1989","unstructured":"Gearhart, W.B., Koshy, M.: Acceleration schemes for the method of alternating projections. J. Comp. Appl. Math. 26, 235\u2013249 (1989)","journal-title":"J. Comp. Appl. Math."},{"key":"85_CR24","unstructured":"GNU Plot: http:\/\/sourceforge.net\/projects\/gnuplot"},{"key":"85_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0041-5553(67)90113-9","volume":"7","author":"LG Gubin","year":"1967","unstructured":"Gubin, L.G., Polyak, B.T., Raik, E.V.: The method of projections for finding the common point of convex sets. USSR Comp. Math. Math. Phys. 7, 1\u201324 (1967)","journal-title":"USSR Comp. Math. Math. Phys."},{"key":"85_CR26","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1515\/crll.1926.155.107","volume":"155","author":"K Hensel","year":"1926","unstructured":"Hensel, K.: \u00dcber Potenzreihen von Matrizen. J. Reine Angew. Math. 155, 107\u2013110 (1926)","journal-title":"J. Reine Angew. Math."},{"key":"85_CR27","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/BF02551235","volume":"1","author":"S Kayalar","year":"1996","unstructured":"Kayalar, S., Weinert, H.: Error bounds for the method of alternating projections. Math. Control Signals Syst. 1, 43\u201359 (1996)","journal-title":"Math. Control Signals Syst."},{"key":"85_CR28","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1080\/03081080701669309","volume":"57","author":"S Kirkland","year":"2009","unstructured":"Kirkland, S.: A cycle-based bound for subdominant eigenvalues of stochastic matrices. Linear Multilinear Algebra 57, 247\u2013266 (2009)","journal-title":"Linear Multilinear Algebra"},{"key":"85_CR29","doi-asserted-by":"publisher","first-page":"4868","DOI":"10.1109\/TSP.2014.2339801","volume":"62","author":"R Hesse","year":"2014","unstructured":"Hesse, R., Luke, D.R., Neumann, P.: Alternating projections and Douglas-Rachford for sparse affine feasibility. IEEE Trans. Signal Process. 62, 4868\u20134881 (2014)","journal-title":"IEEE Trans. Signal Process."},{"key":"85_CR30","doi-asserted-by":"publisher","first-page":"2397","DOI":"10.1137\/120902653","volume":"23","author":"R Hesse","year":"2013","unstructured":"Hesse, R., Luke, D.R.: Nonconvex notions of regularity and convergence of fundamental algorithms for feasibility problems. SIAM J. Optim. 23, 2397\u20132419 (2013)","journal-title":"SIAM J. Optim."},{"key":"85_CR31","unstructured":"The Julia language: http:\/\/julialang.org\/"},{"key":"85_CR32","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":"85_CR33","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1137\/070681399","volume":"19","author":"DR Luke","year":"2008","unstructured":"Luke, D.R.: Finding best approximation pairs relative to a convex and prox-regular set in a Hilbert space. SIAM J. Optim. 19, 714\u2013739 (2008)","journal-title":"SIAM J. Optim."},{"issue":"\/224","key":"85_CR34","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1016\/0024-3795(94)00358-K","volume":"223","author":"I Marek","year":"1995","unstructured":"Marek, I.: On square roots of M-operators. Linear Algebra Appl. 223(\/224), 501\u2013520 (1995)","journal-title":"Linear Algebra Appl."},{"key":"85_CR35","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/S0024-3795(99)00275-X","volume":"316","author":"I Marek","year":"2000","unstructured":"Marek, I., Szyld, D.B.: Comparison theorems for the convergence factor of iterative methods for singular matrices. Linear Algebra Appl. 316, 67\u201387 (2000)","journal-title":"Linear Algebra Appl."},{"key":"85_CR36","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1137\/S0895479800375989","volume":"24","author":"I Marek","year":"2002","unstructured":"Marek, I., Szyld, D.B.: Comparison of convergence of general stationary iterative methods for singular matrices. SIAM J. Matrix Anal. Appl. 24, 68\u201377 (2002)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"85_CR37","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719512","volume-title":"Matrix analysis and applied linear algebra","author":"CD Meyer","year":"2000","unstructured":"Meyer, C.D.: Matrix analysis and applied linear algebra. SIAM, Philadelphia (2000)"},{"key":"85_CR38","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1137\/0714047","volume":"14","author":"CD Meyer","year":"1977","unstructured":"Meyer, C.D., Plemmons, R.J.: Convergent powers of a matrix with applications to iterative methods for singular linear systems. SIAM J. Numer. Anal. 14, 699\u2013705 (1977)","journal-title":"SIAM J. Numer. Anal."},{"key":"85_CR39","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0024-3795(92)90251-5","volume":"171","author":"J Miao","year":"1992","unstructured":"Miao, J., Ben-Israel, A.: On principal angles between subspaces in \u211d n . Linear Algebra Appl. 171, 81\u201398 (1992)","journal-title":"Linear Algebra Appl."},{"key":"85_CR40","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF01396746","volume":"51","author":"S Nelson","year":"1987","unstructured":"Nelson, S., Neumann, M.: Generalizations of the projection method with applications to SOR theory for Hermitian positive semidefinite linear systems. Numer. Math. 51, 123\u2013141 (1987)","journal-title":"Numer. Math."},{"key":"85_CR41","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1215\/S0012-7094-40-00627-5","volume":"6","author":"R Oldenburger","year":"1940","unstructured":"Oldenburger, R.: Infinite powers of matrices and characteristic roots. Duke Math. J. 6, 357\u2013361 (1940)","journal-title":"Duke Math. J."},{"key":"85_CR42","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718003","volume-title":"Iterative methods for sparse linear systems","author":"Y Saad","year":"2003","unstructured":"Saad, Y.: Iterative methods for sparse linear systems. SIAM, Philadelphia (2003)"},{"key":"85_CR43","doi-asserted-by":"publisher","unstructured":"Stewart, G.W.: Matrix algorithms, II: eigensystems. SIAM, Philadelphia (2001)","DOI":"10.1137\/1.9780898718058"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-015-0085-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-015-0085-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-015-0085-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,16]],"date-time":"2023-08-16T06:54:18Z","timestamp":1692168858000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-015-0085-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,21]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["85"],"URL":"https:\/\/doi.org\/10.1007\/s11075-015-0085-4","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,21]]}}}