{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T04:26:17Z","timestamp":1772771177538,"version":"3.50.1"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,12,3]],"date-time":"2013-12-03T00:00:00Z","timestamp":1386028800000},"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,10]]},"DOI":"10.1007\/s10957-013-0488-0","type":"journal-article","created":{"date-parts":[[2013,12,2]],"date-time":"2013-12-02T19:40:09Z","timestamp":1386013209000},"page":"1-30","source":"Crossref","is-referenced-by-count":45,"title":["Recent Results on Douglas\u2013Rachford Methods for Combinatorial Optimization Problems"],"prefix":"10.1007","volume":"163","author":[{"given":"Francisco J.","family":"Arag\u00f3n\u00a0Artacho","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":[[2013,12,3]]},"reference":[{"issue":"2","key":"488_CR1","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."},{"key":"488_CR2","doi-asserted-by":"crossref","unstructured":"Lions, P., Mercier, B.: Splitting algorithms for the sum of two nonlinear operators. SIAM J. Numer. Anal. 964\u2013979 (1979)","DOI":"10.1137\/0716071"},{"issue":"5\u20136","key":"488_CR3","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1080\/02331930412331327157","volume":"53","author":"P. Combettes","year":"2004","unstructured":"Combettes, P.: Solving monotone inclusions via compositions of nonexpansive averaged operators. Optimization 53(5\u20136), 475\u2013504 (2004)","journal-title":"Optimization"},{"key":"488_CR4","series-title":"CMS Books in Mathematics","volume-title":"Techniques of Variational Analysis","author":"J. Borwein","year":"2005","unstructured":"Borwein, J., Zhu, Q.: Techniques of Variational Analysis. CMS Books in Mathematics. Springer, New York (2005)"},{"key":"488_CR5","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. Springer, Berlin (2011)"},{"issue":"2","key":"488_CR6","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":"2","key":"488_CR7","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."},{"issue":"4","key":"488_CR8","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1109\/JSTSP.2007.910264","volume":"1","author":"P. Combettes","year":"2007","unstructured":"Combettes, P., Pesquet, J.: A Douglas\u2013Rachford splitting approach to nonsmooth convex variational signal recovery. IEEE J. Sel. Top. Signal Process. 1(4), 564\u2013574 (2007)","journal-title":"IEEE J. Sel. Top. Signal Process."},{"issue":"5","key":"488_CR9","first-page":"147","volume":"2","author":"S. Gandy","year":"2010","unstructured":"Gandy, S., Yamada, I.: Convex optimization techniques for the efficient recovery of a sparsely corrupted low-rank matrix. J. Math for Industry 2(5), 147\u2013156 (2010)","journal-title":"J. Math for Industry"},{"issue":"2","key":"488_CR10","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/s10851-009-0179-5","volume":"36","author":"G. Steidl","year":"2010","unstructured":"Steidl, G., Teuber, T.: Removing multiplicative noise by Douglas\u2013Rachford splitting methods. J. Math. Imaging Vis. 36(2), 168\u2013184 (2010)","journal-title":"J. Math. Imaging Vis."},{"issue":"1","key":"488_CR11","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1137\/100788100","volume":"49","author":"B.F. Svaiter","year":"2011","unstructured":"Svaiter, B.F.: On weak convergence of the Douglas-Rachford method. SIAM J. Control Optim. 49(1), 280\u2013287 (2011)","journal-title":"SIAM J. Control Optim."},{"key":"488_CR12","first-page":"1929","volume-title":"Proc. EUSIPCO","author":"I. Yamada","year":"2011","unstructured":"Yamada, I., Gandy, S., Yamagishi, M.: Sparsity-aware adaptive filtering based on a Douglas\u2013Rachford splitting. In: Proc. EUSIPCO, pp. 1929\u20131933 (2011)"},{"key":"488_CR13","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. Springer, New York (2011)"},{"issue":"4","key":"488_CR14","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."},{"key":"488_CR15","unstructured":"Borwein, J.M., Tam, M.K.: The cyclic Douglas\u2013Rachford method for inconsistent feasibility problems. Preprint (2013). arXiv:1310.2195"},{"key":"488_CR16","author":"J. Borwein","year":"2013","unstructured":"Borwein, J., Tam, M.: A cyclic Douglas-Rachford iteration scheme. J. Optim. Theory Appl. (2013). doi: 10.1007\/s10957-013-0381-x","journal-title":"J. Optim. Theory Appl."},{"issue":"5","key":"488_CR17","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1016\/j.na.2003.10.010","volume":"56","author":"H. Bauschke","year":"2004","unstructured":"Bauschke, H., Matou\u0161kov\u00e1, E., Reich, S.: Projection and proximal point methods: convergence results and counterexamples. Nonlinear Anal.: Theory Methods Appl. 56(5), 715\u2013738 (2004)","journal-title":"Nonlinear Anal.: Theory Methods Appl."},{"key":"488_CR18","series-title":"Encyclopedia of Mathematics and Its Applications.","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139087322","volume-title":"Convex Functions: Constructions, Characterizations and Counterexamples","author":"J. Borwein","year":"2010","unstructured":"Borwein, J., Vanderwerff, J.: Convex Functions: Constructions, Characterizations and Counterexamples. Encyclopedia of Mathematics and Its Applications. Cambridge University Press, Cambridge (2010)"},{"key":"488_CR19","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), 17 pp. doi: 10.1007\/s10898-012-9958-4","journal-title":"J.\u00a0Glob. Optim."},{"key":"488_CR20","unstructured":"Hesse, R., Luke, D.: Nonconvex notions of regularity and convergence of fundamental algorithms for feasibility problems. Preprint (2012). arXiv:1205.0318v1"},{"key":"488_CR21","author":"H. Bauschke","year":"2012","unstructured":"Bauschke, H., Luke, D., Phan, H., Wang, X.: Restricted normal cones and sparsity optimization with affine constraints. Found. Comput. Math. (2012), 21 pp. doi: 10.1007\/s10208-013-9161-0","journal-title":"Found. Comput. Math."},{"issue":"1","key":"488_CR22","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1109\/LSP.2009.2032489","volume":"17","author":"P. Babu","year":"2010","unstructured":"Babu, P., Pelckmans, K., Stoica, P., Li, J.: Linear systems, sparse solutions, and Sudoku. IEEE Signal Process. Lett. 17(1), 40\u201342 (2010)","journal-title":"IEEE Signal Process. Lett."},{"key":"488_CR23","unstructured":"Arag\u00f3n Artacho, F., Borwein, J., Tam, M.: Douglas\u2013Rachford feasibility methods for matrix completion problems (2013). Preprint arXiv:1308.4243"},{"issue":"2","key":"488_CR24","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.73.026702","volume":"73","author":"V. Elser","year":"2006","unstructured":"Elser, V., Rankenburg, I.: Deconstructing the energy landscape: constraint-based algorithms for folding heteropolymers. Phys. Rev. E 73(2), 026,702 (2006)","journal-title":"Phys. Rev. E"},{"issue":"2","key":"488_CR25","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":"7","key":"488_CR26","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":"488_CR27","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"},{"key":"488_CR28","doi-asserted-by":"crossref","unstructured":"Johnson, C.: Matirx completion problems: a survey. In: Proc. Sympos. Appl. Math., pp. 171\u2013198 (1990)","DOI":"10.1090\/psapm\/040\/1059486"},{"key":"488_CR29","unstructured":"Schaad, J.: Modeling the 8-queens problem and Sudoku using an algorithm based on projections onto nonconvex sets. Master\u2019s thesis, Univ. British Columbia (2010)"},{"issue":"3","key":"488_CR30","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), 036706 (2008)","journal-title":"Phys. Rev. E"},{"key":"488_CR31","series-title":"A\u00a0Series of Books in the Mathematical Sciences","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"R. Garey","year":"1979","unstructured":"Garey, R., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. A\u00a0Series of Books in the Mathematical Sciences. Freeman, New York (1979)"},{"key":"488_CR32","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/j.ipl.2006.04.010","volume":"99","author":"Y. Takenaga","year":"2006","unstructured":"Takenaga, Y., Walsh, T.: Tetravex is NP-complete. Inf. Process. Lett. 99, 171\u2013174 (2006)","journal-title":"Inf. Process. Lett."},{"key":"488_CR33","unstructured":"Bansal, P.: Code for solving Tetravex using Douglas\u2013Rachford algorithm (2010). http:\/\/people.ok.ubc.ca\/bauschke\/Pulkit\/pulkitreport.pdf"},{"issue":"5","key":"488_CR34","first-page":"1052","volume":"86","author":"Y. Takayuki","year":"2003","unstructured":"Takayuki, Y., Takahiro, S.: Complexity and completeness of finding another solution and its application to puzzles. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86(5), 1052\u20131060 (2003)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"488_CR35","unstructured":"Nagao, T., Ueda, N.: NP-completeness results for nonogram via parsimonious reductions. Depart. Computer Science, Tokyo Inst. Technol. Tech. Rep. TR96-0008 (2012). CiteSeerX doi: http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.57.5277"},{"key":"488_CR36","unstructured":"van Rijn, J.: Playing games: The complexity of Klondike, Mahjong, nonograms and animal chess. Master\u2019s thesis, Leiden Inst. of Advanc. Computer Science, Leiden Univ. (2012)"},{"key":"488_CR37","series-title":"Cambridge Mathematical Library","volume-title":"Inequalities","author":"G. Hardy","year":"1952","unstructured":"Hardy, G., Littlewood, J., P\u00f3lya, G.: Inequalities. Cambridge Mathematical Library. Cambridge University Press, Cambridge (1952)"},{"key":"488_CR38","unstructured":"Elser, V.: Private communication. August 27th (2012)"},{"key":"488_CR39","first-page":"16","volume":"65","author":"R. Bosch","year":"2001","unstructured":"Bosch, R.: Painting by numbers. Optima 65, 16\u201317 (2001)","journal-title":"Optima"},{"issue":"2","key":"488_CR40","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1016\/j.jmaa.2011.06.079","volume":"385","author":"M. Ba\u010d\u00e1k","year":"2012","unstructured":"Ba\u010d\u00e1k, M., Searston, I., Sims, B.: Alternating projections in CAT(0) spaces. J. Math. Anal. Appl. 385(2), 599\u2013607 (2012)","journal-title":"J. Math. Anal. Appl."},{"key":"488_CR41","unstructured":"Searston, I., Sims, B.: Nonlinear analysis in geodesic metric spaces, in particular CAT(0) spaces. Preprint (2013)"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-013-0488-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-013-0488-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-013-0488-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,4]],"date-time":"2019-08-04T10:12:33Z","timestamp":1564913553000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-013-0488-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,3]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["488"],"URL":"https:\/\/doi.org\/10.1007\/s10957-013-0488-0","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,3]]}}}