Volume 2012, Issue 1 235120
Review Article
Open Access

Three-Step Fixed Point Iteration for Generalized Multivalued Mapping in Banach Spaces

Zhanfei Zuo

Corresponding Author

Zhanfei Zuo

Department of Mathematics and Computer Science, Chongqing Three Gorges University, Wanzhou 404000, China sanxiau.edu.cn

Search for more papers by this author
First published: 20 February 2012
Citations: 2
Academic Editor: Nazim I. Mahmudov

Abstract

The convergence of three-step fixed point iterative processes for generalized multivalued nonexpansive mapping was considered in this paper. Under some different conditions, the sequences of three-step fixed point iterates strongly or weakly converge to a fixed point of the generalized multivalued nonexpansive mapping. Our results extend and improve some recent results.

1. Introduction

Let X be a Banach space and K a nonempty subset of X. The set K is called proximinal if for each xX, there exists an element yK such that ∥xy∥ = d(x, K), where d(x, K) = inf {∥xz∥ : zK}. Let CB(K), C(K), P(K), F(T) denote the family of nonempty closed bounded subsets, nonempty compact subsets, nonempty proximinal bounded subsets of K, and the set of fixed points, respectively. A multivalued mapping T : KCB(K) is said to be nonexpansive (quasi-nonexpansive) if
(1.1)
where H(·, ·) denotes the Hausdorff metric on CB(X) defined by
(1.2)
A point x is called a fixed point of T if xTx. Since Banach′s Contraction Mapping Principle was extended nicely to multivalued mappings by Nadler in 1969 (see [1]), many authors have studied the fixed point theory for multivalued mappings (e.g., see [2]). For single-valued nonexpansive mappings, Mann [3] and Ishikawa [4], respectively, introduced a new iteration procedure for approximating its fixed point in a Banach space as follows:
(1.3)
where {αn} and {bn} are sequences in [0,1]. Obviously, Mann iteration is a special case of Ishikawa iteration. Recently Song and Wang in [5, 6] introduce the following algorithms for multivalued nonexpansive mapping:
(1.4)
where snTxn, γn ∈ (0, +) such that lim nγn = 0 and ∥sn+1sn∥ ≤ H(Txn+1, Txn) + γn,
(1.5)
where ∥snrn∥ ≤ H(Txn, Tyn) + γn and ∥sn+1rn∥ ≤ H(Txn+1, Tyn) + γn for snTxn and rnTyn. They show some strong convergence results of the above iterates for multivalued nonexpansive mapping T under some appropriate conditions. However, the iteration scheme constructed by Song and Wang involves the following estimates,
(1.6)
which are not easy to be computed and the scheme is more time consuming. It is observed that Song and Wang [6] did not use the above estimates in their proofs and the assumption on T, namely, T(p) = {p} for any pF(T) is quite strong. It is noted that the domain of T is compact, which is a strong condition. The aim of this paper is to construct an three iteration scheme for a generalized multivalued mappings, which removes the restriction of T, namely, T(p) = {p} for any pF(T) and also relax compactness of the domain of T. The generalized multivalued mappings was introduced in [7], if
(1.7)
where d is induced by the norm. Obviously, the condition is weaker than nonexpansiveness and stronger than quasinonexpansiveness, furthermore, there are some examples of a generalized nonexpansive multivalued mapping which is not a nonexpansive multivalued mapping (see [7, 8]).
Let T : KP(K) be a generalized nonexpansive multivalued mapping and PT(x) = {yT(x) : ∥xy∥ = d(x, T(x))}. The three-step mean multivalued iterative scheme is defined by x0K,
(1.8)
where {an}, {bn}, {cn}, {bn + cn}, {αn}, {βn}, {γn}, and {αn + βn + γn} are appropriate sequence in [0,1], furthermore snPT(xn), tnPT(zn), rnPT(yn). If an = cn = βn = γn ≡ 0 or an = bn = cn = βn = γn ≡ 0, then iterative scheme (1.8) reduces to the Ishikawa and Mann multivalued iterative scheme. In fact let γn ≡ 0 or cn = βn = γn ≡ 0 or bn = cn = αn = γn ≡ 0, we also have the other three algorithms.

The mapping T : KCB(K) is called hemicompact if, for any sequence xn in K such that d(xn, T(xn)) → 0 as n, there exists a subsequence of xn such that . We note that if K is compact, then every multivalued mapping T : KCB(K) is hemicompact. The following definition was introduced in [9].

Definition 1.1. A multivalued mapping T : KCB(K) is said to satisfy Condition (A) if there is a nondecreasing function f : [0, )→[0, ) with f(0) = 0, f(x) > 0 for x ∈ (0, ) such that

(1.9)
where F(T) ≠   is the fixed point set of the multivalued mapping T. From now on, F(T) stands for the fixed point set of the multivalued mapping  T.

