On the range of the Douglas-Rachford operator
From MaRDI portal
Attouch-Théra dualityBrezis-Haraux theoremconvex functiondisplacement mappingDouglas-Rachford splitting operatorfirmly nonexpansive mappingmaximally monotone operatornear equalitynearly convex setnormal problemrangesubdifferential operator
Monotone operators and generalizations (47H05) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Perturbations of nonlinear operators (47H14) Decomposition methods (49M27) Numerical methods involving duality (49M29) Duality theory (optimization) (49N15) Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)
Abstract: The problem of finding a minimizer of the sum of two convex functions - or, more generally, that of finding a zero of the sum of two maximally monotone operators - is of central importance in variational analysis. Perhaps the most popular method of solving this problem is the Douglas-Rachford splitting method. Surprisingly, little is known about the range of the Douglas-Rachford operator. In this paper, we set out to study this range systematically. We prove that for 3* monotone operators a very pleasing formula can be found that reveals the range to be nearly equal to a simple set involving the domains and ranges of the underlying operators. A similar formula holds for the range of the corresponding displacement mapping. We discuss applications to subdifferential operators, to the infimal displacement vector, and to firmly nonexpansive mappings. Various examples and counter-examples are presented, including some concerning the celebrated Brezis-Haraux theorem.
Recommendations
- On the order of the operators in the Douglas-Rachford algorithm
- On Douglas-Rachford operators that fail to be proximal mappings
- On weak convergence of the Douglas-Rachford method
- On the convergence rate of Douglas-Rachford operator splitting method
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
Cites work
- A proximal decomposition method for solving convex variational inverse problems
- Asymptotic behavior of contractions in Hilbert space
- Attouch-Théra duality revisited: Paramonotonicity and operator splitting
- Composition duality and maximal monotonicity
- Duality for almost convex optimization problems via the perturbation approach
- Dualization of Generalized Equations of Maximal Monotone Type
- Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
- Firmly nonexpansive mappings and maximally monotone operators: correspondence and duality
- Generalized solutions for the sum of two maximally monotone operators
- scientific article; zbMATH DE number 42636 (Why is no real title available?)
- scientific article; zbMATH DE number 45061 (Why is no real title available?)
- scientific article; zbMATH DE number 3595777 (Why is no real title available?)
- scientific article; zbMATH DE number 3615396 (Why is no real title available?)
- scientific article; zbMATH DE number 464662 (Why is no real title available?)
- scientific article; zbMATH DE number 1821400 (Why is no real title available?)
- scientific article; zbMATH DE number 967071 (Why is no real title available?)
- Image d'une somme d'opérateurs monotones et applications
- Iterative construction of the resolvent of a sum of maximal monotone operators
- Monotone (nonlinear) operators in Hilbert space
- Near equality, near convexity, sums of maximally monotone operators, and averages of firmly nonexpansive mappings
- Nearly convex sets: fine properties and domains or ranges of subdifferentials of convex functions
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On the Maximality of Sums of Nonlinear Monotone Operators
- Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators
- Rectangularity and paramonotonicity of maximally monotone operators
- Smooth methods of multipliers for complementarity problems
- Solving monotone inclusions via compositions of nonexpansive averaged operators
- Splitting Algorithms for the Sum of Two Nonlinear Operators
Cited in
(19)- The range of the tangential Cauchy-Riemann operator
- A note on the Douglas-Rachford splitting method for optimization problems involving hypoconvex functions
- The forward-backward algorithm and the normal problem
- On the density of the range for some nonlinear operators
- Resolvents and Yosida approximations of displacement mappings of isometries
- Douglas-Rachford splitting and ADMM for pathological convex optimization
- A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs
- On the Douglas-Rachford algorithm
- On Douglas-Rachford operators that fail to be proximal mappings
- On the minimal displacement vector of the Douglas-Rachford operator
- The resolvent average of monotone operators: dominant and recessive properties
- On the order of the operators in the Douglas-Rachford algorithm
- The Douglas-Rachford algorithm for two (not necessarily intersecting) affine subspaces
- On the Behavior of the Douglas--Rachford Algorithm for Minimizing a Convex Function Subject to a Linear Constraint
- SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD
- Convergence analysis of Douglas-Rachford splitting method for ``strongly + weakly convex programming
- On a lemma by Brézis and Haraux
- Near convexity and generalized differentiation
- The range of the Douglas-Rachford operator in infinite-dimensional Hilbert spaces
This page was built for publication: On the range of the Douglas-Rachford operator
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3186532)
