{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T01:40:42Z","timestamp":1775094042654,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,8,22]],"date-time":"2017-08-22T00:00:00Z","timestamp":1503360000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s11075-017-0399-5","type":"journal-article","created":{"date-parts":[[2017,8,21]],"date-time":"2017-08-21T22:16:48Z","timestamp":1503353808000},"page":"759-776","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["Circumcentering the Douglas\u2013Rachford method"],"prefix":"10.1007","volume":"78","author":[{"given":"Roger","family":"Behling","sequence":"first","affiliation":[]},{"given":"Jos\u00e9 Yunier","family":"Bello Cruz","sequence":"additional","affiliation":[]},{"given":"Luiz-Rafael","family":"Santos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,22]]},"reference":[{"issue":"1","key":"399_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10957-013-0488-0","volume":"163","author":"FJ Arag\u00f3n Artacho","year":"2014","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 (2014)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"399_CR2","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/s10898-015-0380-6","volume":"65","author":"FJ Arag\u00f3n Artacho","year":"2016","unstructured":"Arag\u00f3n Artacho, F.J., Borwein, J.M., Tam, M.K.: Global behavior of the Douglas\u2013Rachford method for a nonconvex feasibility problem. J. Glob. Optim. 65(2), 309\u2013327 (2016)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"399_CR3","doi-asserted-by":"crossref","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)","journal-title":"J. Glob. Optim."},{"key":"399_CR4","doi-asserted-by":"crossref","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":"399_CR5","doi-asserted-by":"crossref","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. Algor. 73(1), 33\u201376 (2016)","journal-title":"Numer. Algor."},{"issue":"3","key":"399_CR6","doi-asserted-by":"crossref","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."},{"key":"399_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-48311-5","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces, 1 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, 1 edn. CMS Books in Mathematics. Springer International Publishing, Cham (2017)"},{"issue":"1-2","key":"399_CR8","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s10107-016-1086-3","volume":"164","author":"HH Bauschke","year":"2016","unstructured":"Bauschke, H.H., Moursi, W.M.: On the Douglas\u2013Rachford algorithm. Math. Program. 164(1-2), 263\u2013284 (2016)","journal-title":"Math. Program."},{"issue":"6","key":"399_CR9","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1007\/s00013-014-0652-2","volume":"102","author":"HH Bauschke","year":"2014","unstructured":"Bauschke, H.H., Noll, D.: On the local convergence of the Douglas\u2013Rachford algorithm. Arch. Math. 102(6), 589\u2013600 (2014)","journal-title":"Arch. Math."},{"issue":"1","key":"399_CR10","doi-asserted-by":"crossref","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)","journal-title":"J. Math. Anal. Appl."},{"issue":"2","key":"399_CR11","doi-asserted-by":"crossref","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)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"399_CR12","doi-asserted-by":"crossref","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":"399_CR13","doi-asserted-by":"crossref","unstructured":"Borwein, J.M., Sims, B.: The Douglas\u2013Rachford algorithm in the absence of convexity. In: Fixed-Point Algorithms for Inverse Problems in Science and Engineering, pp. 93\u2013109. Springer, New York (2011)","DOI":"10.1007\/978-1-4419-9569-8_6"},{"issue":"1","key":"399_CR14","doi-asserted-by":"crossref","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":"11","key":"399_CR15","doi-asserted-by":"crossref","first-page":"2343","DOI":"10.1080\/02331934.2014.957701","volume":"64","author":"Y Censor","year":"2014","unstructured":"Censor, Y., Cegielski, A.: Projection methods: an annotated bibliography of books and reviews. Optimization 64(11), 2343\u20132358 (2014)","journal-title":"Optimization"},{"issue":"II","key":"399_CR16","first-page":"326","volume":"9","author":"G Cimmino","year":"1938","unstructured":"Cimmino, G.: Calcolo approssimato per le soluzioni dei sistemi di equazioni lineari. Ric. Sci. 9(II), 326\u2013333 (1938)","journal-title":"Ric. Sci."},{"issue":"2","key":"399_CR17","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/5.214546","volume":"81","author":"PL Combettes","year":"1993","unstructured":"Combettes, P.L.: The foundations of set theoretic estimation. Proc. IEEE 81 (2), 182\u2013208 (1993)","journal-title":"Proc. IEEE"},{"key":"399_CR18","unstructured":"Deutsch, F.R.: Rate of convergence of the method of alternating projections. In: Brosowski, B., Deutsch, F. R. (eds.) Parametric Optimization and Approximation: Conference Held at the Mathematisches Forschungsinstitut, Oberwolfach, October 16\u201322, 1983, pp. 96\u2013107. Basel, Birkh\u00e4user (1985)"},{"key":"399_CR19","doi-asserted-by":"crossref","unstructured":"Deutsch, F.R.: The angle between subspaces of a hilbert space. In: Approximation Theory, Wavelets and Applications, pp. 107\u2013130. Springer, Dordrecht (1995)","DOI":"10.1007\/978-94-015-8577-4_7"},{"key":"399_CR20","doi-asserted-by":"crossref","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":"2","key":"399_CR21","doi-asserted-by":"crossref","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)","journal-title":"Math. Program."},{"issue":"2","key":"399_CR22","doi-asserted-by":"crossref","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. Am. Math. Soc. 82(2), 421\u2013421 (1956)","journal-title":"Trans. Am. Math. Soc."},{"key":"399_CR23","unstructured":"Feuers\u00e4nger, C.: PGFPlots Package, 1.13 edn (2016)"},{"issue":"4","key":"399_CR24","doi-asserted-by":"crossref","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":"399_CR25","doi-asserted-by":"crossref","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-Rachford for sparse affine feasibility. IEEE Trans. Signal Process. 62(18), 4868\u20134881 (2014)","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"399_CR26","doi-asserted-by":"crossref","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 Signals Syst. 1(1), 43\u201359 (1988)","journal-title":"Math. Control Signals Syst."},{"issue":"6","key":"399_CR27","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1137\/0716071","volume":"16","author":"P Lions","year":"1979","unstructured":"Lions, P., 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":"399_CR28","doi-asserted-by":"crossref","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)","journal-title":"Optimization"},{"issue":"e12","key":"399_CR29","first-page":"5","volume":"4","author":"AS Siqueira","year":"2016","unstructured":"Siqueira, A.S., da Silva, R.C., Santos, L.R.: Perprof-py: A python package for performance profile of mathematical optimization software. J Open Res Softw 4(e12), 5 (2016)","journal-title":"J Open Res Softw"},{"issue":"1","key":"399_CR30","doi-asserted-by":"crossref","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)","journal-title":"SIAM J. Control. Optim."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-017-0399-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-017-0399-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-017-0399-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T13:01:59Z","timestamp":1570021319000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-017-0399-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,22]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["399"],"URL":"https:\/\/doi.org\/10.1007\/s11075-017-0399-5","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,8,22]]}}}