
We propose a new algorithm for finding a zero of the sum of two monotone operators. It works by only requiring the evaluation of the resolvents of each of the operators individually, rather than the resolvent of their sum. We leverage then the connection with a co-coerciveness related operator, obtained by the sum and composition of Yosida regularization and reflected resolvents of the involved operators, to derive both a weak and a strong convergence results. The latter are provided by means of Krasnoselskii and Halpern celebrated classical Theorems.
Forward-backward splitting algorithm, Halpern’s iteration, Monotone operator, Sum, Halpern's iteration, Krasnoselskii algorithm, [MATH] Mathematics [math], Resolvent, Reflected resolvent, Composition
Forward-backward splitting algorithm, Halpern’s iteration, Monotone operator, Sum, Halpern's iteration, Krasnoselskii algorithm, [MATH] Mathematics [math], Resolvent, Reflected resolvent, Composition
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
