{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:21:05Z","timestamp":1740122465087,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,6,23]],"date-time":"2018-06-23T00:00:00Z","timestamp":1529712000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,6,23]],"date-time":"2018-06-23T00:00:00Z","timestamp":1529712000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP160101537"],"award-info":[{"award-number":["DP160101537"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["RTG2088"],"award-info":[{"award-number":["RTG2088"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100005156","name":"Alexander von Humboldt-Stiftung","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100005156","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1007\/s10898-018-0677-3","type":"journal-article","created":{"date-parts":[[2018,6,23]],"date-time":"2018-06-23T14:43:07Z","timestamp":1529764987000},"page":"83-112","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["A Lyapunov-type approach to convergence of the Douglas\u2013Rachford algorithm for a nonconvex setting"],"prefix":"10.1007","volume":"73","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8074-6675","authenticated-orcid":false,"given":"Minh N.","family":"Dao","sequence":"first","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":[[2018,6,23]]},"reference":[{"issue":"3","key":"677_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 nonconvex Douglas\u2013Rachford iteration. J. Glob. Optim. 57(3), 753\u2013769 (2013)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"677_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."},{"key":"677_CR3","volume-title":"Fractals Everywhere","author":"MF Barnsley","year":"1993","unstructured":"Barnsley, M.F.: Fractals Everywhere, 2nd edn. Morgen Kaufman, Burlington (1993)","edition":"2"},{"key":"677_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)","journal-title":"J. Approx. Theory"},{"key":"677_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9467-7","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"HH Bauschke","year":"2011","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces. Springer, New York (2011)"},{"issue":"7","key":"677_CR6","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)","journal-title":"JOSA A"},{"issue":"2","key":"677_CR7","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(2), 178\u2013192 (2004)","journal-title":"J. Approx. Theory"},{"issue":"3","key":"677_CR8","first-page":"401","volume":"2","author":"HH Bauschke","year":"2006","unstructured":"Bauschke, H.H., Combettes, P.L., Noll, D.: Joint minimization with alternating Bregman proximity operators. Pac. J. Optim. 2(3), 401\u2013424 (2006)","journal-title":"Pac. J. Optim."},{"issue":"1","key":"677_CR9","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":"2","key":"677_CR10","first-page":"287","volume":"1","author":"HH Bauschke","year":"2015","unstructured":"Bauschke, H.H., Dao, M.N., Moursi, W.M.: On Fej\u00e9r monotone sequences and nonexpansive mappings. Linear Nonlinear Anal. 1(2), 287\u2013295 (2015)","journal-title":"Linear Nonlinear Anal."},{"issue":"3","key":"677_CR11","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":"677_CR12","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":"677_CR13","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":"3","key":"677_CR14","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s11590-015-0920-5","volume":"10","author":"HH Bauschke","year":"2016","unstructured":"Bauschke, H.H., Moursi, W.M.: On the order of the operators in the Douglas\u2013Rachford algorithm. Optim. Lett. 10(3), 447\u2013455 (2016)","journal-title":"Optim. Lett."},{"issue":"1","key":"677_CR15","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. A 164(1), 263\u2013284 (2017)","journal-title":"Math. Program. A"},{"key":"677_CR16","doi-asserted-by":"publisher","first-page":"1064","DOI":"10.1137\/14096267X","volume":"25","author":"HH Bauschke","year":"2015","unstructured":"Bauschke, H.H., Wang, C., Wang, X., Xu, J.: On subgradient projections. SIAM J. Optim. 25, 1064\u20131082 (2015)","journal-title":"SIAM J. Optim."},{"key":"677_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/s11228-017-0415-x","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H.H., Wang, C., Wang, X., Xu, J.: Subgradient projectors: extensions, theory, and characterizations. Set-Valued Var. Anal. (2017). \n                    https:\/\/doi.org\/10.1007\/s11228-017-0415-x","journal-title":"Set-Valued Var. Anal."},{"issue":"2","key":"677_CR18","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."},{"key":"677_CR19","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\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)"},{"key":"677_CR20","unstructured":"Dao, M.N., Phan, H.M.: Linear convergence of projection algorithms. Math. Oper. Res. (to appear). \n                    arXiv:1609.00341"},{"key":"677_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-018-0654-x","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. (2018). \n                    https:\/\/doi.org\/10.1007\/s10898-018-0654-x","journal-title":"J. Glob. Optim."},{"key":"677_CR22","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":"6","key":"677_CR23","doi-asserted-by":"publisher","first-page":"1637","DOI":"10.1007\/s10208-015-9279-3","volume":"15","author":"D Drusvyatskiy","year":"2015","unstructured":"Drusvyatskiy, D., Ioffe, A.D., Lewis, A.S.: Transversality and alternating projections for nonconvex sets. Found. Comput. Math. 15(6), 1637\u20131651 (2015)","journal-title":"Found. Comput. Math."},{"issue":"2","key":"677_CR24","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s11228-018-0477-4","volume":"26","author":"O Giladi","year":"2018","unstructured":"Giladi, O.: A remark on the convergence of the Douglas\u2013Rachford iteration in a non-convex setting. Set-Valued Var. Anal. 26(2), 207\u2013225 (2018)","journal-title":"Set-Valued Var. Anal."},{"issue":"4","key":"677_CR25","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)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"677_CR26","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/s10208-008-9036-y","volume":"9","author":"AS Lewis","year":"2009","unstructured":"Lewis, A.S., Luke, D.R., Malick, J.: Local linear convergence for alternating and averaged nonconvex projections. Found. Comput. Math. 9(4), 485\u2013513 (2009)","journal-title":"Found. Comput. Math."},{"issue":"3","key":"677_CR27","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":"677_CR28","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":"677_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-31246-3","volume-title":"Variational Analysis and Generalized Differentiation I. Basic Theory","author":"B Mordukhovich","year":"2006","unstructured":"Mordukhovich, B.: Variational Analysis and Generalized Differentiation I. Basic Theory. Springer, Berlin (2006)"},{"issue":"2","key":"677_CR30","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":"2","key":"677_CR31","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s10208-015-9253-0","volume":"16","author":"D Noll","year":"2016","unstructured":"Noll, D., Rondepierre, A.: On local convergence of the method of alternating projections. Found. Comput. Math. 16(2), 425\u2013455 (2016)","journal-title":"Found. Comput. Math."},{"key":"677_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis. Springer, Berlin (1998)"},{"issue":"1","key":"677_CR33","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1214\/aoms\/1177729893","volume":"21","author":"J Sherman","year":"1950","unstructured":"Sherman, J., Morrison, W.J.: Adjustment of an inverse matrix corresponding to a change in one element of a given matrix. Ann. Math. Stat. 21(1), 124\u2013127 (1950)","journal-title":"Ann. Math. Stat."},{"issue":"1","key":"677_CR34","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)","journal-title":"SIAM J. Control Optim."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-018-0677-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-018-0677-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-018-0677-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T07:29:12Z","timestamp":1589700552000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-018-0677-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,23]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["677"],"URL":"https:\/\/doi.org\/10.1007\/s10898-018-0677-3","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2018,6,23]]},"assertion":[{"value":"17 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 June 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 June 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}