{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:24:32Z","timestamp":1740122672964,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,4,19]],"date-time":"2021-04-19T00:00:00Z","timestamp":1618790400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,19]],"date-time":"2021-04-19T00:00:00Z","timestamp":1618790400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/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":[[2021,6]]},"DOI":"10.1007\/s10589-021-00275-6","type":"journal-article","created":{"date-parts":[[2021,4,19]],"date-time":"2021-04-19T17:03:34Z","timestamp":1618851814000},"page":"507-530","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["The circumcentered-reflection method achieves better rates than alternating projections"],"prefix":"10.1007","volume":"79","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9885-2532","authenticated-orcid":false,"given":"Reza","family":"Arefidamghani","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5473-4654","authenticated-orcid":false,"given":"Roger","family":"Behling","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7877-5688","authenticated-orcid":false,"given":"Yunier","family":"Bello-Cruz","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5748-2501","authenticated-orcid":false,"given":"Alfredo N.","family":"Iusem","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":[[2021,4,19]]},"reference":[{"key":"275_CR1","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s00186-019-00691-9","volume":"91","author":"FJ Arag\u00f3n Artacho","year":"2020","unstructured":"Arag\u00f3n Artacho, F.J., Campoy, R., Tam, M.K.: The Douglas-Rachford algorithm for convex and nonconvex feasibility problems. Math. Methods Oper. Res. 91, 201\u2013240 (2020). https:\/\/doi.org\/10.1007\/s00186-019-00691-9","journal-title":"Math. Methods Oper. Res."},{"issue":"1","key":"275_CR2","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-Rachford methods for two subspaces. Numer. Algorithms 73(1), 33\u201376 (2016). https:\/\/doi.org\/10.1007\/s11075-015-0085-4","journal-title":"Numer. Algorithms"},{"issue":"2","key":"275_CR3","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). https:\/\/doi.org\/10.1007\/BF01027691","journal-title":"Set Valued Anal."},{"issue":"3","key":"275_CR4","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(3), 367\u2013426 (1996). https:\/\/doi.org\/10.1137\/S0036144593251710","journal-title":"SIAM Rev."},{"key":"275_CR5","doi-asserted-by":"publisher","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces, 2nd edn. CMS Books in Mathematics, Springer International Publishing (2017). https:\/\/doi.org\/10.1007\/978-3-319-48311-5","DOI":"10.1007\/978-3-319-48311-5"},{"issue":"1","key":"275_CR6","first-page":"237","volume":"23","author":"HH Bauschke","year":"2016","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. 23(1), 237\u2013261 (2016)","journal-title":"J. Convex Anal."},{"issue":"2","key":"275_CR7","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":"275_CR8","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s10013-020-00417-z","volume":"48","author":"HH Bauschke","year":"2020","unstructured":"Bauschke, H.H., Ouyang, H., Wang, X.: Circumcentered methods induced by isometries. Vietnam J. Math. 48, 471\u2013508 (2020)","journal-title":"Vietnam J. Math."},{"key":"275_CR9","unstructured":"Bauschke, H.H., Ouyang, H., Wang, X.: On circumcenter mappings induced by nonexpansive operators. Pure and Applied Functional Analysis\u00a06(2), 257\u2013288 (2021)"},{"key":"275_CR10","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s11075-020-00966-x","volume":"87","author":"HH Bauschke","year":"2021","unstructured":"Bauschke, H.H., Ouyang, H., Wang, X.: On the linear convergence of circumcentered isometry methods. Numer. Algorithm 87, 263\u2013297 (2021). https:\/\/doi.org\/10.1007\/s11075-020-00966-x","journal-title":"Numer. Algorithm"},{"issue":"3","key":"275_CR11","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-Rachford method. Numer. Algorithm 78(3), 759\u2013776 (2018). https:\/\/doi.org\/10.1007\/s11075-017-0399-5","journal-title":"Circumcentering the Douglas-Rachford method. Numer. Algorithm"},{"issue":"2","key":"275_CR12","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-reflection method. Oper. Res. Lett. 46(2), 159\u2013162 (2018). https:\/\/doi.org\/10.1016\/j.orl.2017.11.018","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"275_CR13","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/s10589-019-00155-0","volume":"76","author":"R Behling","year":"2020","unstructured":"Behling, R., Bello-Cruz, J.Y., Santos, L.R.: The block-wise circumcentered- reflection method. Comput. Optim. Appl. 76(3), 675\u2013699 (2020). https:\/\/doi.org\/10.1007\/s10589-019-00155-0","journal-title":"Comput. Optim. Appl."},{"key":"275_CR14","doi-asserted-by":"publisher","first-page":"1475","DOI":"10.1007\/s11075-020-00941-6","volume":"86","author":"R Behling","year":"2021","unstructured":"Behling, R., Bello-Cruz, J.Y., Santos, L.R.: On the circumcentered-reflection method for the convex feasibility problem. Numer. Algorithms 86, 1475\u20131494 (2021). https:\/\/doi.org\/10.1007\/s11075-020-00941-6","journal-title":"Numer. Algorithms"},{"issue":"8","key":"275_CR15","doi-asserted-by":"publisher","first-page":"1397","DOI":"10.1080\/02331934.2016.1200578","volume":"66","author":"R Behling","year":"2017","unstructured":"Behling, R., Fischer, A., Haeser, G., Ramos, A., Sch\u00f6nefeld, K.: On the constrained error bound condition and the projected Levenberg-Marquardt method. Optimization 66(8), 1397\u20131411 (2017). https:\/\/doi.org\/10.1080\/02331934.2016.1200578","journal-title":"Optimization"},{"issue":"3","key":"275_CR16","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.1007\/s10957-019-01586-9","volume":"183","author":"R Behling","year":"2019","unstructured":"Behling, R., Gon\u00e7alves, D.S., Santos, S.A.: Local convergence analysis of the Levenberg-Marquardt framework for nonzero-residue nonlinear least-squares problems under an error bound condition. J. Optim. Theory Appl. 183(3), 1099\u20131122 (2019). https:\/\/doi.org\/10.1007\/s10957-019-01586-9","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"275_CR17","doi-asserted-by":"publisher","first-page":"448","DOI":"10.2307\/2032864","volume":"10","author":"W Cheney","year":"1959","unstructured":"Cheney, W., Goldstein, A.A.: Proximity maps for convex sets. Proc. Am. Math. Soc. 10(3), 448\u2013450 (1959). https:\/\/doi.org\/10.2307\/2032864","journal-title":"Proc. Am. Math. Soc."},{"key":"275_CR18","unstructured":"Cimmino, G.: Calcolo approssimato per le soluzioni dei sistemi di equazioni lineari. La Ricerca Scientifica 9(II), 326\u2013333 (1938)"},{"key":"275_CR19","unstructured":"Dizon, N., Hogan, J., Lindstrom, S.B.: Circumcentering reflection methods for nonconvex feasibility problems. arXiv (2019).\u00a0https:\/\/arxiv.org\/abs\/1910.04384"},{"key":"275_CR20","unstructured":"Kaczmarz, S.: Angen\u00e4herte Aufl\u00f6sung von Systemen linearer Gleichungen. Bull. Int. Acad. Pol. Sci. Lett. Class. Sci. Math. Nat. A 35, 355\u2013357 (1937)"},{"issue":"1","key":"275_CR21","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). https:\/\/doi.org\/10.1007\/BF02551235","journal-title":"Math. Control Signal Syst."},{"issue":"1","key":"275_CR22","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/BF02612715","volume":"28","author":"G Pierra","year":"1984","unstructured":"Pierra, G.: Decomposition through formalization in a product space. Math. Program. 28(1), 96\u2013115 (1984). https:\/\/doi.org\/10.1007\/BF02612715","journal-title":"Math. Program."},{"key":"275_CR23","doi-asserted-by":"publisher","unstructured":"von Neumann, J.: Functional Operators: The Geometry of Orthogonal Spaces, Annals of Mathematics Studies, vol. 2, no.\u00a022. Princeton University Press, Princeton (1950). https:\/\/doi.org\/10.2307\/j.ctt1bc543b","DOI":"10.2307\/j.ctt1bc543b"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00275-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-021-00275-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00275-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,6]],"date-time":"2021-05-06T16:14:53Z","timestamp":1620317693000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-021-00275-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,19]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["275"],"URL":"https:\/\/doi.org\/10.1007\/s10589-021-00275-6","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2021,4,19]]},"assertion":[{"value":"28 July 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 March 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}