{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:41:19Z","timestamp":1740123679896,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,7,11]],"date-time":"2020-07-11T00:00:00Z","timestamp":1594425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,7,11]],"date-time":"2020-07-11T00:00:00Z","timestamp":1594425600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2021,5]]},"DOI":"10.1007\/s11075-020-00966-x","type":"journal-article","created":{"date-parts":[[2020,7,11]],"date-time":"2020-07-11T14:02:55Z","timestamp":1594476175000},"page":"263-297","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["On the linear convergence of circumcentered isometry methods"],"prefix":"10.1007","volume":"87","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4155-9930","authenticated-orcid":false,"given":"Heinz H.","family":"Bauschke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Ouyang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xianfu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,11]]},"reference":[{"key":"966_CR1","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. Theor. 185, 63\u201379 (2014)","journal-title":"J. Approx. Theor."},{"key":"966_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/conm\/204\/02620","volume":"204","author":"HH Bauschke","year":"1997","unstructured":"Bauschke, H.H., Borwein, J.M., Lewis, A.S.: The method of cyclic projections for closed convex sets in Hilbert space, Recent Developments in Optimization Theory and Nonlinear Analysis (Jerusalem 1995). Contemp. Math. 204, 1\u201338 (1997)","journal-title":"Contemp. Math."},{"key":"966_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48311-5","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces, 2nd edn. Springer, New York (2017)","edition":"2nd edn."},{"key":"966_CR4","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. Am. Math. Soc. 355, 3433\u20133461 (2003)","journal-title":"Trans. Am. Math. Soc."},{"key":"966_CR5","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, 271\u2013295 (2018)","journal-title":"Linear Nonlinear Anal."},{"unstructured":"Bauschke, H.H., Ouyang, H., Wang, X.: On circumcenter mappings induced by nonexpansive operators, pure and applied functional analysis, In press (2020)","key":"966_CR6"},{"unstructured":"Bauschke, H.H., Ouyang, H., Wang, X.: Circumcentered methods induced by isometries, to appear in Vietnam Journal of Mathematics. arXiv:https:\/\/arxiv.org\/abs\/1908.11576 (2019)","key":"966_CR7"},{"key":"966_CR8","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, 759\u2013776 (2018)","journal-title":"Numer. Algorithms"},{"key":"966_CR9","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, 159\u2013162 (2018)","journal-title":"Oper. Res. Lett."},{"key":"966_CR10","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, 675\u2013699 (2020)","journal-title":"Comput. Optim. Appl."},{"unstructured":"Behling, R., Bello Cruz, J.Y., Santos, L.-R.: On the circumcentered-reflection method for the convex feasibility problem. arXiv:https:\/\/arxiv.org\/abs\/2001.01773(2020)","key":"966_CR11"},{"unstructured":"Deutsch, F.: Best Approximation in Inner Product Spaces. Springer (2012)","key":"966_CR12"},{"unstructured":"Dizon, N., Hogan, J., Lindstrom, S.B.: Circumcentering reflection methods for nonconvex feasibility problems. arXiv:https:\/\/arxiv.org\/abs\/1910.04384 (2019)","key":"966_CR13"},{"key":"966_CR14","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. Comput. Appl. Math. 26, 235\u2013249 (1989)","journal-title":"J. Comput. Appl. Math."},{"key":"966_CR15","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 Comput. Math. Math. Phys. 7, 1\u201324 (1967)","journal-title":"USSR Comput. Math. Math. Phys."},{"unstructured":"Kreyszig, E.: Introductory Functional Analysis with Applications. Wiley (1989)","key":"966_CR16"},{"unstructured":"Lindstrom, S.B.: Computable centering methods for spiraling algorithms and their duals, with motivations from the theory of Lyapunov functions. arXiv:https:\/\/arxiv.org\/abs\/2001.10784 (2020)","key":"966_CR17"},{"key":"966_CR18","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719512","volume-title":"Matrix analysis and applied linear algebra","author":"C Meyer","year":"2000","unstructured":"Meyer, C.: Matrix analysis and applied linear algebra. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA (2000)"},{"doi-asserted-by":"crossref","unstructured":"Zarantonello, E.H.: Projections on convex sets in Hilbert space and spectral theory. I. Projections on convex sets. In: Contributions to Nonlinear Functional Analysis, Academic Press, pp 237\u2013424 (1971)","key":"966_CR19","DOI":"10.1016\/B978-0-12-775850-3.50013-3"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-020-00966-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-020-00966-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-020-00966-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,10]],"date-time":"2021-07-10T23:31:02Z","timestamp":1625959862000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-020-00966-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,11]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,5]]}},"alternative-id":["966"],"URL":"https:\/\/doi.org\/10.1007\/s11075-020-00966-x","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"type":"print","value":"1017-1398"},{"type":"electronic","value":"1572-9265"}],"subject":[],"published":{"date-parts":[[2020,7,11]]},"assertion":[{"value":"3 December 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 June 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 July 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}