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

Heinz H. BauschkeMinh N. Dao
Published in: SIAM J. Optim. (2017)
Keyphrases
  • quadratic optimization problems
  • iterative algorithms
  • convex hull
  • convergence rate
  • euclidean space
  • stochastic shortest path
  • gauss seidel method
  • search space
  • low dimensional