Abstract: The Douglas-Rachford algorithm is one of the most successful methods for feasibility and optimization. A notable feature is its ability to accommodate nonsmooth objective function and it also has been applied as a heuristic method on nonconvex problems with great success.
In this talk, I will report on recent progress on the understanding of this algorithm. I will focus on the range of the operator and new qualitative and quantitative convergence results.