On Douglas-Rachford operators that fail to be proximal mappings

DOI10.1007/s10107-016-1076-5OpenAlexW2962957542MaRDI QIDQ2413080

Jason Schaad, Heinz H. Bauschke, Shawn Xianfu Wang

Publication date: 6 April 2018

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

zbMATH Keywords

resolventnowhere dense setmaximally monotone operatorDouglas-Rachford algorithmfirmly nonexpansive mappingproximal mapping

Mathematics Subject Classification ID

Convex programming (90C25) Monotone operators and generalizations (47H05) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)

Related Items

Monotone operator theory in convex optimization, SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Firmly nonexpansive mappings and maximally monotone operators: correspondence and duality
• Fifty years of maximal monotonicity
• Conjugate duality in convex optimization
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• Set-valued mappings and enlargement of monotone operators.
• From Hahn--Banach to monotonicity
• Techniques of variational analysis
• Genericity in nonlinear analysis
• On Borwein–Wiersma Decompositions of Monotone Linear Relations
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• On the Convergence of the Proximal Point Algorithm for Convex Minimization
• Monotone Operators and the Proximal Point Algorithm
• Variational Analysis
• Signal Recovery by Proximal Forward-Backward Splitting
• Proximité et dualité dans un espace hilbertien
• Convex Analysis
• Convex analysis and monotone operator theory in Hilbert spaces