On the finite convergence of the Douglas-Rachford algorithm for solving (not necessarily convex) feasibility problems in Euclidean spaces
Optimization and Control
2020-04-14 v1 Functional Analysis
Numerical Analysis
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.
Keywords
Cite
@article{arxiv.1604.04657,
title = {On the finite convergence of the Douglas-Rachford algorithm for solving (not necessarily convex) feasibility problems in Euclidean spaces},
author = {Heinz H. Bauschke and Minh N. Dao},
journal= {arXiv preprint arXiv:1604.04657},
year = {2020}
}