Global behavior of the Douglas–Rachford method for a nonconvex feasibility problem
- 384 Downloads
In recent times the Douglas–Rachford algorithm has been observed empirically to solve a variety of nonconvex feasibility problems including those of a combinatorial nature. For many of these problems current theory is not sufficient to explain this observed success and is mainly concerned with questions of local convergence. In this paper we analyze global behavior of the method for finding a point in the intersection of a half-space and a potentially non-convex set which is assumed to satisfy a well-quasi-ordering property or a property weaker than compactness. In particular, the special case in which the second set is finite is covered by our framework and provides a prototypical setting for combinatorial optimization problems.
KeywordsDouglas–Rachford algorithm Global convergence Feasibility problem Half-space Non-convex
Mathematics Subject Classification90C26 65K05
We would like to thank the anonymous referee for their helpful suggestions and comments.
- 4.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)Google Scholar
- 7.Bauschke, H.H., Dao, M.N., Moursi, W.M.: The Douglas–Rachford algorithm in the affine-convex case. arXiv:1505.06408v1
- 11.Benoist, J.: The Douglas–Rachford algorithm for the case of the sphere and the line. J. Global Optim. (2015). doi: 10.1007/s10898-015-0296-1
- 12.Borwein, J.M., Sims, B.: The Douglas–Rachford 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–109. Springer, New York (2011). doi: 10.1007/978-1-4419-9569-8
- 18.Phan, H.M.: Linear convergence of the Douglas–Rachford method for two closed sets. Optim. (2015). doi: 10.1080/02331934.2015.1051532