Backward–forward algorithms for structured monotone inclusions in Hilbert spaces

In this paper, we study the backward–forward algorithm as a splitting method to solve structured monotone inclusions, and convex minimization problems in Hilbert spaces. It has a natural link with the forward–backward algorithm and has the same computational complexity, since it involves the same ba...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of mathematical analysis and applications Ročník 457; číslo 2; s. 1095 - 1117
Hlavní autori:	Attouch, Hédy, Peypouquet, Juan, Redont, Patrick
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 15.01.2018
Predmet:	Forward–backward algorithm Monotone inclusion Proximal-gradient method Monotone inclusion Proximal-gradient method Forward–backward algorithm
ISSN:	0022-247X, 1096-0813
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!