Computing the resolvent of the sum of operators with application to best approximation problems
DOI10.1007/s11590-019-01432-xzbMath1445.47042arXiv1809.03921OpenAlexW2963021728WikidataQ127866724 ScholiaQ127866724MaRDI QIDQ2191289
Publication date: 24 June 2020
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.03921
resolventstrong convergenceoperator splittinglinear convergencebest approximationprojectorproximity operatorDouglas-Rachford algorithmPeaceman-Rachford algorithm
Numerical methods involving duality (49M29) Monotone operators and generalizations (47H05) Iterative procedures involving nonlinear operators (47J25) Best approximation, Chebyshev systems (41A50)
Related Items (6)
Cites Work
- Unnamed Item
- Unnamed Item
- Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems
- On the asymptotic behaviour of the Aragón Artacho-Campoy algorithm
- Computing the resolvent of the sum of maximally monotone operators with the averaged alternating modified reflections algorithm
- The Numerical Solution of Parabolic and Elliptic Differential Equations
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- An Algorithm for Restricted Least Squares Regression
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Linear Convergence of Projection Algorithms
- Adaptive Douglas--Rachford Splitting Algorithm for the Sum of Two Operators
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: Computing the resolvent of the sum of operators with application to best approximation problems