On a new simple algorithm to compute the resolvents
From MaRDI portal
Recommendations
- Computing the resolvent of composite operators
- Iterative construction of the resolvent of a sum of maximal monotone operators
- Computing the resolvent of the sum of operators with application to best approximation problems
- Resolvent splitting for sums of monotone operators with minimal lifting
- A new general approach to resolvent operators and proximal algorithms
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Adaptive Douglas-Rachford splitting algorithm for the sum of two operators
- Computing the resolvent of composite operators
- Computing the resolvent of the sum of operators with application to best approximation problems
- Convergence of a relaxed inertial forward-backward algorithm for structured monotone inclusions
- Convergence rate of inertial forward-backward algorithm beyond Nesterov's rule
- Convergence Rates in Forward--Backward Splitting
- Convergence rates of inertial forward-backward algorithms
- Convex analysis and monotone operator theory in Hilbert spaces
- Douglas-Rachford splitting algorithm for solving state-dependent maximal monotone inclusions
- Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
- Fast Proximal Methods via Time Scaling of Damped Inertial Dynamics
- Generalized monotone operators and their averaged resolvents
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- Introductory lectures on convex optimization. A basic course.
- Monotone (nonlinear) operators in Hilbert space
- Monotone Operators and the Proximal Point Algorithm
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- On the convergence rate of Douglas-Rachford operator splitting method
- Proximity algorithms for the L1/TV image denoising model
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Strengthened splitting methods for computing resolvents
- The Glowinski-Le Tallec splitting method revisited: a general convergence and convergence rate analysis
- Tight global linear convergence rate bounds for Douglas-Rachford splitting
This page was built for publication: On a new simple algorithm to compute the resolvents
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6166059)