Back to Search
Start Over
On the finite convergence of the Douglas-Rachford algorithm for solving (not necessarily convex) feasibility problems in Euclidean spaces
- Source :
- SIAM Journal on Optimization, 27(1):507--537, 2017
- Publication Year :
- 2016
-
Abstract
- Solving feasibility problems is a central task in mathematics and the applied sciences. One particularly successful method is the Douglas-Rachford algorithm. In this paper, we provide many new conditions sufficient for finite convergence. Numerous examples illustrate our results.
Details
- Database :
- arXiv
- Journal :
- SIAM Journal on Optimization, 27(1):507--537, 2017
- Publication Type :
- Report
- Accession number :
- edsarx.1604.04657
- Document Type :
- Working Paper
- Full Text :
- https://doi.org/10.1137/16M1071079