On the Finite Convergence of the Douglas-Rachford Algorithm for Solving (Not Necessarily Convex) Feasibility Problems in Euclidean Spaces

Heinz H. Bauschke, Minh N. Dao. On the Finite Convergence of the Douglas-Rachford Algorithm for Solving (Not Necessarily Convex) Feasibility Problems in Euclidean Spaces. SIAM Journal on Optimization, 27(1):507-537, 2017. [doi]

@article{BauschkeD17,
  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},
  year = {2017},
  doi = {10.1137/16M1071079},
  url = {https://doi.org/10.1137/16M1071079},
  researchr = {https://researchr.org/publication/BauschkeD17},
  cites = {0},
  citedby = {0},
  journal = {SIAM Journal on Optimization},
  volume = {27},
  number = {1},
  pages = {507-537},
}