2. Preliminaries

A Banach space X is said to be satisfy Opial′s condition [10] if, for any sequence {xn} in X, xnx(n) implies the following inequality:
(2.1)
for all yX with yx. It is known that Hilbert spaces and lp(1 < p < ) have the Opial′s condition.

Lemma 2.1 (see [7], [11].)Let {xn}, {yn}, and {zn} be sequence in uniformly convex Banach space X. Suppose that {αn}, {βn}, and {γn} are sequence in [0,1] with αn + βn + γn = 1,   limsup nxn∥ ≤ d,   limsup nyn∥≤d,   limsup nzn∥≤d, and lim nαnxn + βnyn + γnzn∥ = d. If liminf nαn > 0 and  liminf nβn > 0, then lim nxnyn∥ = 0.

Lemma 2.2 (see [7], [11].)Let X be a uniformly convex Banach space and Br : = {xX : ∥x∥≤r}, r > 0. Then there exists a continuous strictly increasing convex function g : [0, )→[0, ) with g(0) = 0 such that

(2.2)
for all x, y, z, ωBr and λ, μ, ξ, ϑ ∈ [0,1] with λ + μ + ξ + ϑ = 1.

3. Main Results

Lemma 3.1. Let X be a real Banach space and K be a nonempty convex subset of X, T : KP(K) be a generalized multivalued nonexpansive mapping with F(T) ≠ such that PT is nonexpansive. Let {xn} be a sequence in K defined by (1.8), then one has the following conclusion:

(3.1)

Proof. Let pF(T), then pPT(p) = {p}. Since T is quasi-nonexpansive, thus we obtain

(3.2)
similarly ∥ynp∥≤∥xnp∥, then we have
(3.3)
Then {∥xnp∥} is a decreasing sequence and hence lim nxnp∥ exists for any pF(T).

Lemma 3.2. Let X be a uniformly convex Banach space and K be a nonempty convex subset of X, T : KP(K) be a generalized multivalued nonexpansive mapping with F(T) ≠ such that PT is nonexpansive. Let {xn} be a sequence in K defined by (1.8), if the coefficient satisfy one of the following control conditions:

  • (i)

    liminf nαn > 0 and one of the following holds:

    • (a)

      limsup n(αn + βn + γn) < 1 and limsup n(bn + cn) < 1,

    • (b)

      0 < liminf nβn ≤ limsup n(αn + βn + γn) < 1 and limsup ncn < 1,

    • (c)

      0 < liminf nbn ≤ limsup n(bn + cn) < 1 and limsup nan < 1,

    • (d)

      0 < liminf ncn ≤ limsup n(bn + cn) < 1;

  • (ii)

    0 < liminf nβn ≤ limsup n(αn + βn + γn) < 1 and limsup nan < 1;

  • (iii)

    0 < liminf nγn ≤ limsup n(αn + βn + γn) < 1;

  • (iv)

    0 < liminf n(αnbn + βn) and 0 < liminf nan ≤ limsup nan < 1;  

then we have lim nd(xn, Txn) = 0.

Proof. By Lemma 3.1, we know that lim nxnp∥ exists for any pF(T), then it follows that {snp}, {tnp}, and {rnp} are all bounded. We may assume that these sequences belong to Br where r > 0. Note that pPT(p) = {p} for any fixed point pF(T) and T is quasi-nonexpansive. By Lemma 2.2, we get

(3.4)
and therefore we have
(3.5)
Then
(3.6)
(3.7)
(3.8)
(3.9)
Since lim nxnp∥ exists for any pF(T), it follows from (3.6) that lim n(1 − αnβnγn)αng(∥xnrn∥) = 0. From g is continuous strictly increasing with g(0) = 0 and 0 < liminf nαn ≤ limsup n(αn + βn + γn) < 1, then
(3.10)
Using a similarly method together with inequalities (3.7) and 0 < liminf nβn ≤ limsup n(αn + βn + γn) < 1, then
(3.11)
Similarly, from (3.8) and 0 < liminf nγn ≤ limsup n(αn + βn + γn) < 1, we have lim nxnsn∥ = 0, since snTxn, then 0 ≤ lim nd(xn, Txn) ≤ lim nxnsn∥ = 0, thus we get (iii). In the sequence we prove (i) (a). From iterative scheme (1.8), we have
(3.12)
To show that lim nxnsn∥ = 0, it suffices to show that there exist a subsequence {nj} of {n} such that  . If  , it follows from (3.9) that
(3.13)
Since lim nxnp∥ exists for any pF(T), we have
(3.14)
From g is continuous strictly increasing with and , we have
(3.15)
This together with (3.10), (3.12), (3.15) gives
(3.16)
Since , we have . On the other hand, if , then we may extract a subsequence of so that . This together with (i) (a) and (3.10), (3.12) gives
(3.17)
By Double Extract Subsequence Principle, we obtain the result.

