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

Full description

Saved in:
Bibliographic Details
Published in:Journal of mathematical analysis and applications Vol. 457; no. 2; pp. 1095 - 1117
Main Authors: Attouch, Hédy, Peypouquet, Juan, Redont, Patrick
Format: Journal Article
Language:English
Published: Elsevier Inc 15.01.2018
Subjects:
ISSN:0022-247X, 1096-0813
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first