Iterative Methods for Computing the Resolvent of Composed Operators in Hilbert Spaces
AbstractThe 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 into account additional constraints on the linear operator. Second, we propose a fixed point approach for computing this resolvent operator in a general case. Based on the Krasnoselskii–Mann algorithm for finding fixed points of non-expansive operators, we prove the strong convergence of the sequence generated by the proposed algorithm. As a consequence, we obtain an effective iterative algorithm for solving the scaled proximity operator of a convex function composed by a linear operator, which has wide applications in image restoration and image reconstruction problems. Furthermore, we propose and study iterative algorithms for studying the resolvent operator of a finite sum of maximally monotone operators as well as the proximal operator of a finite sum of proper, lower semi-continuous convex functions. View Full-Text
Share & Cite This Article
Yang, Y.; Tang, Y.; Zhu, C. Iterative Methods for Computing the Resolvent of Composed Operators in Hilbert Spaces. Mathematics 2019, 7, 131.
Yang Y, Tang Y, Zhu C. Iterative Methods for Computing the Resolvent of Composed Operators in Hilbert Spaces. Mathematics. 2019; 7(2):131.Chicago/Turabian Style
Yang, Yixuan; Tang, Yuchao; Zhu, Chuanxi. 2019. "Iterative Methods for Computing the Resolvent of Composed Operators in Hilbert Spaces." Mathematics 7, no. 2: 131.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.