{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T11:30:04Z","timestamp":1777462204617,"version":"3.51.4"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,10,11]],"date-time":"2018-10-11T00:00:00Z","timestamp":1539216000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003329","name":"Ministerio de Econom\u00eda y Competitividad","doi-asserted-by":"publisher","award":["MTM2014-59179-C2-1-P"],"award-info":[{"award-number":["MTM2014-59179-C2-1-P"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003329","name":"Ministerio de Econom\u00eda y Competitividad","doi-asserted-by":"publisher","award":["MTM2014-59179-C2-1-P"],"award-info":[{"award-number":["MTM2014-59179-C2-1-P"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003329","name":"Ministerio de Econom\u00eda y Competitividad","doi-asserted-by":"publisher","award":["RYC-2013-13327"],"award-info":[{"award-number":["RYC-2013-13327"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003329","name":"Ministerio de Econom\u00eda y Competitividad","doi-asserted-by":"publisher","award":["BES-2015-073360"],"award-info":[{"award-number":["BES-2015-073360"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s11075-018-0608-x","type":"journal-article","created":{"date-parts":[[2018,10,10]],"date-time":"2018-10-10T22:01:00Z","timestamp":1539208860000},"page":"397-421","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Optimal rates of linear convergence of the averaged alternating modified reflections method for two subspaces"],"prefix":"10.1007","volume":"82","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2445-8011","authenticated-orcid":false,"given":"Francisco J.","family":"Arag\u00f3n Artacho","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rub\u00e9n","family":"Campoy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,11]]},"reference":[{"issue":"3","key":"608_CR1","doi-asserted-by":"publisher","first-page":"382","DOI":"10.4153\/CJM-1954-037-2","volume":"6","author":"S Agmon","year":"1954","unstructured":"Agmon, S.: The relaxation method for linear inequalities. Canad. J. Math. 6(3), 382\u2013392 (1954)","journal-title":"Canad. J. Math."},{"issue":"1","key":"608_CR2","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s10589-017-9942-5","volume":"69","author":"FJ Arag\u00f3n Artacho","year":"2018","unstructured":"Arag\u00f3n Artacho, F.J., Campoy, R.: A new projection method for finding the closest point in the intersection of convex sets. Comput. Optim. Appl. 69(1), 99\u2013132 (2018)","journal-title":"Comput. Optim. Appl."},{"key":"608_CR3","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, New York (2011)"},{"key":"608_CR4","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., Nghia, T.T., 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"},{"issue":"1","key":"608_CR5","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., Nghia, T.T., Phan, H.M., Wang, X.: Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas\u2013Rachford methods for two subspaces. Numer. Algor. 73(1), 33\u201376 (2016)","journal-title":"Numer. Algor."},{"key":"608_CR6","volume-title":"Iterative Methods for Fixed Point Problems in Hilbert Spaces Lecture Notes in Mathematics, vol. 2057","author":"A Cegielski","year":"2012","unstructured":"Cegielski, A.: Iterative Methods for Fixed Point Problems in Hilbert Spaces Lecture Notes in Mathematics, vol. 2057. Springer, Heidelberg (2012)"},{"issue":"3","key":"608_CR7","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(3), 1093\u20131106 (2008)","journal-title":"SIAM J. Optim."},{"issue":"11","key":"608_CR8","doi-asserted-by":"publisher","first-page":"2343","DOI":"10.1080\/02331934.2014.957701","volume":"64","author":"Y Censor","year":"2015","unstructured":"Censor, Y., Cegielski, A.: Projection methods: an annotated bibliography of books and reviews. Optimization 64(11), 2343\u20132358 (2015)","journal-title":"Optimization"},{"key":"608_CR9","unstructured":"Cinderella software. \n                    http:\/\/www.cinderella.de"},{"key":"608_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-9298-9","volume-title":"Best Approximation in Inner Product Spaces CMS Books in Mathematics\/Ouvrages de Math\u00e9matiques de la SMC, vol. 7","author":"F Deutsch","year":"2001","unstructured":"Deutsch, F.: Best Approximation in Inner Product Spaces CMS Books in Mathematics\/Ouvrages de Math\u00e9matiques de la SMC, vol. 7. Springer, New York (2001)"},{"key":"608_CR11","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."},{"issue":"1","key":"608_CR12","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(1), 293\u2013318 (1992)","journal-title":"Math. Program."},{"key":"608_CR13","doi-asserted-by":"publisher","DOI":"10.1137\/9781611971941","volume-title":"Alternating Projection Methods Fundamentals of Algorithms, vol. 8","author":"R Escalante","year":"2011","unstructured":"Escalante, R., Raydan, M.: Alternating Projection Methods Fundamentals of Algorithms, vol. 8. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (2011)"},{"key":"608_CR14","doi-asserted-by":"crossref","unstructured":"F\u00e4lt, M., Giselsson, P.: Line search for generalized alternating projections. In: 2017 American Control Conference (ACC), pp. 4637\u20134642. IEEE (2017)","DOI":"10.23919\/ACC.2017.7963671"},{"key":"608_CR15","doi-asserted-by":"crossref","unstructured":"F\u00e4lt, M., Giselsson, P.: Optimal convergence rates for generalized alternating projections. In: 2017 IEEE 56th Annual Conference on Decision and Control (CDC), pp. 2268\u20132274. IEEE (2017)","DOI":"10.1109\/CDC.2017.8263980"},{"issue":"6","key":"608_CR16","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(6), 1\u201324 (1967)","journal-title":"USSR Comp. Math. Math. Phys."},{"key":"608_CR17","volume-title":"Matrix Analysis","author":"RA Horn","year":"2013","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis, 2nd edn. Cambridge University Press, Cambridge (2013)","edition":"2nd edn."},{"issue":"3","key":"608_CR18","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1109\/MCSE.2007.55","volume":"9","author":"JD Hunter","year":"2007","unstructured":"Hunter, J.D.: Matplotlib: A 2D graphics environment. Comput. Sci. Eng. 9(3), 90\u201395 (2007)","journal-title":"Comput. Sci. Eng."},{"issue":"1","key":"608_CR19","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/BF02551235","volume":"1","author":"S Kayalar","year":"1988","unstructured":"Kayalar, S., Weinert, H.L.: Error bounds for the method of alternating projections. Math. Control Signal Syst. 1(1), 43\u201359 (1988)","journal-title":"Math. Control Signal Syst."},{"issue":"3","key":"608_CR20","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/BF01697972","volume":"4","author":"ML Lapidus","year":"1981","unstructured":"Lapidus, M.L.: Generalization of the Trotter\u2013Lie formula. Integral Equ. Operator Theory 4(3), 366\u2013415 (1981)","journal-title":"Integral Equ. Operator Theory"},{"issue":"6","key":"608_CR21","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)","journal-title":"SIAM J. Numer. Anal."},{"issue":"2","key":"608_CR22","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 a prox-regular set in a Hilbert space. SIAM J. Optim. 19(2), 714\u2013739 (2008)","journal-title":"SIAM J. Optim."},{"key":"608_CR23","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)"},{"issue":"3","key":"608_CR24","doi-asserted-by":"publisher","first-page":"393","DOI":"10.4153\/CJM-1954-038-x","volume":"6","author":"TS Motzkin","year":"1954","unstructured":"Motzkin, T.S., Schoenberg, I.J.: The relaxation method for linear inequalities. Canad. J. Math. 6(3), 393\u2013404 (1954)","journal-title":"Canad. J. Math."},{"key":"608_CR25","unstructured":"von Neumann, J.: Functional Operators II: The Geometry of Orthogonal Spaces. Princeton University Press. (Reprint of mimeographed lecture notes first distributed in 1933) (1950)"},{"issue":"3","key":"608_CR26","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1080\/03081088308817526","volume":"13","author":"S Reich","year":"1983","unstructured":"Reich, S.: A limit theorem for projections. Linear Multilinear Algebra 13(3), 281\u2013290 (1983)","journal-title":"Linear Multilinear Algebra"},{"key":"608_CR27","doi-asserted-by":"publisher","first-page":"96\u2014107","DOI":"10.1016\/j.jat.2017.08.005","volume":"223","author":"S Reich","year":"2017","unstructured":"Reich, S., Zalas, R.: The optimal error bound for the method of simultaneous projections. J. Approx. Theory 223, 96\u2014107 (2017)","journal-title":"J. Approx. Theory"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-018-0608-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-018-0608-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-018-0608-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,10]],"date-time":"2019-10-10T19:42:41Z","timestamp":1570736561000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-018-0608-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,11]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["608"],"URL":"https:\/\/doi.org\/10.1007\/s11075-018-0608-x","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10,11]]},"assertion":[{"value":"17 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 September 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 October 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}