{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T11:09:30Z","timestamp":1771326570046,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,2,7]],"date-time":"2019-02-07T00:00:00Z","timestamp":1549497600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,2,7]],"date-time":"2019-02-07T00:00:00Z","timestamp":1549497600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["216877-2013"],"award-info":[{"award-number":["216877-2013"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"crossref","award":["DP160101537"],"award-info":[{"award-number":["DP160101537"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1007\/s10898-019-00744-7","type":"journal-article","created":{"date-parts":[[2019,2,7]],"date-time":"2019-02-07T07:51:45Z","timestamp":1549525905000},"page":"79-93","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["The Douglas\u2013Rachford algorithm for a hyperplane and a doubleton"],"prefix":"10.1007","volume":"74","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4155-9930","authenticated-orcid":false,"given":"Heinz H.","family":"Bauschke","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8074-6675","authenticated-orcid":false,"given":"Minh N.","family":"Dao","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4287-4788","authenticated-orcid":false,"given":"Scott B.","family":"Lindstrom","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,7]]},"reference":[{"issue":"3","key":"744_CR1","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)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"744_CR2","doi-asserted-by":"publisher","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":"744_CR3","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 projections algorithms for solving convex feasibility problems. SIAM Rev. 38(3), 367\u2013426 (1996)","journal-title":"SIAM Rev."},{"key":"744_CR4","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":"2"},{"key":"744_CR5","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.jat.2004.02.006","volume":"127","author":"HH Bauschke","year":"2004","unstructured":"Bauschke, H.H., Combettes, P.L., Luke, D.R.: Finding best approximation pairs relative to two closed convex sets in Hilbert spaces. J. Approx. Theory 127, 178\u2013192 (2004)","journal-title":"J. Approx. Theory"},{"issue":"1","key":"744_CR6","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1137\/16M1071079","volume":"27","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H.H., Dao, M.N.: On the finite convergence of the Douglas\u2013Rachford algorithm for solving (not necessarily convex) feasibility problems in Euclidean spaces. SIAM J. Optim. 27(1), 507\u2013537 (2017)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"744_CR7","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/j.orl.2016.03.010","volume":"44","author":"HH Bauschke","year":"2016","unstructured":"Bauschke, H.H., Dao, M.N., Moursi, W.M.: The Douglas\u2013Rachford algorithm in the affine-convex case. Oper. Res. Lett. 44(3), 379\u2013382 (2016)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"744_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\u2013Rachford algorithm and alternating projections: a case study. J. Convex Anal. 23(1), 237\u2013261 (2016)","journal-title":"J. Convex Anal."},{"issue":"2","key":"744_CR9","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s10898-015-0373-5","volume":"65","author":"HH Bauschke","year":"2016","unstructured":"Bauschke, H.H., Dao, M.N., Noll, D., Phan, H.M.: On Slater\u2019s condition and finite convergence of the Douglas\u2013Rachford algorithm for solving convex feasibility problems in Euclidean spaces. J. Glob. Optim. 65(2), 329\u2013349 (2016)","journal-title":"J. Glob. Optim."},{"issue":"1\u20132","key":"744_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. Ser. A 164(1\u20132), 263\u2013284 (2017)","journal-title":"Math. Program. Ser. A"},{"issue":"6","key":"744_CR11","doi-asserted-by":"publisher","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":"2","key":"744_CR12","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)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"744_CR13","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s11228-017-0457-0","volume":"26","author":"JM Borwein","year":"2018","unstructured":"Borwein, J.M., Lindstrom, S.B., Sims, B., Schneider, A., Skerritt, M.P.: Dynamics of the Douglas\u2013Rachford method for ellipses and $$p$$-spheres. Set Valued Anal. 26(2), 385\u2013403 (2018)","journal-title":"Set Valued Anal."},{"key":"744_CR14","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-1-4419-9569-8_6","volume-title":"Fixed-Point Algorithms for Inverse Problems in Science and Engineering","author":"JM Borwein","year":"2011","unstructured":"Borwein, J.M., Sims, B.: The Douglas-Rachford 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, pp. 93\u2013109. Springer, New York (2011)"},{"issue":"5\u20136","key":"744_CR15","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1080\/02331930412331327157","volume":"53","author":"PL Combettes","year":"2004","unstructured":"Combettes, P.L.: Solving monotone inclusions via compositions of nonexpansive averaged operators. Optimization 53(5\u20136), 475\u2013504 (2004)","journal-title":"Optimization"},{"key":"744_CR16","doi-asserted-by":"publisher","unstructured":"Dao, M.N., Phan, H.M.: Linear convergence of projection algorithms. Math. Oper. Res. (2018). https:\/\/doi.org\/10.1287\/moor.2018.0942","DOI":"10.1287\/moor.2018.0942"},{"issue":"3","key":"744_CR17","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s10898-018-0654-x","volume":"72","author":"MN Dao","year":"2018","unstructured":"Dao, M.N., Phan, H.M.: Linear convergence of the generalized Douglas\u2013Rachford algorithm for feasibility problems. J. Glob. Optim. 72(3), 443\u2013474 (2018)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"744_CR18","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10898-018-0677-3","volume":"73","author":"MN Dao","year":"2019","unstructured":"Dao, M.N., Tam, M.K.: A Lyapunov-type approach to convergence of the Douglas\u2013Rachford algorithm. J. Glob. Optim. 73(1), 83\u2013112 (2019)","journal-title":"J. Glob. Optim."},{"key":"744_CR19","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, H.H.: On the numerical solution of heat conduction problems in two and three space variables. Trans. Am. Math. Soc. 82, 421\u2013439 (1956)","journal-title":"Trans. Am. Math. Soc."},{"issue":"3","key":"744_CR20","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/BF01581204","volume":"55","author":"J Eckstein","year":"1992","unstructured":"Eckstein, J., Bertsekas, D.P.: On the Douglas\u2013Rachford splitting method and the proximal point algorithm for maximal monotone operators. Math. Program. Ser. A 55(3), 293\u2013318 (1992)","journal-title":"Math. Program. Ser. A"},{"issue":"2","key":"744_CR21","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1073\/pnas.0606359104","volume":"104","author":"V Elser","year":"2007","unstructured":"Elser, V., Rankenburg, I., Thibault, P.: Searching with iterated maps. Proc. Natl. Acad. Sci. USA 104(2), 418\u2013423 (2007)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"issue":"3","key":"744_CR22","doi-asserted-by":"publisher","first-page":"036706","DOI":"10.1103\/PhysRevE.78.036706","volume":"78","author":"S Gravel","year":"2008","unstructured":"Gravel, S., Elser, V.: Divide and concur: a general approach to constraint satisfaction. Phys. Rev. E 78(3), 036706 (2008)","journal-title":"Phys. Rev. E"},{"key":"744_CR23","doi-asserted-by":"crossref","DOI":"10.1515\/9780691247670","volume-title":"The Irrationals","author":"J Havil","year":"2012","unstructured":"Havil, J.: The Irrationals. Princeton University Press, Princeton (2012)"},{"key":"744_CR24","unstructured":"Lamichhane, B.P., Lindstrom, S.B., Sims, B.: Application of projection algorithms to differential equations: boundary value problems (2017). arXiv:1705.11032"},{"key":"744_CR25","unstructured":"Lindstrom, S.B., Sims, B.: Survey: Sixty years of Douglas\u2013Rachford (2018). https:\/\/arxiv.org\/abs\/1809.07181"},{"issue":"3","key":"744_CR26","first-page":"347","volume":"18","author":"SB Lindstrom","year":"2017","unstructured":"Lindstrom, S.B., Sims, B., Skerritt, M.: Computing intersections of implicitly specified plane curves. J. Nonlinear Convex Anal. 18(3), 347\u2013359 (2017)","journal-title":"J. Nonlinear Convex Anal."},{"issue":"6","key":"744_CR27","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1137\/0716071","volume":"16","author":"P-L Lions","year":"1979","unstructured":"Lions, P.-L., 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."},{"key":"744_CR28","unstructured":"On-Line Encyclopedia of Integer Sequences. https:\/\/oeis.org\/A188037 . Accessed 19 Jan 2019"},{"key":"744_CR29","unstructured":"On-Line Encyclopedia of Integer Sequences. https:\/\/oeis.org\/A074840 . Accessed 19 Jan 2019"},{"key":"744_CR30","unstructured":"On-Line Encyclopedia of Integer Sequences. https:\/\/oeis.org\/A097508 . Accessed 19 Jan 2019"},{"issue":"2","key":"744_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)","journal-title":"Optimization"},{"issue":"1","key":"744_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)","journal-title":"Math. Program."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-019-00744-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00744-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00744-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T12:48:34Z","timestamp":1694609314000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-019-00744-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,7]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["744"],"URL":"https:\/\/doi.org\/10.1007\/s10898-019-00744-7","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2,7]]},"assertion":[{"value":"20 August 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 January 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 February 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}