BIRS Workshop Lecture Videos

Banff International Research Station Logo

BIRS Workshop Lecture Videos

The Douglas-Rachford algorithm in the possibly inconsistent case Moursi, Walaa


The Douglas–Rachford algorithm is a very popular splitting technique for finding a zero of the sum of two maximally monotone operators. The behaviour of the algorithm remains mysterious in the general inconsistent case, i.e., when the sum problem has no zeros. However, more than a decade ago, it was shown that in the (possibly inconsistent) convex feasibility setting, the shadow sequence remains bounded and its weak cluster points solve a best approximation problem. In this talk, we advance the understanding of the inconsistent case significantly by presenting a complete proof of the full weak convergence in the convex feasibility setting. We also provide linear rate of convergence and strong convergence in special cases.

Item Media

Item Citations and Data


Attribution-NonCommercial-NoDerivatives 4.0 International