A simplified proof of weak convergence in Douglas-Rachford method
From MaRDI portal
Recommendations
- On weak convergence of the Douglas-Rachford method
- Inexact operator splitting method for monotone inclusion problems
- The Douglas-Rachford algorithm converges only weakly
- 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 family of projective splitting methods for the sum of two maximal monotone operators
- Monotone (nonlinear) operators in Hilbert space
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- On weak convergence of the Douglas-Rachford method
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
Cited in
(8)- On Douglas-Rachford operators that fail to be proximal mappings
- On weak convergence of the Douglas-Rachford method
- The Douglas-Rachford algorithm converges only weakly
- New demiclosedness principles for (firmly) nonexpansive operators
- Degenerate Preconditioned Proximal Point Algorithms
- A stochastic preconditioned Douglas-Rachford splitting method for saddle-point problems
- Linear convergence of resolvent splitting with minimal lifting and its application to a primal–dual algorithm
- On the convergence rate of Douglas-Rachford operator splitting method
This page was built for publication: A simplified proof of weak convergence in Douglas-Rachford method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2294319)