Backward-forward algorithms for structured monotone inclusions in hilbert spaces

dc.date.accessioned2018-11-29T15:36:43Z
dc.date.accessioned2022-10-18T21:27:09Z
dc.date.available2018-11-29T15:36:43Z
dc.date.available2022-10-18T21:27:09Z
dc.date.created2018-11-29T15:36:43Z
dc.date.issued2018
dc.identifierhttp://hdl.handle.net/10533/228463
dc.identifier1140829
dc.identifierWOS:000412618800005
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/4459819
dc.description.abstractIn 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 computati
dc.languageeng
dc.relationhttps://www.sciencedirect.com/science/article/pii/S0022247X16302554
dc.relationhandle/10533/111556
dc.relation10.1016/j.jmaa.2016.06.025
dc.relationhandle/10533/111541
dc.relationhandle/10533/108045
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsAtribución-NoComercial-SinDerivadas 3.0 Chile
dc.rightshttp://creativecommons.org/licenses/by-nc-nd/3.0/cl/
dc.titleBackward-forward algorithms for structured monotone inclusions in hilbert spaces
dc.typeArticulo


Este ítem pertenece a la siguiente institución