Convergence analysis of an inexact three-operator splitting algorithm

From MaRDI portal





Summary: The three-operator splitting algorithm is a new splitting algorithm for finding monotone inclusion problems of the sum of three maximally monotone operators, where one is cocoercive. As the resolvent operator is not available in a closed form in the original three-operator splitting algorithm, in this paper, we introduce an inexact three-operator splitting algorithm to solve this type of monotone inclusion problem. The theoretical convergence properties of the proposed iterative algorithm are studied in general Hilbert spaces under mild conditions on the iterative parameters. As a corollary, we obtain general convergence results of the inexact forward-backward splitting algorithm and the inexact Douglas-Rachford splitting algorithm, which extend the existing results in the literature.



Cites work


Cited in
(40)


Describes a project that uses

Uses Software






This page was built for publication: Convergence analysis of an inexact three-operator splitting algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2333865)