Skip to main content

A new multi-step iteration for solving a fixed point problem of nonexpansive mappings

Abstract

We introduce a new nonlinear mapping generated by a finite family of nonexpansive mappings. Weak and strong convergence theorems are also established in the setting of a Banach space.

MSC:47H09, 47H10.

1 Introduction

Let C be a nonempty, closed and convex subset of a real Banach space E. Let T:C→C be a nonlinear mapping. The fixed point set of T is denoted by F(T), that is, F(T)={x∈C:x=Tx}. Recall that a mapping T is said to be nonexpansive if ∥Tx−Ty∥≤∥x−y∥ for all x,y∈C, and a mapping f:C→C is called a contraction if there exists a constant α∈(0,1) such that ∥f(x)−f(y)∥≤α∥x−y∥ for all x,y∈C. We use Σ C to denote a class of contractions with constant α.

Fixed point problems are now arising in a wide range of applications such as optimization, physics, engineering, economics and applied sciences. Many related problems can be cast as the problem of finding fixed points for nonlinear mappings. The interdisciplinary nature of fixed point problems is evident through a vast literature which includes a large body of mathematical and algorithmic developments.

In the literature, several types of iterations have been constructed and proposed in order to get convergence results for nonexpansive mappings in various settings. One classical iteration process is defined as follows: x 1 ∈C and

x n + 1 =(1− α n ) x n + α n T x n ,∀n≥1,

where { α n }⊂(0,1). This method was introduced in 1953 by Mann [1] and is known as the Mann iteration process. However, we note that it has only weak convergence in general; for instance, see [2].

In 1974, Ishikawa [3] proposed the following two-step iteration: x 1 ∈C and

y n = ( 1 − β n ) x n + β n T x n , x n + 1 = ( 1 − α n ) x n + α n T y n , ∀ n ≥ 1 ,

where { α n } and { β n } are sequences in (0,1). This method is often called the Ishikawa iteration process.

Very recently, Agarwal et al. [4] introduced a new iteration process as follows: x 1 ∈C and

y n = ( 1 − β n ) x n + β n T x n , x n + 1 = ( 1 − α n ) T x n + α n T y n , ∀ n ≥ 1 ,

where { α n } and { β n } are sequences in (0,1). This method is called the S-iteration process. The weak convergence was studied in [5] for nonexpansive mappings. It was also shown in [5] that the convergence rate of the S-iteration process is faster than the Picard and Mann iteration processes for contractive mappings.

Firstly, motivated by Agarwal et al. [4], we have the aim to introduce and study a new mapping defined by the following definition.

Definition 1.1 Let C be a nonempty and convex subset of a real Banach space E. Let T 1 , T 2 ,…, T N be a finite family of nonexpansive mappings of C into itself, and let λ 1 , λ 2 ,…, λ N be real numbers such that 0≤ λ i ≤1 for all i=1,2,…,N. Define the mapping B:C→C as follows:

U 1 = λ 1 T 1 + ( 1 − λ 1 ) I , U 2 = λ 2 T 2 U 1 + ( 1 − λ 2 ) T 1 , U 3 = λ 3 T 3 U 2 + ( 1 − λ 3 ) T 2 , ⋮ U N − 1 = λ N − 1 T N − 1 U N − 2 + ( 1 − λ N − 1 ) T N − 2 , B = U N = λ N T N U N − 1 + ( 1 − λ N ) T N − 1 .
(1.1)

Such a mapping B is called the B-mapping generated by T 1 , T 2 ,…, T N and λ 1 , λ 2 ,…, λ N . See [6–9] for the corresponding concept.

Secondly, using the definition above, we study weak convergence of the following Mann-type iteration process in a uniformly convex Banach space with a Fréchet differentiable norm or that satisfies Opial’s condition: x 1 ∈C and

x n + 1 =(1− α n ) x n + α n B n x n ,∀n≥1,
(1.2)

where B n is a B-mapping generated by T 1 , T 2 ,…, T N and λ n , 1 , λ n , 2 ,…, λ n , N (see Section 3).

Finally, we discuss strong convergence of the iteration scheme involving the modified viscosity approximation method [10] defined as follows: x 1 ∈C and

x n + 1 = α n f( x n )+ β n x n + γ n B n x n ,∀n≥1,
(1.3)

where { α n }, { β n } and { γ n } are sequences in (0,1), and f∈ Σ C .

More references on earlier works promoting the theory of fixed points and common fixed points for nonexpansive mappings can be found in [11–21].

Throughout this paper, we use the notation:

  • ⇀ for weak convergence and → for strong convergence.

  • ω ω ( x n )={x: x n i ⇀x} denotes the weak ω-limit set of { x n }.

2 Preliminaries and lemmas

In this section, we begin by recalling some basic facts and lemmas which will be used in the sequel.

Let E be a real Banach space and let U={x∈E:∥x∥=1} be the unit sphere of E. A Banach space E is said to be strictly convex if for any x,y∈U,

x≠yimplies ∥ x + y 2 ∥ <1.

It is also said to be uniformly convex if for each ε∈(0,2], there exists δ>0 such that for any x,y∈U,

∥x−y∥≥εimplies ∥ x + y 2 ∥ <1−δ.

It is known that a uniformly convex Banach space is reflexive and strictly convex. Define a function δ:[0,2]→[0,1] called the modulus of convexity of E as follows:

δ(ε)=inf { 1 − ∥ x + y 2 ∥ : x , y ∈ E , ∥ x ∥ = ∥ y ∥ = 1 , ∥ x − y ∥ ≥ ε } .

