On the Range of the Douglas–Rachford Operator

DOI10.1287/moor.2015.0759zbMath1350.47035arXiv1405.4006OpenAlexW2963344802MaRDI QIDQ3186532

Walaa M. Moursi, Heinz H. Bauschke, Warren L. Hare

Publication date: 10 August 2016

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.4006

zbMATH Keywords

convex functionrangemaximally monotone operatorAttouch-Théra dualityDouglas-Rachford splitting operatorfirmly nonexpansive mappingsubdifferential operatornearly convex setBrezis-Haraux theoremnormal problemdisplacement mappingnear equality

Mathematics Subject Classification ID

Convex programming (90C25) Numerical methods involving duality (49M29) Optimality conditions and duality in mathematical programming (90C46) Monotone operators and generalizations (47H05) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Duality theory (optimization) (49N15) Decomposition methods (49M27) Perturbations of nonlinear operators (47H14)

Related Items (12)

On the Douglas-Rachford algorithm ⋮ A note on the Douglas-Rachford splitting method for optimization problems involving hypoconvex functions ⋮ On the minimal displacement vector of the Douglas-Rachford operator ⋮ The forward-backward algorithm and the normal problem ⋮ The Resolvent Average of Monotone Operators: Dominant and Recessive Properties ⋮ Douglas-Rachford splitting and ADMM for pathological convex optimization ⋮ The Douglas--Rachford Algorithm for Two (Not Necessarily Intersecting) Affine Subspaces ⋮ Resolvents and Yosida approximations of displacement mappings of isometries ⋮ On the Behavior of the Douglas--Rachford Algorithm for Minimizing a Convex Function Subject to a Linear Constraint ⋮ A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs ⋮ SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD ⋮ Convergence Analysis of Douglas--Rachford Splitting Method for “Strongly + Weakly” Convex Programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nearly convex sets: fine properties and domains or ranges of subdifferentials of convex functions
• Near equality, near convexity, sums of maximally monotone operators, and averages of firmly nonexpansive mappings
• Firmly nonexpansive mappings and maximally monotone operators: correspondence and duality
• Attouch-Théra duality revisited: Paramonotonicity and operator splitting
• Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators
• Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
• Duality for almost convex optimization problems via the perturbation approach
• Monotone (nonlinear) operators in Hilbert space
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• Image d'une somme d'opérateurs monotones et applications
• Composition duality and maximal monotonicity
• Smooth methods of multipliers for complementarity problems
• Asymptotic behavior of contractions in Hilbert space
• A proximal decomposition method for solving convex variational inverse problems
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• Dualization of Generalized Equations of Maximal Monotone Type
• Solving monotone inclusions via compositions of nonexpansive averaged operators
• Rectangularity and paramonotonicity of maximally monotone operators
• Generalized Solutions for the Sum of Two Maximally Monotone Operators
• On the Maximality of Sums of Nonlinear Monotone Operators

This page was built for publication: On the Range of the Douglas–Rachford Operator