Operator-splitting schemes are iterative algorithms for solving many types of numerical
problems. A lot is known about these methods: they converge, and in many cases we know …

In this work, we give a tight estimate of the rate of convergence for the Halpern-iteration for
approximating a fixed point of a nonexpansive map** in a Hilbert space. Specifically …

First-order methods such as proximal gradient, which use Forward–Backward Splitting
techniques have proved to be very effective in solving nonsmooth convex minimization …

In this paper, we present a convergence rate analysis for the inexact Krasnosel'skiĭ–Mann
iteration built from non-expansive operators. The presented results include two main parts …

Recently, the anchor acceleration, an acceleration mechanism distinct from Nesterov's, has
been discovered for minimax optimization and fixed-point problems, but its mechanism is not …