On the Finite Convergence of the Douglas--Rachford Algorithm for Solving (Not Necessarily Convex) Feasibility Problems in Euclidean Spaces
研究了Douglas-Rachford算法在求解不一定凸的可行性问题时，在哪些条件下能保证有限步收敛，并用多个例子验证了结论。
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.