If 0 < liminf nβn ≤ limsup n(αn + βn + γn) < 1 and limsup nan < 1, we will prove (ii),

(3.18)
Since limsup nan < 1, then
(3.19)
This together with (3.11), (3.18), we obtain the result.

We will prove (i) (b), let pF(T). By Lemma 3.1, we let lim nxnp∥ = d for some d ≥ 0. From iterative scheme (1.8), we know

(3.20)
From Lemma 3.1, we have known that ∥znp∥≤∥xnp∥ and ∥ynp∥≤∥xnp∥, then
(3.21)
From (3.20) and Lemma 2.1, we have
(3.22)
Notice that
(3.23)
Since limsup ncn < 1, we have lim nsnxn∥ = 0, therefore 0 ≤ lim nd(xn, Txn) ≤ lim nxnsn∥ = 0.

We will prove (i) (c). From iterative scheme (1.8) and Lemma 3.1, we have

(3.24)
which implies
(3.25)
Notice that liminf nαn > 0 and lim nxnp∥ exists. Hence from (3.25) we have
(3.26)
Therefore, from iterative scheme (1.8) we have
(3.27)
From Lemma 2.1, we have
(3.28)
Notice that
(3.29)
Since limsup nan < 1, then 0 ≤ lim nd(xn, Txn) ≤ lim nxnsn∥ = 0.

By (3.27) and Lemma 2.1, we can similarly prove (i) (d).

Finally, we will prove (iv). From iterative scheme (1.8) and Lemma 3.1, we have

(3.30)
which implies
(3.31)
Notice that
(3.32)
Hence we have
(3.33)
Thus, we have
(3.34)
By Lemma 2.1  and 0 < liminf nan ≤ limsup nan < 1, we have  0 ≤ lim nd(xn, Txn) ≤ lim nxnsn∥ = 0.

Theorem 3.3. Let X be a uniformly convex Banach space and K be a nonempty convex subset of X, T : KP(K) be a generalized multivalued nonexpansive mapping with F(T) ≠ such that PT is nonexpansive. Let {xn} be a sequence in K defined by (1.8), the coefficient satisfy the control conditions in Lemma 3.2 and T satisfies Condition (A) with respect to the sequence {xn}, then {xn} converges strongly to a fixed point of T.

Proof. By Lemma 3.2, we have lim nd(xn, Txn) = 0. Since T satisfies Condition (A) with respect to {xn}. Then

(3.35)
Thus, we get lim nd(xn, F(T)) = 0. The remainder of the proof is the same as in [6, Theorem 2.4], we omit it.

Theorem 3.4. Let X be a uniformly convex Banach space and K be a nonempty convex subset of X, T : KP(K) be a generalized multivalued nonexpansive mapping with F(T) ≠ such that PT is nonexpansive. Let {xn} be a sequence in K defined by (1.8), the coefficient satisfy the control conditions in Lemma 3.2 and T is hemicompact, then {xn} converges strongly to a fixed point of T.

Proof. By Lemma 3.2, we have lim nd(xn, Txn) = 0. Since T is hemicompact, then there exist a subsequence of {xn} such that for some qK. Thus,

(3.36)
Hence, q is a fixed point of T. Now on take on q in place of p, we get that lim nxnq∥ exists. It follows that xnq as n. This completes the proof.

Theorem 3.5. Let X, T and {xn} be the same as in Lemma 3.2. If K be a nonempty weakly compact convex subset of a Banach space X and X satisfies Opial′s condition, then {xn} converges weakly to a fixed point of T.

Proof. The proof of the Theorem is the same as in [6, Theorem 2.5], we omit it.

Remark 3.6. From the definition of iterative scheme (1.8), Theorems 3.3, 3.4, and 3.5 extend some results in [6, 12], and also give some new results are different from the [5]. In fact, we can present an example of a multivalued map T for which PT is nonexpansive. A multivalued map T : DCB(X) is *-nonexpansive [13] if for all x, yD and uxT(x) with d(x, ux) = inf {d(x, z) : zT(x)}, there exists uyT(y) with d(y, uy) = inf {d(y, w) : ωT(y)} such that

(3.37)
It is clear that if T is *-nonexpansive, then PT is nonexpansive. It is known that *-nonexpansiveness is different from nonexpansiveness for multivalued maps. Let D = [0, ) and T be defined by Tx = [x, 2x] for xD [14]. Then PT(x) = x for xD and thus it is nonexpansive. Note that T is *-nonexpansive but not nonexpansive (see [14]).

    The full text of this article hosted at iucr.org is unavailable due to technical difficulties.