Abstract

Modified Mann-Halpern algorithms for finding the fixed points of pseudocontractive mappings are presented. Strong convergence theorems are obtained.

1. Introduction

Finding the fixed points of nonlinear operators is an important topic in fixed point theory, due to the fact that many nonlinear problems can be reformulated as fixed point equations of nonlinear mappings. The research of this area dates back to Picard’s and Banach’s time. Now it is well known that the Picard iterates converge to the unique fixed point of whenever is a contraction of a complete metric space. However, if is not a contraction (e.g., nonexpansive), then the Picard algorithm does not converge. Consequently, Mann’s algorithm was constructed by Mann [1] in 1953: There are a large number of papers on Mann’s algorithm in the literature. See [25]. Now we know that if is nonexpansive, then Mann’s algorithm converges weakly to a fixed point of . This algorithm however does not converge in the strong topology.

In order to get the strong convergence, the following Halpern’s algorithm was introduced: The interest and importance of Halpern iterative method lie in the fact that strong convergence of the sequence is achieved under certain mild conditions on parameter in a general Banach space. Please refer to [612].

In the present paper, we are devoted to find the fixed points of pseudocontractive mappings. For some related works, please see [1323]. The interest of pseudocontractions lies in their connection with monotone operators. Browder and Petryshyn [24] studied weak convergence of Mann’s algorithm for the class of strict pseudocontractions. But Mann’s algorithm fails to converge for Lipschitzian pseudocontractions [25].

Inspired by the results in the literature, the main purpose of this paper is to construct an iterative method for finding the fixed points of pseudocontractive mappings. Under some mild conditions, strong convergence results are given.

2. Preliminaries

Let be a real Hilbert space with inner product and norm , respectively. Let be a nonempty closed convex subset of . A mapping is called pseudocontractive if A mapping is called -Lipschitzian if there exists such that for all . In this case, if , then is a -contraction.

It is well known that in a real Hilbert space the following inequality holds: for all .

In the present paper, we will use the following notations: (i)we use to denote the set of fixed points of ;(ii) denotes the weak convergence of to ;(iii) denotes the strong convergence of to .

Lemma 1 (see [26]). Let be a closed convex subset of a real Hilbert space . Let be a continuous pseudocontractive mapping. Then is demiclosed at zero.

Lemma 2 (see [27]). Let be a sequence of real numbers. Assume does not decrease at infinity; that is, there exists at least a subsequence of such that for all . For every , define an integer sequence as Then as and for all

Lemma 3 (see [28]). Assume that is a sequence of nonnegative real numbers such that where is a sequence in and is a sequence such that(1); (2) or .
Then .

3. Main Results

Now we present the statement of our algorithm.

The Modified Mann-Halpern Algorithm. Let be a nonempty closed convex subset of a real Hilbert space . Let be a pseudocontractive mapping and a -contractive mapping. Let , , and be three real number sequences in . We have the following steps.(1) Initialization:

(2) Mann step: for a given , define a sequence by for all .(3) Halpern step: for a given and , define for all .

In the following, we assume that(i) the mapping is -Lipschitzian;(ii) the sequences , , and satisfy the following conditions :;;;;.

Now, we prove our main result as follows.

Theorem 4. Suppose . Then the sequence defined by (11) converges strongly to a fixed point of .

Proof. Since is a -condition, then is a contractive mapping (where is the metric projection). Hence, there exists a unique such that . In the sequel, we will show that the sequence defined by (11) converges strongly to .
From (11), we getIt is well known that there holds the following inequality in Hilbert spaces: for all and . Hence, we have We know that is pseudocontractive if and only if satisfies the condition for all . Since , we have from (15) that for all .
By using (13) and (16), we obtain Note that is -Lipschitzian and From (17), we have By condition , without loss of generality, we may assume that for all . Then, we have for all . Substituting (19) to (14) and noting condition , we have Therefore, It follows from (12) and (21) that This implies that the sequence is bounded.
From (5) and (11), we have Note that (19) is equivalent to Therefore, It follows that Since and are bounded, there exists such that . So Next, we prove two cases.
Assume there exists an integer such that is decreasing for all .
In this case, we know that exists. From (27), we deduce By conditions and , we have . Thus, from (28), we get Since is bounded, there exists a subsequence of satisfying Thus, we use the demiclosed principle of (Lemma 1) to deduce So Returning to (25) and using (5) we obtain It follows that In Lemma 3, we take , , and . We can check easily that and . Thus, we deduce that .
Assume there exists an integer such that . In this case, we set . Then, we have . Define an integer sequence for all as follows: It is clear that is a nondecreasing sequence satisfying for all . From (28), we get This implies that . Thus, we obtain Since , we have from (34) that It follows that Combining (38) and (40), we have and hence From (34), we obtain It follows that This together with (42) implies that Applying Lemma 2 we get Therefore, . That is, . The proof is completed.

4. Conclusions

It is now well known that Mann’s algorithm fails to converge for Lipschitzian pseudocontractions. Strong convergence of Ishikawa’s algorithm has not been achieved without compactness assumption. In the present paper, modified Mann-Halpern algorithms for finding the fixed points of pseudocontractive mappings are presented. Strong convergence theorems are obtained.