{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:24:44Z","timestamp":1740122684828,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,11,15]],"date-time":"2019-11-15T00:00:00Z","timestamp":1573776000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,15]],"date-time":"2019-11-15T00:00:00Z","timestamp":1573776000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["304392\/2018-9","429915\/2018-7"],"award-info":[{"award-number":["304392\/2018-9","429915\/2018-7"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000121","name":"Division of Mathematical Sciences","doi-asserted-by":"publisher","award":["1816449"],"award-info":[{"award-number":["1816449"]}],"id":[{"id":"10.13039\/100000121","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s10589-019-00155-0","type":"journal-article","created":{"date-parts":[[2019,11,15]],"date-time":"2019-11-15T18:02:18Z","timestamp":1573840938000},"page":"675-699","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["The block-wise circumcentered\u2013reflection method"],"prefix":"10.1007","volume":"76","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5473-4654","authenticated-orcid":false,"given":"Roger","family":"Behling","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7877-5688","authenticated-orcid":false,"given":"J.-Yunier","family":"Bello-Cruz","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0083-5871","authenticated-orcid":false,"given":"Luiz-Rafael","family":"Santos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,15]]},"reference":[{"issue":"1","key":"155_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10957-013-0488-0","volume":"163","author":"FJ Arag\u00f3n Artacho","year":"2013","unstructured":"Arag\u00f3n Artacho, F.J., Borwein, J.M., Tam, M.K.: Recent results on Douglas\u2013Rachford methods for combinatorial optimization problems. J. Optim. Theory Appl. 163(1), 1\u201330 (2013)","journal-title":"J. Optim. Theory Appl."},{"key":"155_CR2","doi-asserted-by":"crossref","unstructured":"Arag\u00f3n\u00a0Artacho, F.J., Campoy, R., Tam, M.K.: The Douglas\u2013Rachford algorithm for convex and nonconvex feasibility problems. arXiv:1904.09148 (2019)","DOI":"10.1007\/s00186-019-00691-9"},{"key":"155_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., 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"},{"issue":"1","key":"155_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., 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(1), 33\u201376 (2016)","journal-title":"Numer. Algorithms"},{"issue":"2","key":"155_CR5","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/BF01027691","volume":"1","author":"HH Bauschke","year":"1993","unstructured":"Bauschke, H.H., Borwein, J.M.: On the convergence of von Neumann\u2019s alternating projection algorithm for two sets. Set-Valued Anal. 1(2), 185\u2013212 (1993)","journal-title":"Set-Valued Anal."},{"issue":"3","key":"155_CR6","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1137\/S0036144593251710","volume":"38","author":"HH Bauschke","year":"2006","unstructured":"Bauschke, H.H., Borwein, J.M.: On projection algorithms for solving convex feasibility problems. SIAM Rev. 38(3), 367\u2013426 (2006)","journal-title":"SIAM Rev."},{"issue":"9","key":"155_CR7","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.R., Hundal, H., Park, S.H.: Accelerating the convergence of the method of alternating projections. Trans. Am. Math. Soc. 355(9), 3433\u20133461 (2003)","journal-title":"Trans. Am. Math. Soc."},{"issue":"3","key":"155_CR8","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s11228-013-0239-2","volume":"21","author":"HH Bauschke","year":"2013","unstructured":"Bauschke, H.H., Luke, D.R., Phan, H.M., Wang, X.: Restricted normal cones and the method of alternating projections: theory. Set-Valued Var. Anal. 21(3), 431\u2013473 (2013)","journal-title":"Set-Valued Var. Anal."},{"issue":"2","key":"155_CR9","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1137\/15M1016989","volume":"26","author":"HH Bauschke","year":"2016","unstructured":"Bauschke, H.H., Moursi, W.M.: The Douglas\u2013Rachford algorithm for two (not necessarily intersecting) affine subspaces. SIAM J. Optim. 26(2), 968\u2013985 (2016)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"155_CR10","first-page":"271","volume":"4","author":"HH Bauschke","year":"2018","unstructured":"Bauschke, H.H., Ouyang, H., Wang, X.: On circumcenters of finite sets in Hilbert spaces. Linear Nonlinear Anal. 4(2), 271\u2013295 (2018)","journal-title":"Linear Nonlinear Anal."},{"key":"155_CR11","doi-asserted-by":"crossref","unstructured":"Bauschke, H.H., Ouyang, H., Wang, X.: Circumcentered methods induced by isometries. arXiv:1908.11576 (2019)","DOI":"10.1007\/s10013-020-00417-z"},{"key":"155_CR12","unstructured":"Bauschke, H.H., Ouyang, H., Wang, X.: On circumcenter mappings induced by nonexpansive operators. Pure Appl. Funct. Anal. (in press)"},{"issue":"3","key":"155_CR13","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1007\/s11075-017-0399-5","volume":"78","author":"R Behling","year":"2018","unstructured":"Behling, R., Bello-Cruz, J.Y., Santos, L.R.: Circumcentering the Douglas\u2013Rachford method. Numer. Algorithms 78(3), 759\u2013776 (2018)","journal-title":"Numer. Algorithms"},{"issue":"2","key":"155_CR14","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.orl.2017.11.018","volume":"46","author":"R Behling","year":"2018","unstructured":"Behling, R., Bello-Cruz, J.Y., Santos, L.R.: On the linear convergence of the circumcentered\u2013reflection method. Oper. Res. Lett. 46(2), 159\u2013162 (2018)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"155_CR15","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1137\/141000671","volume":"59","author":"J Bezanson","year":"2017","unstructured":"Bezanson, J., Edelman, A., Karpinski, S., Shah, V.B.: Julia: a fresh approach to numerical computing. SIAM Rev. 59(1), 65\u201398 (2017)","journal-title":"SIAM Rev."},{"key":"155_CR16","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-1-5041-2940-4_9","volume-title":"Quality of Numerical Software","author":"RF Boisvert","year":"1997","unstructured":"Boisvert, R.F., Pozo, R., Remington, K., Barrett, R.F., Dongarra, J.J.: Matrix market: a web resource for test matrix collections. In: Boisvert, R.F. (ed.) Quality of Numerical Software, pp. 125\u2013137. Springer, Boston (1997)"},{"issue":"1","key":"155_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10957-013-0381-x","volume":"160","author":"JM Borwein","year":"2014","unstructured":"Borwein, J.M., Tam, M.K.: A cyclic Douglas\u2013Rachford iteration scheme. J. Optim. Theory Appl. 160(1), 1\u201329 (2014)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"155_CR18","first-page":"573","volume":"16","author":"JM Borwein","year":"2015","unstructured":"Borwein, J.M., Tam, M.K.: The cyclic Douglas\u2013Rachford method for inconsistent feasibility problems. J. Nonlinear Convex Anal. 16(4), 573\u2013584 (2015)","journal-title":"J. Nonlinear Convex Anal."},{"issue":"297","key":"155_CR19","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\u2013Rachford iteration for basis pursuit. Math. Comput. 85(297), 209\u2013238 (2016)","journal-title":"Math. Comput."},{"key":"155_CR20","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-94-015-8577-4_7","volume-title":"Approximation Theory, Wavelets and Applications","author":"FR Deutsch","year":"1995","unstructured":"Deutsch, F.R.: The angle between subspaces of a Hilbert space. In: Singh, S.P. (ed.) Approximation Theory, Wavelets and Applications, pp. 107\u2013130. Springer, Dordrecht (1995)"},{"key":"155_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-9298-9","volume-title":"Best Approximation in Inner Product Spaces. CMS Books in Mathematics","author":"FR Deutsch","year":"2001","unstructured":"Deutsch, F.R.: Best Approximation in Inner Product Spaces. CMS Books in Mathematics. Springer, New York (2001)"},{"issue":"1","key":"155_CR22","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s11075-017-0430-x","volume":"79","author":"PC Hansen","year":"2017","unstructured":"Hansen, P.C., J\u00f8rgensen, J.S.: AIR tools II: algebraic iterative reconstruction methods, improved implementation. Numer. Algorithms 79(1), 107\u2013137 (2017)","journal-title":"Numer. Algorithms"},{"key":"155_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-723-7","volume-title":"Fundamentals of Computerized Tomography, 2 edn. Advances in Pattern Recognition.","author":"GT Herman","year":"2009","unstructured":"Herman, G.T.: Fundamentals of Computerized Tomography, 2 edn. Advances in Pattern Recognition. Springer, Dordrecht (2009)"},{"issue":"4","key":"155_CR24","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(4), 2397\u20132419 (2013)","journal-title":"SIAM J. Optim."},{"issue":"18","key":"155_CR25","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\u2013Rachford for sparse affine feasibility. IEEE Trans. Signal Process. 62(18), 4868\u20134881 (2014)","journal-title":"IEEE Trans. Signal Process."},{"key":"155_CR26","unstructured":"Lindstrom, S.B., Sims, B.: Survey: sixty years of Douglas\u2013Rachford. arXiv:1809.07181 (2018)"},{"key":"155_CR27","unstructured":"Ouyang, H.: Circumcenter operators in Hilbert spaces. Master\u2019s Thesis, University of British Columbia, Okanagan (2018)"},{"issue":"3","key":"155_CR28","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TNS.1974.6499235","volume":"21","author":"LA Shepp","year":"1974","unstructured":"Shepp, L.A., Logan, B.F.: The fourier reconstruction of a head section. IEEE Trans. Nucl. Sci. 21(3), 21\u201343 (1974)","journal-title":"IEEE Trans. Nucl. Sci."},{"issue":"2","key":"155_CR29","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/s00041-008-9030-4","volume":"15","author":"T Strohmer","year":"2008","unstructured":"Strohmer, T., Vershynin, R.: A randomized Kaczmarz algorithm with exponential convergence. J. Fourier Anal. Appl. 15(2), 262\u2013278 (2008)","journal-title":"J. Fourier Anal. Appl."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00155-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-019-00155-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00155-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,23]],"date-time":"2023-09-23T00:59:30Z","timestamp":1695430770000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-019-00155-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,15]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["155"],"URL":"https:\/\/doi.org\/10.1007\/s10589-019-00155-0","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2019,11,15]]},"assertion":[{"value":"27 February 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 November 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}