{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T14:25:28Z","timestamp":1777127128442,"version":"3.51.4"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,8,17]],"date-time":"2013-08-17T00:00:00Z","timestamp":1376697600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1007\/s10957-013-0381-x","type":"journal-article","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T16:15:55Z","timestamp":1376669755000},"page":"1-29","source":"Crossref","is-referenced-by-count":47,"title":["A Cyclic Douglas\u2013Rachford Iteration Scheme"],"prefix":"10.1007","volume":"160","author":[{"given":"Jonathan M.","family":"Borwein","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":[[2013,8,17]]},"reference":[{"key":"381_CR1","volume-title":"Functional Operators, vol. II. The Geometry of Orthogonal Spaces","author":"J. Neumann von","year":"1950","unstructured":"von Neumann, J.: Functional Operators, vol. II. The Geometry of Orthogonal Spaces vol. 22. Princeton University Press, Princeton (1950)"},{"key":"381_CR2","first-page":"96","volume":"23","author":"I. Halperin","year":"1962","unstructured":"Halperin, I.: The product of projection operators. Acta Sci. Math. (Szeged) 23, 96\u201399 (1962)","journal-title":"Acta Sci. Math. (Szeged)"},{"key":"381_CR3","first-page":"688","volume":"6","author":"L. Bregman","year":"1965","unstructured":"Bregman, L.: The method of successive projection for finding a common point of convex sets. J. Sov. Math. 6, 688\u2013692 (1965)","journal-title":"J. Sov. Math."},{"issue":"2","key":"381_CR4","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/BF01027691","volume":"1","author":"H. Bauschke","year":"1993","unstructured":"Bauschke, H., Borwein, J.: On the convergence of von Neumann\u2019s alternating projection algorithm for two sets. Set-Valued Anal. 1(2), 185\u2013212 (1993)","journal-title":"Set-Valued Anal."},{"key":"381_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/conm\/204\/02620","volume":"204","author":"H. Bauschke","year":"1997","unstructured":"Bauschke, H., Borwein, J., Lewis, A.: The method of cyclic projections for closed convex sets in Hilbert space. Contemp. Math. 204, 1\u201338 (1997)","journal-title":"Contemp. Math."},{"issue":"3","key":"381_CR6","first-page":"379","volume":"5","author":"E. Kopeck\u00e1","year":"2004","unstructured":"Kopeck\u00e1, E., Reich, S.: A note on the von Neumann alternating projections algorithm. J. Nonlinear Convex Anal. 5(3), 379\u2013386 (2004)","journal-title":"J. Nonlinear Convex Anal."},{"key":"381_CR7","first-page":"455","volume":"11","author":"E. Kopeck\u00e1","year":"2010","unstructured":"Kopeck\u00e1, E., Reich, S.: Another note on the von Neumann alternating projections algorithm. J. Nonlinear Convex Anal. 11, 455\u2013460 (2010)","journal-title":"J. Nonlinear Convex Anal."},{"issue":"5","key":"381_CR8","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1016\/j.jat.2012.01.001","volume":"164","author":"E. Pustylnik","year":"2012","unstructured":"Pustylnik, E., Reich, S., Zaslavski, A.: Convergence of non-periodic infinite products of orthogonal projections and nonexpansive operators in Hilbert space. J. Approx. Theory 164(5), 611\u2013624 (2012)","journal-title":"J. Approx. Theory"},{"issue":"2","key":"381_CR9","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.: On the numerical solution of heat conduction problems in two and three space variables. Trans. Am. Math. Soc. 82(2), 421\u2013439 (1956)","journal-title":"Trans. Am. Math. Soc."},{"issue":"6","key":"381_CR10","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":"381_CR11","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1016\/j.jat.2004.02.006","volume":"127","author":"H. Bauschke","year":"2004","unstructured":"Bauschke, H., Combettes, P., Luke, D.: 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":"384","key":"381_CR12","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1080\/01621459.1983.10477029","volume":"78","author":"R. Dykstra","year":"1983","unstructured":"Dykstra, R.: An algorithm for restricted least squares regression. J. Am. Stat. Assoc. 78(384), 837\u2013842 (1983)","journal-title":"J. Am. Stat. Assoc."},{"key":"381_CR13","series-title":"Lecture Notes in Statistics","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/978-1-4613-9940-7_3","volume-title":"Advances in Order Restricted Statistical Inference","author":"J. Boyle","year":"1986","unstructured":"Boyle, J., Dykstra, R.: A method for finding projections onto the intersection of convex sets in Hilbert spaces. In: Advances in Order Restricted Statistical Inference. Lecture Notes in Statistics, vol. 37, pp. 28\u201347. Springer, Berlin (1986)"},{"issue":"3","key":"381_CR14","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1006\/jath.1994.1136","volume":"79","author":"H. Bauschke","year":"1994","unstructured":"Bauschke, H., Borwein, J.: Dykstra\u2019s alternating projection algorithm for two sets. J. Approx. Theory 79(3), 418\u2013443 (1994)","journal-title":"J. Approx. Theory"},{"key":"381_CR15","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/S1570-579X(01)80003-3","volume":"8","author":"H. Bauschke","year":"2001","unstructured":"Bauschke, H.: Projection algorithms: results and open problems. Stud. Comput. Math. 8, 11\u201322 (2001)","journal-title":"Stud. Comput. Math."},{"issue":"3","key":"381_CR16","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1137\/S0036144593251710","volume":"38","author":"H. Bauschke","year":"1996","unstructured":"Bauschke, H., Borwein, J.: On projection algorithms for solving convex feasibility problems. SIAM Rew. 38(3), 367\u2013426 (1996)","journal-title":"SIAM Rew."},{"key":"381_CR17","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/978-94-011-2634-2_5","volume-title":"Approximation Theory, Spline Functions and Applications","author":"F. Deutsch","year":"1992","unstructured":"Deutsch, F.: The method of alternating orthogonal projections. In: Approximation Theory, Spline Functions and Applications, pp. 105\u2013121. Kluwer Academic, Dordrecht (1992)"},{"key":"381_CR18","unstructured":"Tam, M.: The method of alternating projections. http:\/\/docserver.carma.newcastle.edu.au\/id\/eprint\/1463 . Honours thesis, Univ. of Newcastle (2012)"},{"key":"381_CR19","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971941","volume-title":"Alternating Projection Methods. Fundamentals of Algorithms","author":"R. Escalante","year":"2011","unstructured":"Escalante, R., Raydan, M.: Alternating Projection Methods. Fundamentals of Algorithms. Society for Industrial and Applied Mathematics, Philadelphia (2011)"},{"issue":"1","key":"381_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/02331934.2011.632502","volume":"61","author":"J. Borwein","year":"2012","unstructured":"Borwein, J.: Maximum entropy and feasibility methods for convex and nonconvex inverse problems. Optimization 61(1), 1\u201333 (2012)","journal-title":"Optimization"},{"issue":"7","key":"381_CR21","doi-asserted-by":"crossref","first-page":"1334","DOI":"10.1364\/JOSAA.19.001334","volume":"19","author":"H. Bauschke","year":"2002","unstructured":"Bauschke, H., Combettes, P., Luke, D.: Phase retrieval, error reduction algorithm, and Fienup variants: a view from convex optimization. J. Opt. Soc. Am. A 19(7), 1334\u20131345 (2002)","journal-title":"J. Opt. Soc. Am. A"},{"issue":"6","key":"381_CR22","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1364\/JOSAA.20.001025","volume":"20","author":"H. Bauschke","year":"2003","unstructured":"Bauschke, H., Combettes, P., Luke, D.: Hybrid projection\u2013reflection method for phase retrieval. J.\u00a0Opt. Soc. Am. A 20(6), 1025\u20131034 (2003)","journal-title":"J.\u00a0Opt. Soc. Am. A"},{"issue":"2","key":"381_CR23","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.: Searching with iterated maps. Proc. Natl. Acad. Sci. 104(2), 418\u2013423 (2007)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"3","key":"381_CR24","doi-asserted-by":"crossref","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), 036,706 (2008)","journal-title":"Phys. Rev. E"},{"key":"381_CR25","unstructured":"Schaad, J.: Modeling the 8-queens problem and sudoku using an algorithm based on projections onto nonconvex sets. Master\u2019s thesis, Univ. of British Columbia (2010)"},{"issue":"4","key":"381_CR26","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/s10208-008-9036-y","volume":"9","author":"A. Lewis","year":"2009","unstructured":"Lewis, A., Luke, D., Malick, J.: Local linear convergence for alternating and averaged nonconvex projections. Found. Comput. Math. 9(4), 485\u2013513 (2009)","journal-title":"Found. Comput. Math."},{"key":"381_CR27","unstructured":"Bauschke, H., Luke, D., Phan, H., Wang, X.: Restricted normal cones and the method of alternating projections. Set-Valued Var. Anal. To appear (2013). http:\/\/arxiv.org\/pdf\/1205.0318v1"},{"key":"381_CR28","unstructured":"Hesse, R., Luke, D.: Nonconvex notions of regularity and convergence of fundamental algorithms for feasibility problems. Preprint (2012). http:\/\/arxiv.org\/pdf\/1205.0318v1"},{"key":"381_CR29","unstructured":"Drusvyatskiy, D., Ioffe, A., Lewis, A.: Alternating projections: a new approach. In preparation"},{"key":"381_CR30","doi-asserted-by":"crossref","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":"J. Borwein","year":"2011","unstructured":"Borwein, J., 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 (2011)"},{"key":"381_CR31","author":"F. Arag\u00f3n Artacho","year":"2012","unstructured":"Arag\u00f3n Artacho, F., Borwein, J.: Global convergence of a non-convex Douglas\u2013Rachford iteration. J.\u00a0Glob. Optim. (2012). doi: 10.1007\/s10898-012-9958-4","journal-title":"J.\u00a0Glob. Optim."},{"key":"381_CR32","series-title":"Canadian Mathematical Society Societe Mathematique Du Canada","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-9467-7","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"H. Bauschke","year":"2011","unstructured":"Bauschke, H., Combettes, P.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces. Canadian Mathematical Society Societe Mathematique Du Canada. Springer, New York (2011)"},{"issue":"2","key":"381_CR33","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1090\/S0002-9939-1987-0902536-7","volume":"101","author":"S. Reich","year":"1987","unstructured":"Reich, S., Shafrir, I.: The asymptotic behavior of firmly nonexpansive mappings. Proc. Am. Math. Soc. 101(2), 246\u2013250 (1987)","journal-title":"Proc. Am. Math. Soc."},{"key":"381_CR34","unstructured":"Bruck, R., Reich, S.: Nonexpansive projections and resolvents of accretive operators in Banach space. Houst. J. Math. 4 (1977)"},{"issue":"53","key":"381_CR35","first-page":"1","volume":"2012","author":"H. Bauschke","year":"2012","unstructured":"Bauschke, H., Mart\u00edn-M\u00e1rquez, V., Moffat, S., Wang, X.: Compositions and convex combinations of asymptotically regular firmly nonexpansive mappings are also asymptotically regular. Fixed Point Theory Appl. 2012(53), 1\u201311 (2012)","journal-title":"Fixed Point Theory Appl."},{"issue":"4","key":"381_CR36","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.: Weak convergence of the sequence of successive approximations for nonexpansive mappings. Bull. Am. Math. Soc. 73(4), 591\u2013597 (1967)","journal-title":"Bull. Am. Math. Soc."},{"issue":"7","key":"381_CR37","doi-asserted-by":"crossref","first-page":"644","DOI":"10.2307\/27642008","volume":"113","author":"A. Netyanun","year":"2006","unstructured":"Netyanun, A., Solmon, D.: Iterated products of projections in Hilbert space. Am. Math. Mon. 113(7), 644\u2013648 (2006)","journal-title":"Am. Math. Mon."},{"issue":"1","key":"381_CR38","doi-asserted-by":"crossref","first-page":"21","DOI":"10.4153\/CMB-1992-003-0","volume":"35","author":"J. Borwein","year":"1992","unstructured":"Borwein, J., Reich, S., Shafrir, I.: Krasnoselski\u2013Mann iterations in normed spaces. Can. Math. Bull. 35(1), 21\u201328 (1992)","journal-title":"Can. Math. Bull."},{"issue":"3","key":"381_CR39","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.: Proximity maps for convex sets. Proc. Am. Math. Soc. 10(3), 448\u2013450 (1959)","journal-title":"Proc. Am. Math. Soc."},{"issue":"1","key":"381_CR40","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"D. Wolpert","year":"1997","unstructured":"Wolpert, D., Macready, W.: No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1(1), 67\u201382 (1997)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"381_CR41","doi-asserted-by":"crossref","unstructured":"Arag\u00f3n Artacho, F., Borwein, J., Tam, M.: 2013, Recent results on Douglas\u2013Rachford methods for combinatorial optimization problems. Preprint. arXiv:1305.2657v1","DOI":"10.1007\/s10957-013-0488-0"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-013-0381-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-013-0381-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-013-0381-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,21]],"date-time":"2019-07-21T06:35:33Z","timestamp":1563690933000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-013-0381-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,17]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["381"],"URL":"https:\/\/doi.org\/10.1007\/s10957-013-0381-x","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8,17]]}}}