A splitting algorithm for dual monotone inclusions involving cocoercive operators

Abstract

We consider the problem of solving dual monotone inclusions involving sums of composite parallel-sum type operators. A feature of this work is to exploit explicitly the cocoercivity of some of the operators appearing in the model. Several splitting algorithms recently proposed in the literature are recovered as special cases.

References in corpus (1)

• Generalized Forward-Backward Splitting

Cited by in corpus (3)

• A first-order primal-dual algorithm with linesearch
• On the convergence rate improvement of a primal-dual splitting algorithm for solving monotone inclusion problems
• Convergence Rates with Inexact Non-expansive Operators