Recent Results on Douglas–Rachford Methods for Combinatorial Optimization Problems

Journal of Optimization Theory and Applications

Volumn 163, Issue 1, 2014, Pages 1-30

  Aragón Artacho, Francisco J ^a   Borwein, Jonathan M ^b,c   Tam, Matthew K ^b  

^a UNIVERSITY OF LUXEMBOURG   (Luxembourg)

^b UNIVERSITY OF NEWCASTLE   (Australia)

^c KING ABDULAZIZ UNIVERSITY   (Saudi Arabia)

Author keywords

Combinatorial optimization; Douglas Rachford; Feasibility; Modelling; Nonograms; Projections; Reflections; Satisfiability; Sudoku

Indexed keywords

COMBINATORIAL OPTIMIZATION PROBLEMS; DOUGLAS; DOUGLA–RACHFORD; FEASIBILITY; MODELING; NONOGRAM; POSITIVE EXPERIENCES; PROJECTION; SATISFIABILITY; SUDOKU;

COMBINATORIAL OPTIMIZATION;

EID: 84941996535     PISSN: 00223239     EISSN: 15732878     Source Type: Journal    
DOI: 10.1007/s10957-013-0488-0     Document Type: Article

References (41)

1. 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–439 (1956)
2. Lions, P., Mercier, B.: Splitting algorithms for the sum of two nonlinear operators. SIAM J. Numer. Anal. 964–979 (1979)
3. Combettes, P.: Solving monotone inclusions via compositions of nonexpansive averaged operators. Optimization 53(5–6), 475–504 (2004)
4. Borwein, J., Zhu, Q.: Techniques of Variational Analysis. CMS Books in Mathematics. Springer, New York (2005)
5. Borwein, J., Sims, B.: The Douglas–Rachford algorithm in the absence of convexity. In: Fixed-Point Algorithms for Inverse Problems in Science and Engineering, pp. 93–109. Springer, Berlin (2011)
6. 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–192 (2004)
7. Bauschke, H., Borwein, J.: On the convergence of von Neumann’s alternating projection algorithm for two sets. Set-Valued Anal. 1(2), 185–212 (1993)
8. Combettes, P., Pesquet, J.: A Douglas–Rachford splitting approach to nonsmooth convex variational signal recovery. IEEE J. Sel. Top. Signal Process. 1(4), 564–574 (2007)
9. 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–156 (2010)
10. Steidl, G., Teuber, T.: Removing multiplicative noise by Douglas–Rachford splitting methods. J. Math. Imaging Vis. 36(2), 168–184 (2010)
11. Svaiter, B.F.: On weak convergence of the Douglas-Rachford method. SIAM J. Control Optim. 49(1), 280–287 (2011)
12. Yamada, I., Gandy, S., Yamagishi, M.: Sparsity-aware adaptive filtering based on a Douglas–Rachford splitting. In: Proc. EUSIPCO, pp. 1929–1933 (2011)
13. Bauschke, H., Combettes, P.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces. Springer, New York (2011)
14. Opial, Z.: Weak convergence of the sequence of successive approximations for nonexpansive mappings. Bull. Am. Math. Soc. 73(4), 591–597 (1967)
15. Borwein, J.M., Tam, M.K.: The cyclic Douglas–Rachford method for inconsistent feasibility problems. Preprint (2013). arXiv:1310.2195
16. Borwein, J., Tam, M.: A cyclic Douglas-Rachford iteration scheme. J. Optim. Theory Appl. (2013). doi:10.1007/s10957-013-0381-x
17. Bauschke, H., Matoušková, E., Reich, S.: Projection and proximal point methods: convergence results and counterexamples. Nonlinear Anal.: Theory Methods Appl. 56(5), 715–738 (2004)
18. Borwein, J., Vanderwerff, J.: Convex Functions: Constructions, Characterizations and Counterexamples. Encyclopedia of Mathematics and Its Applications. Cambridge University Press, Cambridge (2010)
19. Aragón Artacho, F., Borwein, J.: Global convergence of a non-convex Douglas–Rachford iteration. J. Glob. Optim. (2012), 17 pp. doi:10.1007/s10898-012-9958-4
20. Hesse, R., Luke, D.: Nonconvex notions of regularity and convergence of fundamental algorithms for feasibility problems. Preprint (2012). arXiv:1205.0318v1
21. 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
22. Babu, P., Pelckmans, K., Stoica, P., Li, J.: Linear systems, sparse solutions, and Sudoku. IEEE Signal Process. Lett. 17(1), 40–42 (2010)
23. Aragón Artacho, F., Borwein, J., Tam, M.: Douglas–Rachford feasibility methods for matrix completion problems (2013). Preprint arXiv:1308.4243
24. Elser, V., Rankenburg, I.: Deconstructing the energy landscape: constraint-based algorithms for folding heteropolymers. Phys. Rev. E 73(2), 026,702 (2006)
25. Elser, V., Rankenburg, I., Thibault, P.: Searching with iterated maps. Proc. Natl. Acad. Sci. 104(2), 418–423 (2007)
26. 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–1345 (2002)
27. Bauschke, H., Combettes, P., Luke, D.: Hybrid projection–reflection method for phase retrieval. J. Opt. Soc. Am. A 20(6), 1025–1034 (2003)
28. Johnson, C.: Matirx completion problems: a survey. In: Proc. Sympos. Appl. Math., pp. 171–198 (1990)
29. Schaad, J.: Modeling the 8-queens problem and Sudoku using an algorithm based on projections onto nonconvex sets. Master’s thesis, Univ. British Columbia (2010)
30. Gravel, S., Elser, V.: Divide and concur: a general approach to constraint satisfaction. Phys. Rev. E 78(3), 036706 (2008)
31. Garey, R., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. A Series of Books in the Mathematical Sciences. Freeman, New York (1979)
32. Takenaga, Y., Walsh, T.: Tetravex is NP-complete. Inf. Process. Lett. 99, 171–174 (2006)
33. Bansal, P.: Code for solving Tetravex using Douglas–Rachford algorithm (2010). http://people.ok.ubc.ca/bauschke/Pulkit/pulkitreport.pdf
34. 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–1060 (2003)
35. 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
36. van Rijn, J.: Playing games: The complexity of Klondike, Mahjong, nonograms and animal chess. Master’s thesis, Leiden Inst. of Advanc. Computer Science, Leiden Univ. (2012)
37. Hardy, G., Littlewood, J., Pólya, G.: Inequalities. Cambridge Mathematical Library. Cambridge University Press, Cambridge (1952)
38. Elser, V.: Private communication. August 27th (2012)
39. Bosch, R.: Painting by numbers. Optima 65, 16–17 (2001)
40. Bačák, M., Searston, I., Sims, B.: Alternating projections in CAT(0) spaces. J. Math. Anal. Appl. 385(2), 599–607 (2012)
41. Searston, I., Sims, B.: Nonlinear analysis in geodesic metric spaces, in particular CAT(0) spaces. Preprint (2013)