Then E is uniformly convex if and only if δ(ε)>0 for all ε∈(0,2]. A Banach space E is said to be smooth if the limit

lim t → 0 ∥ x + t y ∥ − ∥ x ∥ t
(2.1)

exists for all x,y∈U. The norm is said to be uniformly Gâteaux differentiable if for y∈U, the limit is attained uniformly for x∈U. It is said to be Fréchet differentiable if for x∈U, the limit is attained uniformly for y∈U. It is said to be uniformly smooth or uniformly Fréchet differentiable if the limit (2.1) is attained uniformly for x,y∈U. The normalized duality mapping J:E→ 2 E ∗ is defined by

J(x)= { x ∗ ∈ E ∗ : 〈 x , x ∗ 〉 = ∥ x ∥ 2 = ∥ x ∗ ∥ 2 }

for all x∈E. It is known that E is smooth if and only if the duality mapping J is single valued, and that if E has a uniformly Gâteaux differentiable norm, J is uniformly norm-to-weak∗ continuous on each bounded subset of E. A Banach space E is said to satisfy Opial’s condition [22]. If x∈E and x n ⇀x, then

lim sup n → ∞ ∥ x n −x∥< lim sup n → ∞ ∥ x n −y∥,∀y∈E,x≠y.

Let T:C→C. Then I−T is demiclosed at 0 if for all sequence { x n } in C, x n ⇀q and ∥ x n −T x n ∥→0 imply q=Tq. It is known that if E is uniformly convex, C is nonempty closed and convex, and T is nonexpansive, then I−T is demiclosed at 0 [23]. For more details, we refer the reader to [5, 24].

Lemma 2.1 [5]

Let E be a smooth Banach space. Then the following hold:

  1. (i)

    ∥ x + y ∥ 2 ≥ ∥ x ∥ 2 +2〈y,J(x)〉 for all x,y∈E;

  2. (ii)

    ∥ x + y ∥ 2 ≤ ∥ x ∥ 2 +2〈y,J(x+y)〉 for all x,y∈E.

Lemma 2.2 [24]

In a strictly convex Banach space E, if

∥x∥=∥y∥= ∥ λ x + ( 1 − λ ) y ∥

for all x,y∈E and λ∈(0,1), then x=y.

Lemma 2.3 [25]

Let { x n } and { z n } be two sequences in a Banach space E such that

x n + 1 = β n x n +(1− β n ) z n ,n≥1,

where { β n } satisfies the conditions 0< lim inf n → ∞ β n ≤ lim sup n → ∞ β n <1.

If lim sup n → ∞ (∥ z n + 1 − z n ∥−∥ x n + 1 − x n ∥)≤0, then ∥ z n − x n ∥→0 as n→∞.

Lemma 2.4 [26]

Let E be a uniformly convex Banach space with a Fréchet differentiable norm. Let C be a closed and convex subset of E, and let { S n } n = 1 ∞ be a family of L n -Lipschitzian self-mappings on C such that ∑ n = 1 ∞ ( L n −1)<∞ and F= ⋂ n = 1 ∞ F( S n )≠∅. For arbitrary x 1 ∈C, define x n + 1 = S n x n for all n≥1. Then, for every p,q∈F, lim n → ∞ 〈 x n ,J(p−q)〉 exists, in particular, for all u,v∈ ω ω ( x n ) and p,q∈F, 〈u−v,J(p−q)〉=0.

Lemma 2.5 [15]

Let E be a reflexive and strictly convex Banach space with a uniformly Gâteaux differentiable norm, let C be a nonempty closed convex subset of E, let A:C→C be a continuous strongly pseudocontractive mapping with constant k∈[0,1), and let T:C→E be a continuous pseudocontractive mapping satisfying the weakly inward condition. If T has a fixed point in C, then the path { x t } defined by

x t =tA x t +(1−t)T x t

converges strongly to a fixed point q of T as t→0, which is a unique solution of the variational inequality

〈 ( I − A ) q , J ( q − p ) 〉 ≤0,∀p∈F(T).

Remark 2.6 Lemma 2.5 holds if T:C→C is a nonexpansive mapping and A=f is a contraction.

The following lemma gives us a nice property of real sequences.

Lemma 2.7 [18]

Assume that { a n } is a sequence of nonnegative real numbers such that

a n + 1 ≤(1− c n ) a n + b n ,∀n≥1,

where { c n } is a sequence in (0,1) and { b n } is a sequence such that

  1. (a)

    ∑ n = 1 ∞ c n =∞;

  2. (b)

    lim sup n → ∞ b n c n ≤0 or ∑ n = 1 ∞ | b n |<∞.

Then lim n → ∞ a n =0.

3 Weak convergence theorem

In this section, we give some properties concerning the B-mapping and then prove a weak convergence theorem for nonexpansive mappings.

Lemma 3.1 Let C be a nonempty, closed and convex subset of a strictly convex Banach space E. Let { T i } i = 1 N be a finite family of nonexpansive mappings of C into itself such that ⋂ i = 1 N F( T i )≠∅, and let λ 1 , λ 2 ,…, λ N be real numbers such that 0< λ i <1 for all i=1,2,…,N−1 and 0< λ N ≤1. Let B be the B-mapping generated by T 1 , T 2 ,…, T N and λ 1 , λ 2 ,…, λ N . Then the following hold:

  1. (i)

    F(B)= â‹‚ i = 1 N F( T i );

  2. (ii)

    B is nonexpansive.

Proof (i) Since ⋂ i = 1 N F( T i )⊂F(B) is trivial, it suffices to show that F(B)⊂ ⋂ i = 1 N F( T i ). To this end, let p∈F(B) and x ∗ ∈ ⋂ i = 1 N F( T i ). Then we have

