We're sorry but this page doesn't work properly without JavaScript enabled. Please enable it to continue.
Feedback

On the Douglas–Rachford operator in the (possibly) inconsistent case and related progress

Formal Metadata

Title
On the Douglas–Rachford operator in the (possibly) inconsistent case and related progress
Alternative Title
The Douglas-Rachford algorithm in the possibly inconsistent case
Title of Series
Number of Parts
30
Author
Contributors
License
CC Attribution - NonCommercial - NoDerivatives 4.0 International:
You are free to use, copy, distribute and transmit the work or content in unchanged form for any legal and non-commercial purpose as long as the work is attributed to the author in the manner specified by the author or licensor.
Identifiers
Publisher
Release Date
Language

Content Metadata

Subject Area
Genre
Abstract
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.