{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T01:44:17Z","timestamp":1775094257097,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,11,4]],"date-time":"2015-11-04T00:00:00Z","timestamp":1446595200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,11,4]],"date-time":"2015-11-04T00:00:00Z","timestamp":1446595200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003329","name":"Ministerio de Econom\u00eda y Competitividad","doi-asserted-by":"publisher","award":["RYC-2013-13327"],"award-info":[{"award-number":["RYC-2013-13327"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003329","name":"Ministerio de Econom\u00eda y Competitividad","doi-asserted-by":"publisher","award":["MTM2014-59179-C2-1-P"],"award-info":[{"award-number":["MTM2014-59179-C2-1-P"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Australian Post-Graduate Award"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1007\/s10898-015-0380-6","type":"journal-article","created":{"date-parts":[[2015,11,4]],"date-time":"2015-11-04T08:19:44Z","timestamp":1446625184000},"page":"309-327","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["Global behavior of the Douglas\u2013Rachford method for a nonconvex feasibility problem"],"prefix":"10.1007","volume":"65","author":[{"given":"Francisco J.","family":"Arag\u00f3n Artacho","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan M.","family":"Borwein","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":[[2015,11,4]]},"reference":[{"issue":"4","key":"380_CR1","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1017\/S1446181114000145","volume":"55","author":"FJ Arag\u00f3n Artacho","year":"2014","unstructured":"Arag\u00f3n Artacho, F.J., Borwein, J.M., Tam, M.K.: Douglas\u2013Rachford feasibility methods for matrix completion problems. ANZIAM J. 55(4), 299\u2013326 (2014). doi:\n                    10.1017\/S1446181114000145","journal-title":"ANZIAM J."},{"issue":"3","key":"380_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). doi:\n                    10.1007\/s10898-012-9958-4","journal-title":"J. Glob. Optim."},{"issue":"1","key":"380_CR3","doi-asserted-by":"publisher","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 problem. J. Optim. Theory. Appl. 163(1), 1\u201330 (2014). doi:\n                    10.1007\/s10957-013-0488-0","journal-title":"J. Optim. Theory. Appl."},{"key":"380_CR4","unstructured":"Borwein, J.M., Tam, M.K.: Reflection methods for inverse problems with application to protein conformation determination. In: Generalized Nash Equilibrium Problems, Bilevel programming and MPEC, New Delhi (2012), (in press)"},{"issue":"1","key":"380_CR5","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). doi:\n                    10.1007\/s10957-013-0381-x","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"380_CR6","first-page":"537","volume":"16","author":"JM Borwein","year":"2015","unstructured":"Borwein, J.M., Tam, M.K.: The cyclic Douglas\u2013Rachford method for inconsistent feasibility problems. J. Nonlinear Convex Anal. 16(4), 537\u2013584 (2015)","journal-title":"J. Nonlinear Convex Anal."},{"key":"380_CR7","unstructured":"Bauschke, H.H., Dao, M.N., Moursi, W.M.: The Douglas\u2013Rachford algorithm in the affine-convex case. \n                    arXiv:1505.06408v1"},{"key":"380_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/conm\/636\/12726","volume":"636","author":"HH Bauschke","year":"2015","unstructured":"Bauschke, H.H., Koch, V.R.: Projection methods: Swiss army knives for solving feasibility and best approximation problems with halfspaces. Contemp. Math. 636, 1\u201340 (2015). doi:\n                    10.1090\/conm\/636","journal-title":"Contemp. Math."},{"key":"380_CR9","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, 589\u2013600 (2014). doi:\n                    10.1007\/s00013-014-0652-2","journal-title":"Arch. Math."},{"issue":"7","key":"380_CR10","doi-asserted-by":"publisher","first-page":"1334","DOI":"10.1364\/JOSAA.19.001334","volume":"19","author":"HH Bauschke","year":"2002","unstructured":"Bauschke, H.H., Combettes, P.L., Luke, D.R.: Phase retrieval, error reduction algorithm, and Fienup variants: a view from convex optimization. JOSA A 19(7), 1334\u20131345 (2002). doi:\n                    10.1364\/JOSAA.19.001334","journal-title":"JOSA A"},{"key":"380_CR11","doi-asserted-by":"publisher","unstructured":"Benoist, J.: The Douglas\u2013Rachford algorithm for the case of the sphere and the line. J. Global Optim. (2015). doi:\n                    10.1007\/s10898-015-0296-1","DOI":"10.1007\/s10898-015-0296-1"},{"key":"380_CR12","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., 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). doi:\n                    10.1007\/978-1-4419-9569-8","DOI":"10.1007\/978-1-4419-9569-8"},{"issue":"2","key":"380_CR13","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. 104(2), 418\u2013423 (2007). doi:\n                    10.1073\/pnas.0606359104","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"4","key":"380_CR14","doi-asserted-by":"publisher","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). doi:\n                    10.1137\/120902653","journal-title":"SIAM J. Optim."},{"issue":"18","key":"380_CR15","doi-asserted-by":"publisher","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\u2013Rachford for sparse affine feasibility. IEEE. Trans. Signal Proc. 62(18), 4868\u20134881 (2014). doi:\n                    10.1109\/TSP.2014.2339801","journal-title":"IEEE. Trans. Signal Proc."},{"issue":"3","key":"380_CR16","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). doi:\n                    10.1103\/PhysRevE.78.036706","journal-title":"Phys. Rev. E"},{"key":"380_CR17","volume-title":"Integer and Combinatorial Optimization","author":"GL Nemhauser","year":"1999","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1999)"},{"key":"380_CR18","doi-asserted-by":"publisher","unstructured":"Phan, H.M.: Linear convergence of the Douglas\u2013Rachford method for two closed sets. Optim. (2015). doi:\n                    10.1080\/02331934.2015.1051532","DOI":"10.1080\/02331934.2015.1051532"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-015-0380-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-015-0380-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-015-0380-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-015-0380-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T07:22:26Z","timestamp":1589700146000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-015-0380-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,4]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["380"],"URL":"https:\/\/doi.org\/10.1007\/s10898-015-0380-6","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,4]]},"assertion":[{"value":"30 June 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 October 2015","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 November 2015","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}