∥ p − x ∗ ∥ = ∥ B p − x ∗ ∥ = ∥ λ N ( T N U N − 1 p − x ∗ ) + ( 1 − λ N ) ( T N − 1 p − x ∗ ) ∥ ≤ λ N ∥ U N − 1 p − x ∗ ∥ + ( 1 − λ N ) ∥ p − x ∗ ∥ = λ N ∥ λ N − 1 ( T N − 1 U N − 2 p − x ∗ ) + ( 1 − λ N − 1 ) ( T N − 2 p − x ∗ ) ∥ + ( 1 − λ N ) ∥ p − x ∗ ∥ ≤ λ N λ N − 1 ∥ U N − 2 p − x ∗ ∥ + ( 1 − λ N λ N − 1 ) ∥ p − x ∗ ∥ = λ N λ N − 1 ∥ λ N − 2 ( T N − 2 U N − 3 p − x ∗ ) + ( 1 − λ N − 2 ) ( T N − 3 p − x ∗ ) ∥ + ( 1 − λ N λ N − 1 ) ∥ p − x ∗ ∥ ≤ λ N λ N − 1 λ N − 2 ∥ U N − 3 p − x ∗ ∥ + ( 1 − λ N λ N − 1 λ N − 2 ) ∥ p − x ∗ ∥ ⋮ = λ N λ N − 1 ⋯ λ 3 ∥ λ 2 ( T 2 U 1 p − x ∗ ) + ( 1 − λ 2 ) ( T 1 p − x ∗ ) ∥ + ( 1 − λ N λ N − 1 ⋯ λ 3 ) ∥ p − x ∗ ∥ ≤ λ N λ N − 1 ⋯ λ 2 ∥ T 2 U 1 p − x ∗ ∥ + ( 1 − λ N λ N − 1 ⋯ λ 2 ) ∥ p − x ∗ ∥ ≤ λ N λ N − 1 ⋯ λ 2 ∥ U 1 p − x ∗ ∥ + ( 1 − λ N λ N − 1 ⋯ λ 2 ) ∥ p − x ∗ ∥ = λ N λ N − 1 ⋯ λ 2 ∥ λ 1 ( T 1 p − x ∗ ) + ( 1 − λ 1 ) ( p − x ∗ ) ∥ + ( 1 − λ N λ N − 1 ⋯ λ 2 ) ∥ p − x ∗ ∥ ≤ λ N λ N − 1 ⋯ λ 2 λ 1 ∥ T 1 p − x ∗ ∥ + ( 1 − λ N λ N − 1 ⋯ λ 2 λ 1 ) ∥ p − x ∗ ∥ ≤ λ N λ N − 1 ⋯ λ 2 λ 1 ∥ p − x ∗ ∥ + ( 1 − λ N λ N − 1 ⋯ λ 2 λ 1 ) ∥ p − x ∗ ∥ = ∥ p − x ∗ ∥ .
(3.1)

This shows that

∥ p − x ∗ ∥ = λ N λ N − 1 ⋯ λ 2 ∥ λ 1 ( T 1 p − x ∗ ) + ( 1 − λ 1 ) ( p − x ∗ ) ∥ +(1− λ N λ N − 1 ⋯ λ 2 ) ∥ p − x ∗ ∥ ,

which turns out to be

∥ p − x ∗ ∥ = ∥ λ 1 ( T 1 p − x ∗ ) + ( 1 − λ 1 ) ( p − x ∗ ) ∥ .

Again by (3.1), we see that ∥p− x ∗ ∥=∥ T 1 p− x ∗ ∥ and thus

∥ p − x ∗ ∥ = ∥ T 1 p − x ∗ ∥ = ∥ λ 1 ( T 1 p − x ∗ ) + ( 1 − λ 1 ) ( p − x ∗ ) ∥ .

Using Lemma 2.2, we get that T 1 p=p and hence U 1 p=p. Again by (3.1), we have

∥ p − x ∗ ∥ = λ N λ N − 1 ⋯ λ 3 ∥ λ 2 ( T 2 U 1 p − x ∗ ) + ( 1 − λ 2 ) ( T 1 p − x ∗ ) ∥ + ( 1 − λ N λ N − 1 ⋯ λ 3 ) ∥ p − x ∗ ∥ ,

which implies that

∥ p − x ∗ ∥ = ∥ λ 2 ( T 2 U 1 p − x ∗ ) + ( 1 − λ 2 ) ( T 1 p − x ∗ ) ∥ .

From (3.1) we see that ∥ U 1 p− x ∗ ∥=∥ T 2 U 1 p− x ∗ ∥. Since U 1 p=p and T 1 p=p,

∥ p − x ∗ ∥ = ∥ T 2 p − x ∗ ∥ = ∥ λ 2 ( T 2 p − x ∗ ) + ( 1 − λ 2 ) ( p − x ∗ ) ∥ .

Using Lemma 2.2, we get that T 2 p=p and hence U 2 p=p.

By continuing this process, we can show that T i p=p and U i p=p for all i=1,2,…,N−1. Finally, we obtain

∥ p − T N p ∥ ≤ ∥ p − B p ∥ + ∥ B p − T N p ∥ = ∥ p − B p ∥ + ( 1 − λ N ) ∥ p − T N p ∥ ,

which yields that p= T N p since p∈F(B). Hence p= T 1 p= T 2 p=⋯= T N p and thus p∈ ⋂ i = 1 N F( T i ).

(ii) The proof follows directly from (i). □

