A splitting algorithm for dual monotone inclusions involving cocoercive operators

Tiêu đềA splitting algorithm for dual monotone inclusions involving cocoercive operators
Loại công bốJournal Article
Năm xuất bản2011
Tác giảVũ, BCông
Tạp chíAdvances in Computational Mathematics
Thể tích38
Trang667–681
ISSN1572-9044
Tóm tắt

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 properties of the cocoercive operators appearing in the model. Several splitting algorithms recently proposed in the literature are recovered as special cases.

URLhttp://dx.doi.org/10.1007/s10444-011-9254-8
DOI10.1007/s10444-011-9254-8