A splitting algorithm for dual monotone inclusions involving cocoercive operators
classification
🧮 math.OC
keywords
operatorsdualinclusionsinvolvingmonotonesplittingalgorithmalgorithms
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.