University thesis:
Dissertation, Georg-August-Universität Göttingen, 2019
Footnote:
Description:
This thesis investigates the local and global convergence analysis of the relaxed Douglas-Rachford method. This algorithm, which was first proposed over a decade ago, has become a standard procedure in applications. Convergence results for this algorithm are limited either to convex feasibility or consistent nonconvex feasibility with strong assumptions on the regularity of the underlying sets. After discussing feasibility problems and projection methods to solve these in general, we investigate the relaxed Douglas-Rachford method in detail for inconsistent and nonconvex feasibility problem...