A forward-backward splitting method for monotone inclusions without cocoercivity

From MaRDI portal



Abstract: In this work, we propose a simple modification of the forward-backward splitting method for finding a zero in the sum of two monotone operators. Our method converges under the same assumptions as Tseng's forward-backward-forward method, namely, it does not require cocoercivity of the single-valued operator. Moreover, each iteration only requires one forward evaluation rather than two as is the case for Tseng's method. Variants of the method incorporating a linesearch, relaxation and inertia, or a structured three operator inclusion are also discussed.



Cites work


Cited in
(only showing first 100 items - show all)








This page was built for publication: A forward-backward splitting method for monotone inclusions without cocoercivity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5114393)