Lemma 3.2 Let C be a nonempty closed convex subset of a real Banach space E. Let { T i } i = 1 N be a finite family of nonexpansive mappings of C into itself such that ⋂ i = 1 N F( T i )≠∅, and let B be the B-mapping generated by T 1 , T 2 ,…, T N and λ 1 , λ 2 ,…, λ N . Let { λ n , i } i = 1 N be a real sequence in (0,1). For every n∈N, let B n be the B-mapping generated by T 1 , T 2 ,…, T N and λ n , 1 , λ n , 2 ,…, λ n , N as follows:

U n , 1 = λ n , 1 T 1 + ( 1 − λ n , 1 ) I , U n , 2 = λ n , 2 T 2 U 1 + ( 1 − λ n , 2 ) T 1 , U n , 3 = λ n , 3 T 3 U 2 + ( 1 − λ n , 3 ) T 2 , ⋮ U n , N − 1 = λ n , N − 1 T N − 1 U N − 2 + ( 1 − λ n , N − 1 ) T N − 2 , B n = U n , N = λ n , N T N U N − 1 + ( 1 − λ n , N ) T N − 1 .

If λ n , i → λ i ∈(0,1) for all i=1,2,…,N, then lim n → ∞ B n x=Bx for all x∈C.

Proof Let x∈C and U k and U n , k be generated by T 1 , T 2 ,…, T k and λ 1 , λ 2 ,…, λ k , and T 1 , T 2 ,…, T k and λ n , 1 , λ n , 2 ,…, λ n , k , respectively. Then

∥ U n , 1 x− U 1 x∥= ∥ ( λ n , 1 − λ 1 ) ( T 1 x − x ) ∥ ≤| λ n , 1 − λ 1 |∥ T 1 x−x∥.

Let k∈{2,3,…,N} and M=max{∥ T k U k − 1 x∥+∥ T k − 1 x∥:k=2,3,…,N}. Then

∥ U n , k x − U k x ∥ = ∥ λ n , k T k U n , k − 1 x + ( 1 − λ n , k ) T k − 1 x − λ k T k U k − 1 − ( 1 − λ k ) T k − 1 x ∥ = ∥ λ n , k T k U n , k − 1 x − λ n , k T k − 1 x − λ k T k U k − 1 + λ k T k − 1 x ∥ ≤ λ n , k ∥ T k U n , k − 1 x − T k U k − 1 x ∥ + | λ n , k − λ k | ∥ T k U k − 1 x ∥ + | λ n , k − λ k | ∥ T k − 1 x ∥ ≤ ∥ U n , k − 1 x − U k − 1 x ∥ + | λ n , k − λ k | M .

It follows that

∥ B n x − B x ∥ = ∥ U n , N x − U N x ∥ ≤ ∥ U n , N − 1 x − U N − 1 x ∥ + | λ n , N − λ N | M ≤ ∥ U n , N − 2 x − U N − 2 x ∥ + | λ n , N − 1 − λ N − 1 | M + | λ n , N − λ N | M ⋮ ≤ ∥ U n , 1 x − U 1 x ∥ + | λ n , 2 − λ 2 | M + ⋯ + | λ n , N − 1 − λ N − 1 | M + | λ n , N − λ N | M ≤ | λ n , 1 − λ 1 | ∥ T 1 x − x ∥ + | λ n , 2 − λ 2 | M + ⋯ + | λ n , N − 1 − λ N − 1 | M + | λ n , N − λ N | M .

Since λ n , i → λ i as n→∞ (i=1,2,…,N), we thus complete the proof. □

Remark 3.3 It is easily seen that for all n∈N, B n is nonexpansive.

Lemma 3.4 Let C be a nonempty closed convex subset of a real Banach space E. Let { T i } i = 1 N be a finite family of nonexpansive mappings of C into itself such that ⋂ i = 1 N F( T i )≠∅. Let { λ n , i } i = 1 N be a real sequence in (0,1). For every n∈N, let B n be the B-mapping generated by T 1 , T 2 ,…, T N and λ n , 1 , λ n , 2 ,…, λ n , N .

If lim n → ∞ | λ n + 1 , i − λ n , i |=0 for all i=1,2,…,N, then

lim n → ∞ ∥ B n + 1 z n − B n z n ∥=0

for each bounded sequence { z n } in C.

Proof Let { z n } be a bounded sequence in C. For j∈{0,1,…,N−2} and for some M>0, we have

∥ U n + 1 , N − j z n − U n , N − j z n ∥ = ∥ λ n + 1 , N − j T N − j U n + 1 , N − j − 1 z n + ( 1 − λ n + 1 , N − j ) T N − j − 1 z n − λ n , N − j T N − j U n , N − j − 1 z n − ( 1 − λ n , N − j ) T N − j − 1 z n ∥ ≤ λ n + 1 , N − j ∥ T N − j U n + 1 , N − j − 1 z n − T N − j U n , N − j − 1 z n ∥ + | λ n + 1 , N − j − λ n , N − j | ∥ T N − j U n , N − j − 1 z n ∥ + | λ n + 1 , N − j − λ n , N − j | ∥ T N − j − 1 z n ∥ ≤ ∥ U n + 1 , N − j − 1 z n − U n , N − j − 1 z n ∥ + | λ n + 1 , N − j − λ n , N − j | M .

Using the relation above, we can show that

∥ B n + 1 z n − B n z n ∥ = ∥ U n + 1 , N z n − U n , N z n ∥ ≤ M ∑ j = 2 N | λ n + 1 , j − λ n , j | + | λ n + 1 , 1 − λ n , 1 | ( ∥ z n ∥ + ∥ T 1 z n ∥ ) .

