arXiv Analytics

Sign in

arXiv:2206.07204 [math.OC]AbstractReferencesReviewsResources

The range of the Douglas-Rachford operator in infinite-dimensional Hilbert spaces

Walaa M. Moursi

Published 2022-06-14Version 1

The Douglas-Rachford algorithm is one of the most prominent splitting algorithms for solving convex optimization problems. Recently, the method has been successful in finding a generalized solution (provided that one exists) for optimization problems in the inconsistent case, i.e., when a solution does not exist. The convergence analysis of the inconsistent case hinges on the study of the range of the displacement operator associated with the Douglas-Rachford splitting operator and the corresponding minimal displacement vector. In this paper, we provide a formula for the range of the Douglas-Rachford splitting operator in (possibly) infinite-dimensional Hilbert space under mild assumptions on the underlying operators. Our new results complement known results in finite-dimensional Hilbert spaces. Several examples illustrate and tighten our conclusions.

Related articles: Most relevant | Search more
arXiv:1505.02796 [math.OC] (Published 2015-05-11)
On the order of the operators in the Douglas-Rachford algorithm
arXiv:1602.05626 [math.OC] (Published 2016-02-17)
On Douglas-Rachford operators that fail to be proximal mappings
arXiv:1708.08697 [math.OC] (Published 2017-08-29)
A Lyapunov function construction for the Douglas-Rachford operator in a non-convex setting