Unrestricted Douglas-Rachford algorithms for solving convex feasibility problems in Hilbert space

Kay Barshad, Aviv Gibali, Simeon Reich

In this work we focus on the convex feasibility problem (CFP) in Hilbert space. A specific method in this area that has gained a lot of interest in recent years is the Douglas-Rach…