Since lim n → ∞ | λ n + 1 , i − λ n , i |=0 for all i=1,2,…,N, we obtain the desired result. □

Using the concept of B-mapping, we study weak convergence of the sequence generated by Mann-type iteration process (1.2).

Theorem 3.5 Let E be a uniformly convex Banach space having a Fréchet differentiable norm or that satisfies Opial’s condition. Let C be a nonempty, closed and convex subset of E. Let { T i } i = 1 N be a finite family of nonexpansive mappings of C into itself such that ⋂ i = 1 N F( T i )≠∅. Let { λ n , i } i = 1 N be a real sequence in (0,1) such that λ n , i → λ i (i=1,2,…,N). For every n∈N, let B n be the B-mapping generated by T 1 , T 2 ,…, T N and λ n , 1 , λ n , 2 ,…, λ n , N . Let { α n } be a sequence in (0,1) satisfying lim inf n → ∞ α n (1− α n )>0. Let { x n } be generated by x 1 ∈C and

x n + 1 =(1− α n ) x n + α n B n x n ,∀n≥1.

Then { x n } converges weakly to x ∗ ∈ ⋂ i = 1 N F( T i ).

Proof Let p∈ ⋂ i = 1 N F( T i ). Then p= B n p for all n≥1 and hence

∥ x n + 1 −p∥≤(1− α n )∥ x n −p∥+ α n ∥ B n x n −p∥≤∥ x n −p∥.

It follows that {∥ x n −p∥} is nonincreasing; consequently, lim n → ∞ ∥ x n −p∥ exists. Assume ∥ x n −p∥>0. Since E is uniformly convex, it follows (see, for example, [27]) that

∥ x n + 1 −p∥≤∥ x n −p∥ { 1 − 2 min { α n , 1 − α n } δ E ( ∥ x n − B n x n ∥ ∥ x n − p ∥ ) } ,

which implies that

α n ( 1 − α n ) ∥ x n − p ∥ δ E ( ∥ x n − B n x n ∥ ∥ x n − p ∥ ) ≤ min { α n , 1 − α n } ∥ x n − p ∥ δ E ( ∥ x n − B n x n ∥ ∥ x n − p ∥ ) ≤ 1 2 { ∥ x n − p ∥ − ∥ x n + 1 − p ∥ } .

Since lim n → ∞ ∥ x n −p∥ exists and lim inf n → ∞ α n (1− α n )>0, by the continuity of δ E , we have lim n → ∞ ∥ x n − B n x n ∥=0. Since λ n , i → λ i (i=1,2,…,N), let the mapping B:C→C be generated by T 1 , T 2 ,…, T N and λ 1 , λ 2 ,…, λ N . Then, by Lemma 3.2, we have lim n → ∞ ∥ B n x−Bx∥=0 for all x∈C. So we have

∥ x n − B x n ∥ ≤ ∥ x n − B n x n ∥ + ∥ B n x n − B x n ∥ ≤ ∥ x n − B n x n ∥ + sup z ∈ { x n } ∥ B n z − B z ∥ → 0 .

Since B is nonexpansive and E is uniformly convex, by the demiclosedness principle, ω ω ( x n )⊂F(B). Moreover, F(B)= â‹‚ i = 1 N F( T i ) by Lemma 3.1(i).

We next show that ω ω ( x n ) is a singleton. Indeed, suppose that x ∗ , y ∗ ∈ ω ω ( x n )⊂ ⋂ i = 1 N F( T i ). Define S n :C→C by

S n x=(1− α n )x+ α n B n x,x∈C.

Then S n is nonexpansive and x ∗ , y ∗ ∈ â‹‚ n = 1 ∞ F( S n ). Using Lemma 2.4, we have lim n → ∞ 〈 x n ,J( x ∗ − y ∗ )〉 exists. Suppose that { x n k } and { x m k } are subsequences of { x n } such that x n k ⇀ x ∗ and x m k ⇀ y ∗ . Then

∥ x ∗ − y ∗ ∥ 2 = 〈 x ∗ − y ∗ , J ( x ∗ − y ∗ ) 〉 = lim k → ∞ 〈 x n k − x m k , J ( x ∗ − y ∗ ) 〉 =0.

This shows that x ∗ = y ∗ .

Assume that E satisfies Opial’s condition. Let x ∗ , y ∗ ∈ ω ω ( x n ) and { x n k } and { x m k } be subsequences of { x n } such that x n k ⇀ x ∗ and x m k ⇀ y ∗ . If x ∗ ≠ y ∗ , then

lim n → ∞ ∥ x n − x ∗ ∥ = lim k → ∞ ∥ x n k − x ∗ ∥ < lim k → ∞ ∥ x n k − y ∗ ∥ = lim k → ∞ ∥ x m k − y ∗ ∥ < lim k → ∞ ∥ x m k − x ∗ ∥ = lim n → ∞ ∥ x n − x ∗ ∥ ,

which is a contradiction. It follows that x ∗ = y ∗ . Therefore x n ⇀ x ∗ ∈ ⋂ i = 1 N F( T i ) as n→∞. This completes the proof. □

4 Strong convergence theorem

In this section, we prove a strong convergence theorem for a finite family of nonexpansive mappings in Banach spaces.

