Iterative Methods for Computing the Resolvent of Composed Operators in Hilbert Spaces
The resolvent is a fundamental concept in studying various operator splitting algorithms. In this paper, we investigate the problem of computing the resolvent of compositions of operators with bounded linear operators. First, we discuss several explicit solutions of this resolvent operator by taking...
Main Authors: | Yixuan Yang, Yuchao Tang, Chuanxi Zhu |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2019-02-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/7/2/131 |
Similar Items
-
An Inertial Parametric Douglas–Rachford Splitting Method for Nonconvex Problems
by: Tianle Lu, et al.
Published: (2024-02-01) -
Adaptive Douglas–Rachford Algorithms for Biconvex Optimization Problem in the Finite Dimensional Real Hilbert Spaces
by: Ming-Shr Lin, et al.
Published: (2024-11-01) -
A Forward-Backward Projection Algorithm for Approximating of the Zero of the Sum of Two Operators
by: Vahid Dadashi
Published: (2020-08-01) -
On relaxed and contraction-proximal point algorithms in hilbert spaces
by: Wang Shuyu, et al.
Published: (2011-01-01) -
Flexible and Comprehensive Framework of Element Selection Based on Nonconvex Sparse Optimization
by: Taiga Kawamura, et al.
Published: (2024-01-01)