Figure 1From: Acceleration of the Halpern algorithm to search for a fixed point of a nonexpansive mapping Behavior of ∥T( x n )− x n ∥ for the Halpern algorithm and Algorithm 3.1 (proposed). (The Halpern algorithm took 850 iterations to satisfy ∥T( x n )− x n ∥< 10 − 6 , whereas Algorithm 3.1 took only six.)Back to article page