Theorem 4.1 Let E be a strictly convex and reflexive Banach space having a uniformly Gâteaux differentiable norm. Let C be a nonempty, closed and convex subset of E. Let { T i } i = 1 N be a finite family of nonexpansive mappings of C into itself such that ⋂ i = 1 N F( T i )≠∅. Let { λ n , i } i = 1 N be a real sequence in (0,1) such that λ n , i → λ i (i=1,2,…,N). For every n∈N, let B n be the B-mapping generated by T 1 , T 2 ,…, T N and λ n , 1 , λ n , 2 ,…, λ n , N . Let { α n }, { β n } and { γ n } be sequences in (0,1) which satisfy the conditions:

  1. (C1)

    α n + β n + γ n =1;

  2. (C2)

    lim n → ∞ α n =0 and ∑ n = 1 ∞ α n =∞;

  3. (C3)

    0< lim inf n → ∞ β n ≤ lim sup n → ∞ β n <1.

Let f∈ Σ C and define the sequence { x n } by x 1 ∈C and

x n + 1 = α n f( x n )+ β n x n + γ n B n x n ,∀n≥1.

Then { x n } converges strongly to q∈ ⋂ i = 1 N F( T i ), where q is also the unique solution of the variational inequality

〈 ( I − f ) ( q ) , J ( q − p ) 〉 ≤0,∀p∈ ⋂ i = 1 N F( T i ).
(4.1)

Proof We divide the proof into the following steps.

Step 1. We show that { x n } is bounded. Let p∈ ⋂ i = 1 N F( T i ). Then p= B n p for all n≥1 and hence, by the nonexpansiveness of { B n } n = 1 ∞ , we have

∥ x n + 1 − p ∥ = ∥ α n ( f ( x n ) − p ) + β n ( x n − p ) + γ n ( B n x n − p ) ∥ ≤ α n ∥ f ( x n ) − p ∥ + β n ∥ x n − p ∥ + γ n ∥ x n − p ∥ ≤ α n ∥ f ( x n ) − f ( p ) ∥ + α n ∥ f ( p ) − p ∥ + ( 1 − α n ) ∥ x n − p ∥ ≤ α n α ∥ x n − p ∥ + α n ∥ f ( p ) − p ∥ + ( 1 − α n ) ∥ x n − p ∥ = ( 1 − α n ( 1 − α ) ) ∥ x n − p ∥ + α n ∥ f ( p ) − p ∥ ≤ max { ∥ x n − p ∥ , 1 1 − α ∥ f ( p ) − p ∥ } .

By induction, we can conclude that { x n } is bounded. So are {f( x n )} and { B n x n }.

Step 2. We show that lim n → ∞ ∥ x n + 1 − x n ∥=0. To this end, we define z n = x n + 1 − β n x n 1 − β n . From (1.3) we have

∥ z n + 1 − z n ∥ = ∥ α n + 1 f ( x n + 1 ) + γ n + 1 B n + 1 x n + 1 1 − β n + 1 − α n f ( x n ) + γ n B n x n 1 − β n ∥ = ∥ α n + 1 1 − β n + 1 ( f ( x n + 1 ) − B n x n ) + α n 1 − β n ( B n x n − f ( x n ) ) + γ n + 1 1 − β n + 1 ( B n + 1 x n + 1 − B n x n ) ∥ ≤ α n + 1 1 − β n + 1 M + α n 1 − β n M + ∥ B n + 1 x n + 1 − B n x n ∥ ≤ ( α n + 1 1 − β n + 1 + α n 1 − β n ) M + ∥ B n + 1 x n + 1 − B n + 1 x n ∥ + ∥ B n + 1 x n − B n x n ∥ ≤ ( α n + 1 1 − β n + 1 + α n 1 − β n ) M + ∥ x n + 1 − x n ∥ + ∥ B n + 1 x n − B n x n ∥

for some M>0. It turns out that

∥ z n + 1 − z n ∥−∥ x n + 1 − x n ∥≤ ( α n + 1 1 − β n + 1 + α n 1 − β n ) M+∥ B n + 1 x n − B n x n ∥.

From conditions (C2), (C3) and Lemma 3.4, we have

lim sup n → ∞ ( ∥ z n + 1 − z n ∥ − ∥ x n + 1 − x n ∥ ) ≤0.

Lemma 2.3 yields that ∥ z n − x n ∥→0 and hence

∥ x n + 1 − x n ∥=(1− β n )∥ z n − x n ∥→0.

Step 3. We show that lim n → ∞ ∥B x n − x n ∥=0. Indeed, noting that

B n x n − x n = 1 γ n { ( x n + 1 − x n ) + α n ( x n − f ( x n ) ) } ,

we have, by (C2) and (C3),

lim n → ∞ ∥ B n x n − x n ∥=0.

Let B:C→C be the B-mapping generated by T 1 , T 2 ,…, T N and λ 1 , λ 2 ,…, λ N . So, by Lemma 3.2, we have B n x→Bx for all x∈C. It also follows that

∥ B x n − x n ∥ ≤ ∥ B x n − B n x n ∥ + ∥ B n x n − x n ∥ ≤ sup z ∈ { x n } ∥ B z − B n z ∥ + ∥ B n x n − x n ∥ → 0 .

For t∈(0,1), we define a contraction as follows:

S t x=tf(x)+(1−t)Bx.

Then there exists a unique path x t ∈C such that

x t =tf( x t )+(1−t)B x t .

From Lemma 2.5, we know that x t →q as t→0, where q∈F(B). Lemma 3.1(i) also yields that q∈F(B)= â‹‚ i = 1 N F( T i ). Moreover, q is the unique solution of variational inequality (4.1).

Step 4. We show that lim sup n → ∞ 〈f(q)−q,J( x n −q)〉≤0. We see that

x t − x n =(1−t)(B x t − x n )+t ( f ( x t ) − x n ) .

It follows, by Lemma 2.1(ii) that

