{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T17:07:13Z","timestamp":1776877633941,"version":"3.51.2"},"reference-count":68,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,11,26]],"date-time":"2019-11-26T00:00:00Z","timestamp":1574726400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,26]],"date-time":"2019-11-26T00:00:00Z","timestamp":1574726400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100010198","name":"Ministerio de Econom\u00eda, Industria y Competitividad, Gobierno de Espa\u00f1a","doi-asserted-by":"crossref","award":["MTM2014-59179-C2-1-P"],"award-info":[{"award-number":["MTM2014-59179-C2-1-P"]}],"id":[{"id":"10.13039\/501100010198","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100010198","name":"Ministerio de Econom\u00eda, Industria y Competitividad, Gobierno de Espa\u00f1a","doi-asserted-by":"crossref","award":["RYC-2013-13327"],"award-info":[{"award-number":["RYC-2013-13327"]}],"id":[{"id":"10.13039\/501100010198","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100010198","name":"Ministerio de Econom\u00eda, Industria y Competitividad, Gobierno de Espa\u00f1a","doi-asserted-by":"crossref","award":["BES-2015-073360"],"award-info":[{"award-number":["BES-2015-073360"]}],"id":[{"id":"10.13039\/501100010198","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100014440","name":"Ministerio de Ciencia, Innovaci\u00f3n y Universidades","doi-asserted-by":"publisher","award":["PGC2018-097960-B-C22"],"award-info":[{"award-number":["PGC2018-097960-B-C22"]}],"id":[{"id":"10.13039\/100014440","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1007\/s00186-019-00691-9","type":"journal-article","created":{"date-parts":[[2019,11,26]],"date-time":"2019-11-26T19:02:48Z","timestamp":1574794968000},"page":"201-240","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":32,"title":["The Douglas\u2013Rachford algorithm for convex and nonconvex feasibility problems"],"prefix":"10.1007","volume":"91","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2445-8011","authenticated-orcid":false,"given":"Francisco J.","family":"Arag\u00f3n Artacho","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rub\u00e9n","family":"Campoy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew K.","family":"Tam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,26]]},"reference":[{"issue":"6","key":"691_CR1","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1016\/j.orl.2018.10.003","volume":"46","author":"S Alwadani","year":"2018","unstructured":"Alwadani S, Bauschke HH, Moursi WM, Wang X (2018) On the asymptotic behaviour of the Arag\u00f3n Artacho-Campoy algorithm. Oper Res Lett 46(6):585\u2013587","journal-title":"Oper Res Lett"},{"issue":"3","key":"691_CR2","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 FJ, Borwein JM (2013) Global convergence of a non-convex Douglas\u2013Rachford iteration. J Glob Optim 57(3):753\u2013769","journal-title":"J Glob Optim"},{"issue":"1","key":"691_CR3","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s10589-017-9942-5","volume":"69","author":"FJ Arag\u00f3n Artacho","year":"2018","unstructured":"Arag\u00f3n Artacho FJ, Campoy R (2018a) A new projection method for finding the closest point in the intersection of convex sets. Comput Optim Appl 69(1):99\u2013132","journal-title":"Comput Optim Appl"},{"issue":"2","key":"691_CR4","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/s11228-017-0461-4","volume":"26","author":"FJ Arag\u00f3n Artacho","year":"2018","unstructured":"Arag\u00f3n Artacho FJ, Campoy R (2018b) Solving graph coloring problems with the Douglas\u2013Rachford algorithm. Set-Valued Var Anal 26(2):277\u2013304","journal-title":"Set-Valued Var Anal"},{"issue":"4","key":"691_CR5","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1017\/S1446181114000145","volume":"55","author":"FJ Arag\u00f3n Artacho","year":"2014","unstructured":"Arag\u00f3n Artacho FJ, Borwein JM, Tam MK (2014a) Douglas\u2013Rachford feasibility methods for matrix completion problems. ANZIAM J 55(4):299\u2013326","journal-title":"ANZIAM J"},{"issue":"1","key":"691_CR6","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 FJ, Borwein JM, Tam MK (2014b) Recent results on Douglas\u2013Rachford methods for combinatorial optimization problem. J Optim Theory Appl 163(1):1\u201330","journal-title":"J Optim Theory Appl"},{"issue":"2","key":"691_CR7","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 FJ, Borwein JM, Tam MK (2016) Global behavior of the Douglas\u2013Rachford method for a nonconvex feasibility problem. J Glob Optim 65(2):309\u2013327","journal-title":"J Glob Optim"},{"issue":"4","key":"691_CR8","doi-asserted-by":"crossref","first-page":"1061","DOI":"10.1007\/s10878-018-0250-5","volume":"35","author":"FJ Arag\u00f3n Artacho","year":"2018","unstructured":"Arag\u00f3n Artacho FJ, Campoy R, Kotsireas IS, Tam MK (2018b) A feasibility approach for constructing combinatorial designs of circulant type. J Comb Optim 35(4):1061\u20131085","journal-title":"J Comb Optim"},{"issue":"4","key":"691_CR9","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1080\/10556788.2018.1504049","volume":"34","author":"FJ Arag\u00f3n Artacho","year":"2019","unstructured":"Arag\u00f3n Artacho FJ, Censor Y, Gibali A (2019) The cyclic Douglas-Rachford algorithm with $$r$$-sets-Douglas-Rachford operators. Optim Methods Softw 34(4):875\u2013889","journal-title":"Optim Methods Softw"},{"key":"691_CR10","doi-asserted-by":"crossref","unstructured":"Arag\u00f3n\u00a0Artacho FJ, Campoy R, Elser V (2018a) An enhanced formulation for successfully solving graph coloring problems with the Douglas\u2013Rachford algorithm. arXiv e-prints arXiv:1808.01022","DOI":"10.1007\/s11228-017-0461-4"},{"issue":"1","key":"691_CR11","first-page":"1","volume":"4","author":"JB Baillon","year":"1978","unstructured":"Baillon JB, Bruck RE, Reich S (1978) On the asymptotic behavior of nonexpansive mappings and semigroups in Banach spaces. Houston J Math 4(1):1\u20139","journal-title":"Houston J Math"},{"issue":"1","key":"691_CR12","doi-asserted-by":"crossref","first-page":"133","DOI":"10.4064\/fm-3-1-133-181","volume":"3","author":"S Banach","year":"1922","unstructured":"Banach S (1922) Sur les op\u00e9rations dans les ensembles abstraits et leur application aux \u00e9quations int\u00e9grales. Fund math 3(1):133\u2013181","journal-title":"Fund math"},{"key":"691_CR13","doi-asserted-by":"crossref","unstructured":"Bauschke HH (2013) New demiclosedness principles for (firmly) nonexpansive operators. In: Computational and analytical mathematics, Springer, pp 19\u201328","DOI":"10.1007\/978-1-4614-7621-4_2"},{"key":"691_CR14","doi-asserted-by":"crossref","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 HH, Combettes PL (2017) Convex analysis and monotone operator theory in hilbert spaces, 2nd edn. Springer, New York","edition":"2"},{"issue":"1","key":"691_CR15","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1137\/16M1071079","volume":"27","author":"HH Bauschke","year":"2017","unstructured":"Bauschke HH, Dao MN (2017) 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","journal-title":"SIAM J Optim"},{"issue":"1\u20132","key":"691_CR16","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s10107-016-1086-3","volume":"164","author":"HH Bauschke","year":"2017","unstructured":"Bauschke HH, Moursi WM (2017) On the Douglas\u2013Rachford algorithm. Math Program, Ser A 164(1\u20132):263\u2013284","journal-title":"Math Program, Ser A"},{"issue":"6","key":"691_CR17","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1007\/s00013-014-0652-2","volume":"102","author":"HH Bauschke","year":"2014","unstructured":"Bauschke HH, Noll D (2014) On the local convergence of the Douglas\u2013Rachford algorithm. Arch Math 102(6):589\u2013600","journal-title":"Arch Math"},{"issue":"7","key":"691_CR18","doi-asserted-by":"crossref","first-page":"1334","DOI":"10.1364\/JOSAA.19.001334","volume":"19","author":"HH Bauschke","year":"2002","unstructured":"Bauschke HH, Combettes PL, Luke DR (2002) Phase retrieval, error reduction algorithm, and Fienup variants: a view from convex optimization. J Opt Soc Am A: 19(7):1334\u20131345","journal-title":"J Opt Soc Am A:"},{"issue":"2","key":"691_CR19","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1016\/j.jat.2004.02.006","volume":"127","author":"HH Bauschke","year":"2004","unstructured":"Bauschke HH, Combettes PL, Luke DR (2004) Finding best approximation pairs relative to two closed convex sets in Hilbert spaces. J Approx Theory 127(2):178\u2013192","journal-title":"J Approx Theory"},{"key":"691_CR20","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.jat.2014.06.002","volume":"185","author":"HH Bauschke","year":"2014","unstructured":"Bauschke HH, Bello Cruz JY, Nghia TT, Phan HM, Wang X (2014) 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","journal-title":"J Approx Theory"},{"issue":"1","key":"691_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jmaa.2014.06.075","volume":"421","author":"HH Bauschke","year":"2015","unstructured":"Bauschke HH, Noll D, Phan HM (2015) Linear and strong convergence of algorithms involving averaged nonexpansive operators. J Math Anal Appl 421(1):1\u201320","journal-title":"J Math Anal Appl"},{"issue":"3","key":"691_CR22","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/s11228-016-0399-y","volume":"25","author":"HH Bauschke","year":"2017","unstructured":"Bauschke HH, Lukens B, Moursi WM (2017) Affine nonexpansive operators, Attouch-Th\u00e9ra duality and the Douglas\u2013Rachford algorithm. Set-Valued Var Anal 25(3):481\u2013505","journal-title":"Set-Valued Var Anal"},{"issue":"1","key":"691_CR23","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s10898-019-00744-7","volume":"74","author":"HH Bauschke","year":"2019","unstructured":"Bauschke HH, Dao MN, Lindstrom SB (2019) The Douglas\u2013Rachford algorithm for a hyperplane and a doubleton. J Glob Optim 74(1):79\u201393","journal-title":"J Glob Optim"},{"issue":"3","key":"691_CR24","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1007\/s11075-017-0399-5","volume":"78","author":"R Behling","year":"2018","unstructured":"Behling R, Bello Cruz JY, Santos L (2018) Circumcentering the Douglas\u2013Rachford method. Numer Algor 78(3):759\u2013776","journal-title":"Numer Algor"},{"issue":"2","key":"691_CR25","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/s10898-015-0296-1","volume":"63","author":"J Benoist","year":"2015","unstructured":"Benoist J (2015) The Douglas\u2013Rachford algorithm for the case of the sphere and the line. J Global Optim 63(2):363\u2013380","journal-title":"J Global Optim"},{"key":"691_CR26","volume-title":"Convex analysis and nonlinear optimization: theory and examples","author":"J Borwein","year":"2010","unstructured":"Borwein J, Lewis A (2010) Convex analysis and nonlinear optimization: theory and examples. Springer, New York"},{"key":"691_CR27","first-page":"93","volume-title":"Fixed-point algorithms for inverse problems in science and engineering, springer optimization and its applications","author":"JM Borwein","year":"2011","unstructured":"Borwein JM, Sims B (2011) The Douglas\u2013Rachford algorithm in the absence of convexity. In: Bauschke H, Burachik R, Combettes P, Elser V, Luke D, Wolkowicz H (eds) Fixed-point algorithms for inverse problems in science and engineering, springer optimization and its applications, vol 49. Springer, New York, pp 93\u2013109"},{"issue":"1","key":"691_CR28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10957-013-0381-x","volume":"160","author":"JM Borwein","year":"2014","unstructured":"Borwein JM, Tam MK (2014) A cyclic Douglas\u2013Rachford iteration scheme. J Optim Theory Appl 160(1):1\u201329","journal-title":"J Optim Theory Appl"},{"issue":"4","key":"691_CR29","first-page":"573","volume":"16","author":"JM Borwein","year":"2015","unstructured":"Borwein JM, Tam MK (2015) The cyclic Douglas\u2013Rachford method for inconsistent feasibility problems. J Nonlinear Convex Anal 16(4):573\u2013584","journal-title":"J Nonlinear Convex Anal"},{"key":"691_CR30","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/978-981-10-4774-9_5","volume-title":"Generalized nash equilibrium problems, bilevel programming and MPEC","author":"JM Borwein","year":"2017","unstructured":"Borwein JM, Tam MK (2017) Reflection methods for inverse problems with applications to protein conformation determination. Forum for interdisciplinary mathematics. In: Aussel D, Lalitha C (eds) Generalized nash equilibrium problems, bilevel programming and MPEC. Springer, Singapore, pp 83\u2013100"},{"issue":"1","key":"691_CR31","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1080\/02331934.2014.947499","volume":"64","author":"JM Borwein","year":"2015","unstructured":"Borwein JM, Sims B, Tam MK (2015) Norm convergence of realistic projection and reflection methods. Optimization 64(1):161\u2013178","journal-title":"Optimization"},{"issue":"2","key":"691_CR32","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/s11228-017-0457-0","volume":"26","author":"JM Borwein","year":"2018","unstructured":"Borwein JM, Lindstrom SB, Sims B, Schneider A, Skerritt MP (2018) Dynamics of the Douglas\u2013Rachford method for ellipses and $$p$$-spheres. Set-Valued Var Anal 26(2):385\u2013403","journal-title":"Set-Valued Var Anal"},{"issue":"3","key":"691_CR33","first-page":"688","volume":"162","author":"LM Bregman","year":"1965","unstructured":"Bregman LM (1965) The method of successive projection for finding a common point of convex sets. Soviet Math Dokl 162(3):688\u2013692","journal-title":"Soviet Math Dokl"},{"key":"691_CR34","doi-asserted-by":"crossref","unstructured":"Cegielski A (2012) Iterative methods for fixed point problems in hilbert spaces, Lecture Notes in Mathematics, vol 2057. Springer","DOI":"10.1007\/978-3-642-30901-4"},{"key":"691_CR35","first-page":"83","volume":"20","author":"Y Censor","year":"1984","unstructured":"Censor Y (1984) Iterative methods for convex feasibility problems. Ann Discrete Math 20:83\u201391","journal-title":"Ann Discrete Math"},{"issue":"11","key":"691_CR36","doi-asserted-by":"crossref","first-page":"2343","DOI":"10.1080\/02331934.2014.957701","volume":"64","author":"Y Censor","year":"2015","unstructured":"Censor Y, Cegielski A (2015) Projection methods: an annotated bibliography of books and reviews. Optimization 64(11):2343\u20132358","journal-title":"Optimization"},{"key":"691_CR37","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1137\/141001536","volume":"26","author":"Y Censor","year":"2016","unstructured":"Censor Y, Mansour R (2016) New Douglas\u2013Rachford algorithmic structures and their convergence analyses. SIAM J Optim 26:474\u2013487","journal-title":"SIAM J Optim"},{"issue":"3","key":"691_CR38","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1090\/S0002-9939-1959-0105008-8","volume":"10","author":"W Cheney","year":"1959","unstructured":"Cheney W, Goldstein A (1959) Proximity maps for convex sets. Proc Amer Math Soc 10(3):448\u2013450","journal-title":"Proc Amer Math Soc"},{"key":"691_CR39","doi-asserted-by":"crossref","unstructured":"Dao MN, Tam MK (2019b) Union averaged operators with applications to proximal algorithms for min-convex functions. J Optim Theory and Appl pp 1\u201334","DOI":"10.1007\/s10957-018-1443-x"},{"issue":"3","key":"691_CR40","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/s10898-018-0654-x","volume":"72","author":"MN Dao","year":"2018","unstructured":"Dao MN, Phan HM (2018) Linear convergence of the generalized Douglas\u2013Rachford algorithm for feasibility problems. J Glob Optim 72(3):443\u2013474","journal-title":"J Glob Optim"},{"issue":"1","key":"691_CR41","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/s10898-018-0677-3","volume":"73","author":"MN Dao","year":"2019","unstructured":"Dao MN, Tam MK (2019a) A Lyapunov-type approach to convergence of the Douglas\u2013Rachford algorithm for a nonconvex setting. J Glob Optim 73(1):83\u2013112","journal-title":"J Glob Optim"},{"key":"691_CR42","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-9298-9","volume-title":"Best approximation in inner product spaces, CMS books in mathematics\/ouvrages de math\u00e9matiques de la SMC,","author":"F Deutsch","year":"2001","unstructured":"Deutsch F (2001) Best approximation in inner product spaces, CMS books in mathematics\/ouvrages de math\u00e9matiques de la SMC, vol 7. Springer, New York"},{"key":"691_CR43","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 HH (1956) On the numerical solution of heat conduction problems in two and three space variables. Trans Amer Math Soc 82:421\u2013439","journal-title":"Trans Amer Math Soc"},{"issue":"1","key":"691_CR44","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF01581204","volume":"55","author":"J Eckstein","year":"1992","unstructured":"Eckstein J, Bertsekas DP (1992) On the Douglas\u2013Rachford splitting method and the proximal point algorithm for maximal monotone operators. Math Program 55(1):293\u2013318","journal-title":"Math Program"},{"issue":"1","key":"691_CR45","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1364\/JOSAA.20.000040","volume":"20","author":"V Elser","year":"2003","unstructured":"Elser V (2003) Phase retrieval by iterated projections. J Opt Soc Am A: 20(1):40\u201355","journal-title":"J Opt Soc Am A:"},{"issue":"1","key":"691_CR46","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1109\/TIT.2017.2754485","volume":"64","author":"V Elser","year":"2018","unstructured":"Elser V (2018) The complexity of bit retrieval. IEEE Trans Inf Theory 64(1):412\u2013428","journal-title":"IEEE Trans Inf Theory"},{"issue":"2","key":"691_CR47","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1073\/pnas.0606359104","volume":"104","author":"V Elser","year":"2007","unstructured":"Elser V, Rankenburg I, Thibault P (2007) Searching with iterated maps. Proc Natl Acad Sci 104(2):418\u2013423","journal-title":"Proc Natl Acad Sci"},{"key":"691_CR48","first-page":"96","volume":"23","author":"I Halperin","year":"1962","unstructured":"Halperin I (1962) The product of projection operators. Acta Sci Math 23:96\u201399","journal-title":"Acta Sci Math"},{"issue":"4","key":"691_CR49","doi-asserted-by":"crossref","first-page":"2397","DOI":"10.1137\/120902653","volume":"23","author":"R Hesse","year":"2013","unstructured":"Hesse R, Luke DR (2013) Nonconvex notions of regularity and convergence of fundamental algorithms for feasibility problems. SIAM J Optim 23(4):2397\u20132419","journal-title":"SIAM J Optim"},{"issue":"18","key":"691_CR50","doi-asserted-by":"crossref","first-page":"4868","DOI":"10.1109\/TSP.2014.2339801","volume":"62","author":"R Hesse","year":"2014","unstructured":"Hesse R, Luke DR, Neumann P (2014) Alternating projections and Douglas\u2013Rachford for sparse affine feasibility. IEEE Trans Signal Process 62(18):4868\u20134881","journal-title":"IEEE Trans Signal Process"},{"issue":"1","key":"691_CR51","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.na.2003.11.004","volume":"57","author":"HS Hundal","year":"2004","unstructured":"Hundal HS (2004) An alternating projection that does not converge in norm. Nonlin Anal Theory Methods Appl 57(1):35\u201361","journal-title":"Nonlin Anal Theory Methods Appl"},{"key":"691_CR52","first-page":"355","volume":"35","author":"S Kaczmarz","year":"1937","unstructured":"Kaczmarz S (1937) Angen\u00e4herte Aufl\u00f6sung von Systemen linearer Gleichungen. Bull Int Acad Sci Pologne A 35:355\u2013357","journal-title":"Bull Int Acad Sci Pologne A"},{"issue":"1","key":"691_CR53","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1017\/S1446181118000391","volume":"61","author":"BP Lamichhane","year":"2019","unstructured":"Lamichhane BP, Lindstrom SB, Sims B (2019) Application of projection algorithms to differential equations: boundary value problems. ANZIAM J 61(1):23\u201346","journal-title":"ANZIAM J"},{"key":"691_CR54","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s10107-015-0963-5","volume":"159","author":"G Li","year":"2016","unstructured":"Li G, Pong TK (2016) Douglas\u2013Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems. Math Prog 159:371\u2013401","journal-title":"Math Prog"},{"key":"691_CR55","unstructured":"Lindstrom SB, Sims B (2018) Survey: Sixty years of Douglas\u2013Rachford. J AustMS (to appear)"},{"issue":"6","key":"691_CR56","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1137\/0716071","volume":"16","author":"PL Lions","year":"1979","unstructured":"Lions PL, Mercier B (1979) Splitting algorithms for the sum of two nonlinear operators. SIAM J Numer Anal 16(6):964\u2013979","journal-title":"SIAM J Numer Anal"},{"issue":"2","key":"691_CR57","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1137\/070681399","volume":"19","author":"DR Luke","year":"2008","unstructured":"Luke DR (2008) Finding best approximation pairs relative to a convex and a prox-regular set in a Hilbert space. SIAM J Optim 19(2):714\u2013739","journal-title":"SIAM J Optim"},{"issue":"4","key":"691_CR58","doi-asserted-by":"crossref","first-page":"1143","DOI":"10.1287\/moor.2017.0898","volume":"43","author":"DR Luke","year":"2018","unstructured":"Luke DR, Nguyen HT, Tam MK (2018) Quantitative convergence analysis of iterated expansive, set-valued mappings. Math Oper Res 43(4):1143\u20131176","journal-title":"Math Oper Res"},{"issue":"2","key":"691_CR59","first-page":"183","volume":"3","author":"L Maohua","year":"1990","unstructured":"Maohua L, Weixuan L, Wang E (1990) A generalization of the $$n$$-queen problem. J Systems Sci Math Sci 3(2):183\u2013191","journal-title":"J Systems Sci Math Sci"},{"issue":"4","key":"691_CR60","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1090\/S0002-9904-1967-11761-0","volume":"73","author":"Z Opial","year":"1967","unstructured":"Opial Z (1967) Weak convergence of the sequence of successive approximations for nonexpansive mappings. Bull Am Math Soc 73(4):591\u2013597","journal-title":"Bull Am Math Soc"},{"key":"691_CR61","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/BF02771588","volume":"9","author":"A Pazy","year":"1971","unstructured":"Pazy A (1971) Asymptotic behavior of contractions in Hilbert space. Israel J Math 9:235\u2013240","journal-title":"Israel J Math"},{"issue":"2","key":"691_CR62","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1080\/02331934.2015.1051532","volume":"65","author":"HM Phan","year":"2016","unstructured":"Phan HM (2016) Linear convergence of the Douglas\u2013Rachford method for two closed sets. Optimization 65(2):369\u2013385","journal-title":"Optimization"},{"key":"691_CR63","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1007\/BF02612715","volume":"28","author":"G Pierra","year":"1984","unstructured":"Pierra G (1984) Decomposition through formalization in a product space. Math Program 28:96\u2013115","journal-title":"Math Program"},{"key":"691_CR64","unstructured":"Schaad J (2010) Modeling the $$8$$-queens problem and Sudoku using an algorithm based on projections onto nonconvex sets. Master\u2019s thesis, University of British Columbia"},{"issue":"1","key":"691_CR65","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1137\/100788100","volume":"49","author":"BF Svaiter","year":"2011","unstructured":"Svaiter BF (2011) On weak convergence of the Douglas\u2013Rachford method. SIAM J Control Optim 49(1):280\u2013287","journal-title":"SIAM J Control Optim"},{"issue":"5","key":"691_CR66","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1007\/s11590-018-1249-7","volume":"12","author":"MK Tam","year":"2018","unstructured":"Tam MK (2018) Algorithms based on unions of nonexpansive maps. Optim Lett 12(5):1019\u20131027","journal-title":"Optim Lett"},{"issue":"3","key":"691_CR67","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1007\/s10589-018-9989-y","volume":"70","author":"NH Thao","year":"2018","unstructured":"Thao NH (2018) A convergent relaxation of the Douglas\u2013Rachford algorithm. Comput Optim Appl 70(3):841\u2013863","journal-title":"Comput Optim Appl"},{"key":"691_CR68","volume-title":"Functional operators II: the geometry of orthogonal spaces","author":"J von Neumann","year":"1950","unstructured":"von Neumann J (1950) Functional operators II: the geometry of orthogonal spaces. Princeton University Press, Princeton"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-019-00691-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-019-00691-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-019-00691-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,25]],"date-time":"2020-11-25T00:25:31Z","timestamp":1606263931000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-019-00691-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,26]]},"references-count":68,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["691"],"URL":"https:\/\/doi.org\/10.1007\/s00186-019-00691-9","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,26]]},"assertion":[{"value":"18 April 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 August 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}