A splitting algorithm for dual monotone inclusions involving cocoercive operators
Optimization and Control
2011-10-11 v1
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.
Cite
@article{arxiv.1110.1697,
title = {A splitting algorithm for dual monotone inclusions involving cocoercive operators},
author = {Bang Cong Vu},
journal= {arXiv preprint arXiv:1110.1697},
year = {2011}
}