∥ x t − x n ∥ 2 ≤ ( 1 − t ) 2 ∥ B x t − x n ∥ 2 + 2 t 〈 f ( x t ) − x n , J ( x t − x n ) 〉 ≤ ( 1 − 2 t + t 2 ) ( ∥ x t − x n ∥ + ∥ B x n − x n ∥ ) 2 + 2 t 〈 f ( x t ) − x t , J ( x t − x n ) 〉 + 2 t ∥ x t − x n ∥ 2 ,

which gives

〈 f ( x t ) − x t , J ( x n − x t ) 〉 ≤ ( 1 + t 2 ) ∥ x n − B x n ∥ 2 t ( 2 ∥ x t − x n ∥ + ∥ x n − B x n ∥ ) + t 2 ∥ x t − x n ∥ 2 .

So we have

lim sup n → ∞ 〈 f ( x t ) − x t , J ( x n − x t ) 〉 ≤ t 2 M
(4.2)

for some M>0. Since E has a uniformly Gâteaux differentiable norm, J is norm-to-weak∗ uniformly continuous on bounded subsets of E. So we have

〈 f ( q ) − q , J ( x n − q ) − J ( x n − x t ) 〉 →0
(4.3)

and

〈 f ( q ) − f ( x t ) + x t − q , J ( x n − x t ) 〉 →0
(4.4)

as t→0. On the other hand, we have

〈 f ( q ) − q , J ( x n − q ) 〉 = 〈 f ( x t ) − x t , J ( x n − x t ) 〉 + 〈 f ( q ) − f ( x t ) + x t − q , J ( x n − x t ) 〉 + 〈 f ( q ) − q , J ( x n − q ) − J ( x n − x t ) 〉 .
(4.5)

Since lim sup n → ∞ and lim sup t → 0 are interchangeable, using (4.2)-(4.5), we obtain

lim sup n → ∞ 〈 f ( q ) − q , J ( x n − q ) 〉 ≤0.

Step 5. We show that x n →q as n→∞. In fact, we have

∥ x n + 1 − q ∥ 2 = α n 〈 f ( x n ) − q , J ( x n + 1 − q ) 〉 + β n 〈 x n − q , J ( x n + 1 − q ) 〉 + γ n 〈 B n x n − q , J ( x n + 1 − q ) 〉 ≤ α n α ∥ x n − q ∥ ∥ x n + 1 − q ∥ + α n 〈 f ( q ) − q , J ( x n + 1 − q ) 〉 + β n ∥ x n − q ∥ ∥ x n + 1 − q ∥ + γ n ∥ x n − q ∥ ∥ x n + 1 − q ∥ = ( 1 − α n ( 1 − α ) ) ∥ x n − q ∥ ∥ x n + 1 − q ∥ + α n 〈 f ( q ) − q , J ( x n + 1 − q ) 〉 ≤ 1 2 ( 1 − α n ( 1 − α ) ) ( ∥ x n − q ∥ 2 + ∥ x n + 1 − q ∥ 2 ) + α n 〈 f ( q ) − q , J ( x n + 1 − q ) 〉 ,

which implies that

∥ x n + 1 − q ∥ 2 ≤ 1 − α n ( 1 − α ) 1 + α n ( 1 − α ) ∥ x n − q ∥ 2 + 2 α n 1 + α n ( 1 − α ) 〈 f ( q ) − q , J ( x n + 1 − q ) 〉 = ( 1 − 2 α n ( 1 − α ) 1 + α n ( 1 − α ) ) ∥ x n − q ∥ 2 + 2 α n 1 + α n ( 1 − α ) 〈 f ( q ) − q , J ( x n + 1 − q ) 〉 .

Put c n = 2 α n ( 1 − α ) 1 + α n ( 1 − α ) and b n = 2 α n 1 + α n ( 1 − α ) 〈f(q)−q,J( x n + 1 −q)〉. So it is easy to check that { c n } is a sequence in (0,1) such that ∑ n = 1 ∞ c n =∞ and lim sup n → ∞ b n c n ≤0. Hence, by Lemma 2.7, we conclude that x n →q as n→∞. This completes the proof. □

