A splitting algorithm for dual monotone inclusions involving cocoercive operators

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...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Advances in computational mathematics Ročník 38; číslo 3; s. 667 - 681
Hlavný autor: Vu, Bang Cong
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Boston Springer US 01.04.2013
Predmet:
Algorithms
Computation
Computational Mathematics and Numerical Analysis
Computational Science and Engineering
Inclusions
Mathematical and Computational Biology
Mathematical Modeling and Industrial Mathematics
Mathematical models
Mathematics
Mathematics and Statistics
Operators
Splitting
Sums
Visualization
Monotone inclusion
Primal-dual algorithm
Cocoercivity
90C25
Composite operator
Operator splitting
49M29
Duality
Monotone operator
49M27
47H05
Forward-backward algorithm
ISSN:1019-7168, 1572-9044
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1019-7168
1572-9044
DOI:10.1007/s10444-011-9254-8