{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T23:20:16Z","timestamp":1776122416568,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"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":"crossref","award":["304392\/2018-9"],"award-info":[{"award-number":["304392\/2018-9"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["429915\/2018-7"],"award-info":[{"award-number":["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":["Numer Algor"],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1007\/s11075-020-00941-6","type":"journal-article","created":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T08:34:56Z","timestamp":1596270896000},"page":"1475-1494","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["On the circumcentered-reflection method for the convex feasibility problem"],"prefix":"10.1007","volume":"86","author":[{"given":"Roger","family":"Behling","sequence":"first","affiliation":[]},{"given":"Yunier","family":"Bello-Cruz","sequence":"additional","affiliation":[]},{"given":"Luiz-Rafael","family":"Santos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,1]]},"reference":[{"issue":"1","key":"941_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-002-0339-5","volume":"95","author":"F Alizadeh","year":"2003","unstructured":"Alizadeh, F., Goldfarb, D.: Second-order cone programming. Math. Program. Ser. B 95(1), 3\u201351 (2003). https:\/\/doi.org\/10.1007\/s10107-002-0339-5","journal-title":"Math. Program. Ser. B"},{"issue":"3","key":"941_CR2","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1007\/s10898-012-9958-4","volume":"57","author":"FJ Arag\u00f3n Artacho","year":"2013","unstructured":"Arag\u00f3n Artacho, F. J., Borwein, J. M.: Global convergence of a non-convex Douglas\u2013Rachford iteration. J. Glob. Optim. 57(3), 753\u2013769 (2013). https:\/\/doi.org\/10.1007\/s10898-012-9958-4","journal-title":"J. Glob. Optim."},{"key":"941_CR3","doi-asserted-by":"publisher","unstructured":"Arag\u00f3n Artacho, F. J., Campoy, R., Tam, M. K.: The Douglas\u2013Rachford algorithm for convex and nonconvex feasibility problems. Math Meth Oper Res. https:\/\/doi.org\/10.1007\/s00186-019-00691-9 (2019)","DOI":"10.1007\/s00186-019-00691-9"},{"key":"941_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.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). https:\/\/doi.org\/10.1016\/j.jat.2014.06.002","journal-title":"J. Approx. Theory"},{"issue":"1","key":"941_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.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":"3","key":"941_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). https:\/\/doi.org\/10.1137\/S0036144593251710","journal-title":"SIAM Rev."},{"key":"941_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48311-5","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces, 2 edn. CMS Books in Mathematics","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H. H., Combettes, P. L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces, 2 edn. CMS Books in Mathematics. Springer International Publishing, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-48311-5"},{"issue":"1","key":"941_CR8","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":"941_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). https:\/\/doi.org\/10.1137\/15M1016989","journal-title":"SIAM J. Optim."},{"issue":"1","key":"941_CR10","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10107-016-1086-3","volume":"164","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H. H., Moursi, W. M.: On the Douglas\u2013Rachford algorithm. Math. Program. 164(1), 263\u2013284 (2017). https:\/\/doi.org\/10.1007\/s10107-016-1086-3","journal-title":"Math. Program."},{"issue":"1","key":"941_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jmaa.2014.06.075","volume":"421","author":"HH Bauschke","year":"2015","unstructured":"Bauschke, H. H., Noll, D., Phan, H. M.: Linear and strong convergence of algorithms involving averaged nonexpansive operators. J. Math. Anal. Appl. 421(1), 1\u201320 (2015). https:\/\/doi.org\/10.1016\/j.jmaa.2014.06.075","journal-title":"J. Math. Anal. Appl."},{"issue":"2","key":"941_CR12","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":"941_CR13","unstructured":"Bauschke, H. H., Ouyang, H., Wang, X.: Circumcentered methods induced by isometries. arXiv:1908.11576 (2019)"},{"key":"941_CR14","unstructured":"Bauschke, H. H., Ouyang, H., Wang, X.: On circumcenter mappings induced by nonexpansive operators. Pure and Applied Functional Analysis (in press) (2020)"},{"key":"941_CR15","doi-asserted-by":"crossref","unstructured":"Bauschke, H. H., Ouyang, H., Wang, X.: On the linear convergence of circumcentered isometry methods. arXiv:1912.01063 (2019)","DOI":"10.1007\/s11075-020-00966-x"},{"issue":"3","key":"941_CR16","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). https:\/\/doi.org\/10.1007\/s11075-017-0399-5","journal-title":"Numer. Algorithms"},{"issue":"2","key":"941_CR17","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."},{"key":"941_CR18","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\u2013reflection method. Comput. Optim. Appl. 76, 675\u2013699 (2020). https:\/\/doi.org\/10.1007\/s10589-019-00155-0","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"941_CR19","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s10898-015-0296-1","volume":"63","author":"J Benoist","year":"2015","unstructured":"Benoist, J.: The Douglas\u2013Rachford algorithm for the case of the sphere and the line. J. Glob. Optim. 63(2), 363\u2013380 (2015). https:\/\/doi.org\/10.1007\/s10898-015-0296-1","journal-title":"J. Glob. Optim."},{"key":"941_CR20","doi-asserted-by":"publisher","unstructured":"Borwein, J.M., Sims, B.: The Douglas\u2013Rachford algorithm in the absence of convexity. In: Bauschke, H.H., Burachik, R.S., Combettes, P.L., Elser, V., Luke, D.R., Wolkowicz, H. (eds.) Fixed-Point Algorithms for Inverse Problems in Science and Engineering. https:\/\/doi.org\/10.1007\/978-1-4419-9569-8_6. Series Title: Springer Optimization and Its Applications, vol. 49, pp 93\u2013109. Springer, New York (2011)","DOI":"10.1007\/978-1-4419-9569-8_6"},{"issue":"1","key":"941_CR21","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). https:\/\/doi.org\/10.1007\/s10957-013-0381-x","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"941_CR22","first-page":"573","volume":"16","author":"JM Borwein","year":"2015","unstructured":"Borwein, J. M., Tam, M. K.: The cyclic Douglas-Rachford method for inconsistent feasibility problems. J. Nonlinear Convex Anal. Int. J. 16 (4), 573\u2013584 (2015)","journal-title":"J. Nonlinear Convex Anal. Int. J."},{"issue":"2","key":"941_CR23","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s10107-014-0767-z","volume":"150","author":"F Cucker","year":"2015","unstructured":"Cucker, F., Pe\u00f1a, J., Roshchina, V.: Solving second-order conic systems with variable precision. Math. Program. 150(2), 217\u2013250 (2015). https:\/\/doi.org\/10.1007\/s10107-014-0767-z","journal-title":"Math. Program."},{"key":"941_CR24","unstructured":"Dizon, N., Hogan, J., Lindstrom, S.B.: Circumcentering reflection methods for nonconvex feasibility problems. arXiv:1910.04384 (2019)"},{"issue":"2","key":"941_CR25","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E. D., Mor\u00e9, J. J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2), 201\u2013213 (2002). https:\/\/doi.org\/10.1007\/s101070100263","journal-title":"Math. Program."},{"issue":"2","key":"941_CR26","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 Jr., H. H.: On the numerical solution of heat conduction problems in two and three space variables. Trans. Am. Math. Soc. 82 (2), 421\u2013421 (1956). https:\/\/doi.org\/10.1090\/S0002-9947-1956-0084194-4","journal-title":"Trans. Am. Math. Soc."},{"key":"941_CR27","unstructured":"Euclid, H.T.L.: The Thirteen Books of Euclid\u2019s Elements, 2nd edn., vol. II. Dover Publications, Inc., New York (1956)"},{"key":"941_CR28","unstructured":"Lindstrom, S. B., Sims, B.: Survey: Sixty years of Douglas\u2013Rachford. arXiv:1809.07181 (2018)"},{"issue":"1-3","key":"941_CR29","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0024-3795(98)10032-0","volume":"284","author":"MS Lobo","year":"1998","unstructured":"Lobo, M. S., Vandenberghe, L., Boyd, S., Lebret, H.: Applications of second-order cone programming. Linear Algebra Appl. 284(1-3), 193\u2013228 (1998). https:\/\/doi.org\/10.1016\/S0024-3795(98)10032-0","journal-title":"Linear Algebra Appl."},{"key":"941_CR30","doi-asserted-by":"publisher","unstructured":"Ouyang, H.: Circumcenter operators in Hilbert spaces. Master Thesis, University of British Columbia, Okanagan CA. https:\/\/doi.org\/10.14288\/1.0371095 (2018)","DOI":"10.14288\/1.0371095"},{"issue":"2","key":"941_CR31","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1080\/02331934.2015.1051532","volume":"65","author":"HM Phan","year":"2016","unstructured":"Phan, H. M.: Linear convergence of the Douglas\u2013Rachford method for two closed sets. Optimization 65(2), 369\u2013385 (2016). https:\/\/doi.org\/10.1080\/02331934.2015.1051532","journal-title":"Optimization"},{"issue":"1","key":"941_CR32","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."},{"issue":"1","key":"941_CR33","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1137\/100788100","volume":"49","author":"BF Svaiter","year":"2011","unstructured":"Svaiter, B. F.: On weak convergence of the Douglas\u2013Rachford method. SIAM J. Control Optim. 49(1), 280\u2013287 (2011). https:\/\/doi.org\/10.1137\/100788100","journal-title":"SIAM J. Control Optim."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-020-00941-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-020-00941-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-020-00941-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,5]],"date-time":"2022-11-05T11:19:25Z","timestamp":1667647165000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-020-00941-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,1]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["941"],"URL":"https:\/\/doi.org\/10.1007\/s11075-020-00941-6","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8,1]]},"assertion":[{"value":"6 January 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 August 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}