References

  1. Mann WR: Mean value methods in iteration. Proc. Am. Math. Soc. 1953, 4: 506–510. 10.1090/S0002-9939-1953-0054846-3

    Article  Google Scholar 

  2. Reich S: Weak convergence theorems for nonexpansive mappings in Banach spaces. J. Math. Anal. Appl. 1979, 67: 274–276. 10.1016/0022-247X(79)90024-6

    Article  MathSciNet  Google Scholar 

  3. Ishikawa S: Fixed points by a new iteration method. Proc. Am. Math. Soc. 1974, 44: 147–150. 10.1090/S0002-9939-1974-0336469-5

    Article  MathSciNet  Google Scholar 

  4. Agarwal RP, O’Regan D, Sahu DR: Iterative construction of fixed points of nearly asymptotically nonexpansive mappings. J. Nonlinear Convex Anal. 2007, 8: 61–79.

    MathSciNet  Google Scholar 

  5. Agarwal RP, O’Regan D, Sahu DR: Fixed Point Theory for Lipschitzian-Type Mappings with Applications. Springer, New York; 2009.

    Google Scholar 

  6. Atsushiba S, Takahashi W: Strong convergence theorems for a finite family of nonexpansive mappings and applications. Indian J. Math. 1999, 41: 435–453. In: B.N. Prasad birth centenary commemoration volume

    MathSciNet  Google Scholar 

  7. Bruck RE: Properties of fixed-point sets of nonexpansive mappings in Banach spaces. Trans. Am. Math. Soc. 1973, 179: 251–262.

    Article  MathSciNet  Google Scholar 

  8. Kangtunyakarn A, Suantai S: A new mapping for finding common solutions of equilibrium problems and fixed point problems of finite family of nonexpansive mappings. Nonlinear Anal. TMA 2009, 71: 4448–4460. 10.1016/j.na.2009.03.003

    Article  MathSciNet  Google Scholar 

  9. Takahashi W, Shimoji K: Convergence theorems for nonexpansive mappings and feasibility problems. Math. Comput. Model. 2000, 32: 1463–1471. 10.1016/S0895-7177(00)00218-1

    Article  MathSciNet  Google Scholar 

  10. Moudafi A: Viscosity approximation methods for fixed point problems. J. Math. Anal. Appl. 2000, 241: 46–55. 10.1006/jmaa.1999.6615

    Article  MathSciNet  Google Scholar 

  11. Chang SS: Viscosity approximation methods for a finite family of nonexpansive mappings in Banach spaces. J. Math. Anal. Appl. 2006, 323: 1402–1416. 10.1016/j.jmaa.2005.11.057

    Article  MathSciNet  Google Scholar 

  12. Cho YJ, Kang SM, Zhou H: Some control conditions on iterative methods. Commun. Appl. Nonlinear Anal. 2005, 12: 27–34.

    MathSciNet  Google Scholar 

  13. Hu L-G: Theorems of strong convergence of mixed iterative methods for obtaining strict pseudocontractions in Banach spaces. Appl. Math. Lett. 2010, 23: 791–795. 10.1016/j.aml.2010.03.011

    Article  MathSciNet  Google Scholar 

  14. Jung JS: Iterative approaches to common fixed points of nonexpansive mappings in Banach spaces. J. Math. Anal. Appl. 2005, 302: 509–520. 10.1016/j.jmaa.2004.08.022

    Article  MathSciNet  Google Scholar 

  15. Jung JS, Sahu DR: Convergence of approximating paths to solutions of variational inequalities involving non-Lipschitzian mappings. J. Korean Math. Soc. 2008, 45: 377–392. 10.4134/JKMS.2008.45.2.377

    Article  MathSciNet  Google Scholar 

  16. Marino G, Xu HK: A general iterative method for nonexpansive mappings in Hilbert spaces. J. Math. Anal. Appl. 2006, 318: 43–52. 10.1016/j.jmaa.2005.05.028

    Article  MathSciNet  Google Scholar 

  17. Takahashi W: Viscosity approximation methods for countable families of nonexpansive mappings in Banach spaces. Nonlinear Anal. TMA 2009, 70: 719–734. 10.1016/j.na.2008.01.005

    Article  Google Scholar 

  18. Xu HK: Viscosity approximation methods for nonexpansive mappings. J. Math. Anal. Appl. 2004, 298: 279–291. 10.1016/j.jmaa.2004.04.059

    Article  MathSciNet  Google Scholar 

  19. Xu HK: Another control condition in iterative method for nonexpansive mappings. Bull. Aust. Math. Soc. 2002, 65: 109–113. 10.1017/S0004972700020116

    Article  Google Scholar 

  20. Yao Y, Liou LC, Zhou H: Strong convergence of an iterative method for nonexpansive mappings with new control conditions. Nonlinear Anal. TMA 2009, 70: 2332–2336. 10.1016/j.na.2008.03.014

    Article  MathSciNet  Google Scholar 

  21. Zhou H, Wei L, Cho YJ: Strong convergence theorems on an iterative method for a family of finite nonexpansive mappings in reflexive Banach spaces. Appl. Math. Comput. 2006, 173: 196–212. 10.1016/j.amc.2005.02.049

    Article  MathSciNet  Google Scholar 

  22. Opial Z: Weak convergence of successive approximations for nonexpansive mappings. Bull. Am. Math. Soc. 1967, 73: 591–597. 10.1090/S0002-9904-1967-11761-0

    Article  MathSciNet  Google Scholar 

  23. Browder FE: Nonexpansive nonlinear operators in a Banach space. Proc. Natl. Acad. Sci. USA 1965, 54: 1041–1044. 10.1073/pnas.54.4.1041

    Article  MathSciNet  Google Scholar 

  24. Takahashi W: Nonlinear Function Analysis. Yokohama Publishers, Yokohama; 2000.

    Google Scholar 

  25. Suzuki T: Strong convergence of Krasnoselskii and Mann’s type sequences for one parameter nonexpansive semigroups without Bochner integrals. J. Math. Anal. Appl. 2005, 305: 227–239. 10.1016/j.jmaa.2004.11.017

    Article  MathSciNet  Google Scholar 

  26. Tan KK, Xu HK: Fixed point iteration processes for asymptotically nonexpansive mappings. Proc. Am. Math. Soc. 1994, 122: 733–739. 10.1090/S0002-9939-1994-1203993-5

    Article  MathSciNet  Google Scholar 

  27. Bruck RE: A simple proof of the mean ergodic theorem for nonlinear contractions in Banach spaces. Isr. J. Math. 1979, 32: 107–116. 10.1007/BF02764907

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The author wishes to thank editor/referees for valuable suggestions and Professor Suthep Suantai for the guidance. This research was supported by the Thailand Research Fund, the Commission on Higher Education, and University of Phayao under Grant MRG5580016.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Prasit Cholamjiak.

Additional information

Competing interests

The author declares that he has no competing interests.

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and permissions

About this article

Cite this article

Cholamjiak, P. A new multi-step iteration for solving a fixed point problem of nonexpansive mappings. Fixed Point Theory Appl 2013, 198 (2013). https://doi.org/10.1186/1687-1812-2013-198

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1186/1687-1812-2013-198

Keywords