1 Introduction

Let E be a real Banach space with the dual E . We denote by J the normalized duality mapping from E to 2 E defined by

Jx= { f E : x , f = x 2 = f 2 } ,

where , denotes the generalized duality pairing. The duality mapping J has the following properties: (1) if E is smooth, then J is single-valued; (2) if E is strictly convex, then J is one-to-one; (3) if E is reflexive, then J is surjective; (4) if E is uniformly smooth, then J is uniformly norm-to-norm continuous on each bounded subset of E; (5) if E is uniformly convex, then J is uniformly continuous on bounded subsets of E and J is singe-valued and also one-to-one (see [14]).

Let E be a smooth Banach space with the dual E . The functional ϕ:E×ER is defined by

ϕ(x,y)= x 2 2x,Jy+ y 2 ,

for all x,yE.

Let C be a closed convex subset of E, and let T be a mapping from C into itself. We denote by F(T) the set of fixed points of T. A point p in C is said to be an asymptotic fixed point of T [5] if C contains a sequence { x n } which converges weakly to p such that the strong lim n ( x n T x n )=0. The set of asymptotic fixed points of T will be denoted by  F ˆ (T). A mapping T from C into itself is called nonexpansive if TxTyxy for all x,yC and relatively nonexpansive if F(T)= F ˆ (T) and ϕ(p,Tx)ϕ(p,x) for all xC and pF(T). The asymptotic behavior of a relatively nonexpansive mapping was studied in [1, 69].

Three classical iteration processes are often used to approximate a fixed point of a nonexpansive mapping. The first one was introduced in 1953 by Mann [10] and is well known as Mann’s iteration process defined as follows:

{ x 0 chosen arbitrarily , x n + 1 = α n x n + ( 1 α n ) T x n , n 0 ,
(1.1)

where the sequence { α n } is chosen in [0,1]. Fourteen years later, Halpern [11] proposed the new innovation iteration process which resembled Mann’s iteration (1.1). It is defined by

{ x 0 chosen arbitrarily , x n + 1 = α n u + ( 1 α n ) T x n , n 0 ,
(1.2)

where the element uC is fixed. Seven years later, Ishikawa [2] enlarged and improved Mann’s iteration (1.1) to the new iteration method, which is often cited as Ishikawa’s iteration process and defined recursively by

{ x 0 chosen arbitrarily , y n = β n x n + ( 1 β n ) T x n , x n + 1 = α n x n + ( 1 α n ) T y n , n 0 ,
(1.3)

where { α n } and { β n } are sequences in the interval [0,1].

In both Hilbert space [1113] and uniformly smooth Banach space [1416] the iteration process (1.2) has been proved to be strongly convergent if the sequence { α n } satisfies the following conditions:

  1. (i)

    α n 0;

  2. (ii)

    n = 0 α n =;

  3. (iii)

    n = 0 | α n + 1 α n |< or lim n α n α n + 1 =1.

By the restriction of condition (ii), it is widely believed that Halpern’s iteration process (1.2) has slow convergence though the rate of convergence has not been determined. Halpern [11] proved that conditions (i) and (ii) are necessary in the strong convergence of (1.2) for a nonexpansive mapping T on a closed convex subset C of a Hilbert space H. Moreover, Wittmann [13] showed that (1.2) converges strongly to P F ( T ) u when { α n } satisfies (i), (ii) and (iii), where P F ( T ) () is the metric projection onto F(T).

Both iteration processes (1.1) and (1.3) have only weak convergence in a general Banach space (see [17] for more details). As a matter of fact, the process (1.1) may fail to converge, while the process (1.3) can still converge for a Lipschitz pseudo-contractive mapping in a Hilbert space [18]. For example, Reich [19] proved that if E is a uniformly convex Banach space with the Fréchet differentiable norm and if { α n } is chosen such that n = 0 α n (1 α n )=, then the sequence { x n } defined by (1.1) converges weakly to a fixed point of T. However, we note that Mann’s iteration process (1.1) has only weak convergence even in a Hilbert space [17].

Some attempts to modify the Mann iteration method so that strong convergence is guaranteed have recently been made. Nakajo and Takahashi [20] proposed the following modification of the Mann iteration method for a single nonexpansive mapping T in a Hilbert space H:

{ x 0 C chosen arbitrarily , y n = α n x n + ( 1 α n ) T x n , C n = { z C : y n z x n z } , Q n = { z C : x n z , x 0 x n 0 } , x n + 1 = P C n Q n ( x 0 ) ,
(1.4)

where C is a closed convex subset of H, P K denotes the metric projection from H onto a closed convex subset K of H. They proved that if the sequence { α n } is bounded above from one, then the sequence { x n } generated by (1.4) converges strongly to P F ( T ) ( x 0 ), where F(T) denotes the fixed point set of T.

The ideas to generalize the process (1.4) from a Hilbert space to a Banach space have recently been made. By using available properties on a uniformly convex and uniformly smooth Banach space, Matsushita and Takahashi [9] presented their ideas as the following method for a single relatively nonexpansive mapping T in a Banach space E:

{ x 0 C chosen arbitrarily , y n = J 1 ( α n J x 0 + ( 1 α n ) J T x n ) , C n = { z C : ϕ ( z , y n ) ϕ ( z , x n ) } , Q n = { z C : x n z , J x 0 J x n 0 } , x n + 1 = Π C n Q n ( x 0 ) .
(1.5)

They proved the following convergence theorem.

Theorem MT Let E be a uniformly convex and uniformly smooth Banach space, let C be a nonempty closed convex subset of E, let T be a relatively nonexpansive mapping from C into itself, and let { α n } be a sequence of real numbers such that 0 α n <1 and lim sup n α n <1. Suppose that { x n } is given by (1.6), where J is the duality mapping on E. If F(T) is nonempty, then { x n } converges strongly to Π F ( T ) x 0 , where Π F ( T ) () is the generalized projection from C onto F(T).

In 2007, Plubtieng and Ungchittrakool [21] proposed the following hybrid algorithms for two relatively nonexpansive mappings in a Banach space and proved the following convergence theorems.

Theorem SK1 Let E be a uniformly convex and uniformly smooth real Banach space, let C be a nonempty closed convex subset of E, let T, S be two relatively nonexpansive mappings from C into itself with F:=F(T)F(S) is nonempty. Let a sequence { x n } be defined by

{ x 0 C chosen arbitrarily , y n = J 1 ( α n J x n + ( 1 α n ) J z n ) , z n = J 1 ( β n ( 1 ) J x n + β n ( 2 ) J T x n + β n ( 3 ) J S x n ) , H n = { z C : ϕ ( z , y n ) ϕ ( z , x n ) } , W n = { z C : x n z , J x 0 J x n 0 } , x n + 1 = Π H n W n ( x 0 )
(1.6)

with the following restrictions:

  1. (i)

    0 α n <1, lim sup n α n <1;

  2. (ii)

    0 β n ( 1 ) , β n ( 1 ) , β n ( 3 ) 1, lim n β n ( 1 ) =0, lim inf n β n ( 2 ) β n ( 3 ) >0.

Then { x n } converges strongly to Π F x 0 , where Π F is the generalized projection from C onto F.

Theorem SK2 Let E be a uniformly convex and uniformly smooth Banach space, let C be a nonempty closed convex subset of E, let T, S be two relatively nonexpansive mappings from C into itself with F:=F(T)F(S) is nonempty. Let a sequence { x n } be defined by

{ x 0 C chosen arbitrarily , y n = J 1 ( α n J x 0 + ( 1 α n ) J z n ) , z n = J 1 ( β n ( 1 ) J x n + β n ( 2 ) J T x n + β n ( 3 ) J S x n ) , H n = { z C : ϕ ( z , y n ) ϕ ( z , x n ) + α n ( x 0 2 + 2 z , J x n J x 0 ) } , W n = { z C : x n z , J x 0 J x n 0 } , x n + 1 = Π H n W n ( x 0 )
(1.7)

with the following restrictions:

  1. (i)

    0< α n <1, lim sup n α n <1;

  2. (ii)

    0 β n ( 1 ) , β n ( 1 ) , β n ( 3 ) 1, lim n β n ( 1 ) =0, lim inf n β n ( 2 ) β n ( 3 ) >0.

Then { x n } converges strongly to Π F x 0 , where Π F is the generalized projection from C onto F.

In 2010, Su, Xu and Zhang [22] proposed the following hybrid algorithms for two countable families of weak relatively nonexpansive mappings in a Banach space and proved the following convergence theorems.

Theorem SKZ Let E be a uniformly convex and uniformly smooth real Banach space, let C be a nonempty closed convex subset of E, let { T n }, { S n } be two countable families of weak relatively nonexpansive mappings from C into itself such that F:=( n = 0 F( T n ))( n = 0 F( S n )). Define a sequence { x n } in C by the following algorithm:

{ x 0 C chosen arbitrarily , z n = J 1 ( β n ( 1 ) J x n + β n ( 2 ) J T n x n + β n ( 3 ) J S n x n ) , y n = J 1 ( α n J x n + ( 1 α n ) J z n ) , C n = { z C n 1 Q n 1 : ϕ ( z , y n ) ϕ ( z , x n ) } , C 0 = { z C : ϕ ( z , y 0 ) ϕ ( z , x 0 ) } , Q n = { z C n 1 Q n 1 : x n z , J x 0 J x n 0 } , Q 0 = C , x n + 1 = Π C n Q n ( x 0 )
(1.8)

with the conditions

  1. (i)

    lim inf n β n ( 1 ) β n ( 2 ) >0;

  2. (ii)

    lim inf n β n ( 1 ) β n ( 3 ) >0;

  3. (iii)

    0 α n α<1 for some α(0,1).

Then { x n } converges strongly to Π F x 0 , where Π F is the generalized projection from C onto F.

Unfortunately, in recent years, many hybrid algorithms have been very complex, so these complex algorithms are not applicable or are very difficult in applications. Naturally, we hope to obtain some simple and practical algorithms. The purpose of this article is to present a simple projection algorithm for a countable family of weak relatively nonexpansive mappings and to prove strong convergence theorems in Banach spaces.

In addition, we shall give an example which is a countable family of weak relatively nonexpansive mappings, but not a countable family of relatively nonexpansive mappings.

2 Preliminaries

Let E be a smooth Banach space with the dual E . The functional ϕ:E×ER is defined by

ϕ(x,y)= x 2 2x,Jy+ y 2 ,
(2.1)

for all x,yE. Observe that in a Hilbert space H, (2.1) reduces to ϕ(x,y)= x y 2 , x,yH.

Recall that if C is a nonempty, closed and convex subset of a Hilbert space H and P C :HC is the metric projection of H onto C, then P C is nonexpansive. This is true only when H is a real Hilbert space. In this connection, Alber [23] has recently introduced a generalized projection operator Π C in a Banach space E which is an analogue of the metric projection in Hilbert spaces. The generalized projection Π C :EC is a map that assigns to an arbitrary point xE the minimum point of the functional ϕ(y,x), that is, Π C x= x ¯ , where x ¯ is the solution to the minimization problem

ϕ( x ¯ ,x)= min y C ϕ(y,x).
(2.2)

The existence and uniqueness of the operator Π C follow from the properties of the functional ϕ(y,x) and strict monotonicity of the mapping J. In a Hilbert space, Π C = P C . It is obvious from the definition of the functional ϕ that

( x y ) 2 ϕ(y,x) ( y 2 + x 2 )
(2.3)

and

ϕ(x,y)=ϕ(x,z)+ϕ(z,y)2xz,JzJy
(2.4)

for all x,yE. See [24] for more details.

This section collects some definitions and lemmas which will be used in the proofs for the main results in the next section. Some of them are known; others are not hard to derive.

Remark 2.1 If E is a reflexive strictly convex and smooth Banach space, then for x,yE, ϕ(x,y)=0 if and only if x=y. It is sufficient to show that if ϕ(x,y)=0 then x=y. From (2.3), we have x=y. This implies x,Jy= x 2 = J y 2 . From the definition of J, we have Jx=Jy. Since J is one-to-one, then we have x=y; see [13, 16, 25] for more details.

In this paper, we give the definitions of a countable family of relatively nonexpansive mappings and a countable family of weak relatively nonexpansive mappings which are generalizations of a relatively nonexpansive mapping and a weak relatively nonexpansive mapping respectively. We also give an example which is a countable family of weak relatively nonexpansive mappings, but not a countable family of relatively nonexpansive mappings.

Let C be a closed convex subset of E, and let { T n } n = 0 be a countable family of mappings from C into itself. We denote by F the set of common fixed points of { T n } n = 0 . That is F= n = 0 F( T n ), where F( T n ) denotes the set of fixed points of T n for all n0. A point p in C is said to be an asymptotic fixed point of { T n } n = 0 if C contains a sequence { x n } which converges weakly to p such that lim n T n x n x n =0. The set of asymptotic fixed points of { T n } n = 0 will be denoted by F ˆ ( { T n } n = 0 ). A point p in C is said to be a strong asymptotic fixed point of { T n } n = 0 if C contains a sequence { x n } which converges strongly to p such that lim n T n x n x n =0. The set of strong asymptotic fixed points of { T n } n = 0 will be denoted by F ˜ ( { T n } n = 0 ).

Definition 2.2 The countable family of mappings { T n } n = 0 is said to be a countable family of relatively nonexpansive mappings if the following conditions are satisfied:

  1. (1)

    F( { T n } n = 0 ) is nonempty;

  2. (2)

    ϕ(u, T n x)ϕ(u,x), uF( T n ), xC, n0;

  3. (3)

    F ˆ ( { T n } n = 0 )= n = 0 F( T n ).

Definition 2.3 The countable family of mappings { T n } n = 0 is said to be a countable family of weak relatively nonexpansive mappings if the following conditions are satisfied:

  1. (1)

    F( { T n } n = 0 ) is nonempty;

  2. (2)

    ϕ(u, T n x)ϕ(u,x), uF( T n ), xC, n0;

  3. (3)

    F ˜ ( { T n } n = 0 )= n = 0 F( T n ).

Definition 2.4 [21]

The mapping T is said to be a relatively nonexpansive mapping if the following conditions are satisfied:

  1. (1)

    F(T) is nonempty;

  2. (2)

    ϕ(u,Tx)ϕ(u,x), uF(T), xC;

  3. (3)

    F ˜ (T)=F(T).

Definition 2.5 The mapping T is said to be a weak relatively nonexpansive mapping if the following conditions are satisfied:

  1. (1)

    F(T) is nonempty;

  2. (2)

    ϕ(u,Tx)ϕ(u,x), uF(T), xC;

  3. (3)

    F ˜ (T)=F(T).

Definition 2.4 (Definition 2.5) is a special form of Definition 2.2 (Definition 2.3) as T n T for all n0.

The hybrid algorithms for a fixed point of relatively nonexpansive mappings and applications have been studied by many authors; see, for example, [1, 6, 7, 18, 26, 27]. In recent years, the definition of a weak relatively nonexpansive mapping has been presented and studied by many authors [7, 18, 25, 27], but they have not given an example of a mapping which is weak relatively nonexpansive, but not relatively nonexpansive.

In the next section, we shall give an example which is a countable family of weak relatively nonexpansive mappings, but not a countable family of relatively nonexpansive mappings.

We need the following lemmas for the proof of our main results.

Lemma 2.6 [24]

Let E be a uniformly convex and smooth real Banach space and let { x n }, { y n } be two sequences of E. If ϕ( x n , y n )0 and either { x n } or { y n } is bounded, then x n y n 0.

Lemma 2.7 [23, 24, 26]

Let C be a nonempty closed convex subset of a smooth real Banach space E and xE. Then, x 0 = Π C x if and only if

x 0 y,JxJ x 0 0 for all yC.

Lemma 2.8 [23, 24, 26]

Let E be a reflexive, strictly convex and smooth real Banach space, let C be a nonempty closed convex subset of E and let xE. Then

ϕ(y, Π c x)+ϕ( Π c x,x)ϕ(y,x) for all yC.

Lemma 2.9 [27]

Let E be a uniformly convex Banach space and B r (0)={xE:xr} be a closed ball of E. Then there exists a continuous strictly increasing convex function g:[0,)[0,) with g(0)=0 such that

λ x + μ y + γ z 2 λ x 2 +μ y 2 +γ z 2 λμg ( x y )
(2.5)

for all x,y,z B r (0) and λ,μ,γ[0,1] with λ+μ+γ=1.

It is easy to prove the following result.

Lemma 2.10 Let E be a strictly convex and smooth real Banach space, let C be a closed convex subset of E, and let T be a weak relatively nonexpansive mapping from C into itself. Then F(T) is closed and convex.

3 Main results

Firstly, we give an example which is a countable family of weak relatively nonexpansive mappings, but not a countable family of relatively nonexpansive mappings in the Banach space l 2 .

Example 1 Let E= l 2 , where

It is well known that l 2 is a Hilbert space, so ( l 2 ) = l 2 . Let { x n }E be a sequence defined by

where

ξ n , k ={ 1 if  k = 1 , n + 1 , 0 if  k 1 , k n + 1 ,

for all n1.

Define a countable family of mappings T n :EE as follows:

T n (x)={ n n + 1 x n if  x = x n , x if  x x n ,

for all n0.

Conclusion 3.1 { x n } converges weakly to x 0 .

Proof For any f=( ζ 1 , ζ 2 , ζ 3 ,, ζ k ,) l 2 = ( l 2 ) , we have

f( x n x 0 )=f, x n x 0 = k = 2 ζ k ξ n , k = ζ n + 1 0,

as n. That is, { x n } converges weakly to x 0 . □

Conclusion 3.2 { x n } is not a Cauchy sequence, so, it does not converge strongly to any element of l 2 .

Proof In fact, we have x n x m = 2 for any nm. Then { x n } is not a Cauchy sequence. □

Conclusion 3.3 T n has a unique fixed point 0, that is, F( T n )={0} for all n0.

Proof The conclusion is obvious. □

Conclusion 3.4 x 0 is an asymptotic fixed point of { T n } n = 0 .

Proof Since { x n } converges weakly to x 0 and

T n x n x n = n n + 1 x n x n = 1 n + 1 x n 0

as n, so, x 0 is an asymptotic fixed point of { T n } n = 0 . □

Conclusion 3.5 { T n } n = 0 has a unique strong asymptotic fixed point 0, so, n = 0 F( T n )= F ˜ ( { T n } n = 0 ).

Proof In fact, for any strong convergent sequence { z n }E such that z n z 0 and z n T n z n 0 as n, from Conclusion 3.2, there exists a sufficiently large natural number N such that z n x m for any n,m>N. Then T z n = z n for n>N, it follows from z n T n z n 0 that 2 z n 0 and hence z n z 0 =0. □

Conclusion 3.6 { T n } n = 0 is a countable family of weak relatively nonexpansive mappings.

Proof Since E= L 2 is a Hilbert space, for any n0, we have

ϕ ( 0 , T n x ) = 0 T n x 2 = T n x 2 x 2 = x 0 2 = ϕ ( 0 , x ) , x E .

From Conclusion 3.5, we have n = 0 F( T n )= F ˜ ( { T n } n = 0 ), then { T n } n = 0 is a countable family of weak relatively nonexpansive mappings. □

Conclusion 3.7 { T n } n = 0 is not a countable family of relatively nonexpansive mappings.

Proof From Conclusions 3.3 and 3.4, we have n = 0 F( T n ) F ˆ ( { T n } n = 0 ), so, { T n } n = 0 is not a countable family of relatively nonexpansive mappings. □

Secondly, we give another example which is a weak relatively nonexpansive mapping, but not a relatively nonexpansive mapping in the Banach space l 2 .

Example 2 Let E= l 2 , where

It is well known that l 2 is a Hilbert space, so ( l 2 ) = l 2 . Let { x n }E be a sequence defined by

where

ξ n , k ={ 1 if  k = 1 , n + 1 , 0 if  k 1 , k n + 1 ,

for all n1. Define the mapping T:EE as follows

T(x)={ n n + 1 x n if  x = x n ( n 1 ) , x if  x x n ( n 1 ) .

Conclusion 3.8 { x n } converges weakly to x 0 .

Proof For any f=( ζ 1 , ζ 2 , ζ 3 ,, ζ k ,) l 2 = ( l 2 ) , we have

f( x n x 0 )=f, x n x 0 = k = 2 ζ k ξ n , k = ζ n + 1 0,

as n. That is, { x n } converges weakly to x 0 . □

Conclusion 3.9 { x n } is not a Cauchy sequence, so, it does not converge strongly to any element of l 2 .

Proof In fact, we have x n x m = 2 for any nm. Then { x n } is not a Cauchy sequence. □

Conclusion 3.10 T has a unique fixed point 0, that is, F(T)={0}.

Proof The conclusion is obvious. □

Conclusion 3.11 x 0 is an asymptotic fixed point of T.

Proof Since { x n } converges weakly to x 0 and

T x n x n = n n + 1 x n x n = 1 n + 1 x n 0

as n, then x 0 is an asymptotic fixed point of T. □

Conclusion 3.12 T has a unique strong asymptotic fixed point 0, so, F(T)= F ˜ (T).

Proof In fact, for any strong convergent sequence { z n }E such that z n z 0 and z n T z n 0 as n, from Conclusion 3.9, there exists a sufficiently large natural number N such that z n x m , for any n,m>N. Then T z n = z n for n>N, it follows from z n T z n 0 that 2 z n 0 and hence z n z 0 =0. □

Conclusion 3.13 T is a weak relatively nonexpansive mapping.

Proof Since E= L 2 is a Hilbert space, we have

ϕ ( 0 , T x ) = 0 T x 2 = T x 2 x 2 = x 0 2 = ϕ ( 0 , x ) , x E .

From Conclusion 3.12, we have F(T)= F ˜ (T), then T is a weak relatively nonexpansive mapping. □

Conclusion 3.14 T is not a relatively nonexpansive mapping.

Proof From Conclusions 3.10 and 3.11, we have F(T) F ˆ (T), so, T is not a relatively nonexpansive mapping. □

Next, we prove our convergence theorems as follows.

Theorem 3.15 Let E be a uniformly convex and uniformly smooth Banach space, let C be a nonempty closed convex subset of E, let { T n }:CC be a countable family of weak relatively nonexpansive mappings such that F= n = 1 F( T n ). For any given gauss x 0 C, define a sequence { x n } in C by the following algorithm:

{ C 0 = C , C n + 1 = { z C n : ϕ ( z , T n x n ) ϕ ( z , x n ) } , n = 0 , 1 , 2 , 3 , , x n + 1 = Π C n + 1 x 0 .
(3.1)

Then { x n } converges strongly to q= Π F x 0 .

Proof Firstly, C n is closed and convex. Since T is a closed hemi-relatively nonexpansive mapping, then F(T) C n , n=0,1,2,3, .

Since x n = Π C n x 0 and C n C n 1 , then we get

ϕ( x n , x 0 )ϕ( x n + 1 , x 0 ),for all n0.
(3.2)

Therefore, {ϕ( x n , x 0 )} is nondecreasing. On the other hand, by Lemma 2.8 we have

ϕ ( x n , x 0 ) = ϕ ( Π C n x 0 , x 0 ) ϕ ( p , x 0 ) ϕ ( p , x n ) ϕ ( p , x 0 ) ,

for all pF(T) C n and for all n0. Therefore, ϕ( x n , x 0 ) is also bounded. This together with (3.2) implies that the limit of {ϕ( x n , x 0 )} exists. Put

lim n ϕ( x n , x 0 )=d.
(3.3)

From Lemma 2.8, we have, for any positive integer m, that

ϕ ( x n + m , x n ) = ϕ ( x n + m , Π C n x 0 ) ϕ ( x n + m , x 0 ) ϕ ( Π C n x 0 , x 0 ) = ϕ ( x n + m , x 0 ) ϕ ( x n + 1 , x 0 ) ,

for all n0. This together with (3.3) implies that

lim n ϕ( x n + m , x n )=0

holds, uniformly for all m. By using Lemma 2.6, we get that

lim n x n + m x n =0

holds, uniformly for all m. Then { x n } is a Cauchy sequence. Therefore, there exists a point pC such that x n p.

Since x n + 1 = Π C n + 1 x 0 C n + 1 C n , then

ϕ( x n + 1 , T n x n )ϕ( x n + 1 , x n ),n=0,1,2,3,.

By using Lemma 2.6, we have x n T n x n 0; therefore, pF(T).

Finally, we prove that p= Π F x 0 . From Lemma 2.8, we have

ϕ(p, Π F x 0 )+ϕ( Π F x 0 , x 0 )ϕ(p, x 0 ).

On the other hand, since x n + 1 = Π C n + 1 x 0 and F C n for all n, also from Lemma 2.8, we have

ϕ( Π F x 0 , x n + 1 )+ϕ( x n + 1 , x 0 )ϕ( Π F x 0 , x 0 ).
(3.4)

By the definition of ϕ(x,y), we know that

lim n ϕ( x n + 1 , x 0 )=ϕ(p, x 0 ).
(3.5)

Combining (3.4) and (3.5), we know that ϕ(p, x 0 )=ϕ( Π F x 0 , x 0 ). Therefore, it follows from the uniqueness of Π F x 0 that p= Π F x 0 . This completes the proof. □

Theorem 3.16 Let E be a uniformly convex and uniformly smooth Banach space, let C be a nonempty closed convex subset of E, let { T n }:CC be a countable family of weak relatively nonexpansive mappings such that F= n = 1 F( T n ). For any given gauss x 0 C, define a sequence { x n } in C by the following algorithm:

{ C 0 = C , C n + 1 = { z C n : ϕ ( z , T n x n ) = ϕ ( z , x n ) } , n = 0 , 1 , 2 , 3 , , x n + 1 = Π C n + 1 x 0 .
(3.6)

Then { x n } converges strongly to q= Π F x 0 .

Proof Let { x n } be defined by (3.1). We claim that

x n + 1 { z C n : ϕ ( z , T n x n ) = ϕ ( z , x n ) } ,n=0,1,2,3,.

Therefore,

x n + 1 = Π { z C n : ϕ ( z , T n x n ) = ϕ ( z , x n ) } x 0 .

If not, there exists x n + 1 such that

ϕ( x n + 1 , T n x n )<ϕ( x n + 1 , x n ).

We define

z(t)=(1t) x n + 1 +t x 0 C,t[0,1].

Observe that z(0)= x n + 1 . Since ϕ(, T n x n ), ϕ(, x n ) are continuous, then there exists t 0 (0,1) such that

ϕ ( z ( t 0 ) , T n x n ) <ϕ ( z ( t 0 ) , x n ) ,

that is, z( t 0 ) C n + 1 . On the other hand, we have

ϕ ( z ( t 0 ) , x 0 ) = ϕ ( ( 1 t 0 ) x n + 1 + t 0 x 0 , x 0 ) = ( 1 t 0 ) x n + 1 + t 0 x 0 2 2 ( 1 t 0 ) x n + 1 + t 0 x 0 , J x 0 + x 0 2 ( 1 t 0 ) x n + 1 2 + t 0 x 0 2 2 ( 1 t 0 ) x n + 1 , J x 0 2 t 0 x 0 , J x 0 + x 0 2 = ( 1 t 0 ) x n + 1 2 + t 0 x 0 2 2 ( 1 t 0 ) x n + 1 , J x 0 2 t 0 x 0 2 + x 0 2 = ( 1 t 0 ) x n + 1 2 + ( 1 t 0 ) x 0 2 2 ( 1 t 0 ) x n + 1 , J x 0 = ( 1 t 0 ) ϕ ( x n + 1 , x 0 ) < ϕ ( x n + 1 , x 0 ) .

This is a contradiction to x n + 1 = Π C n + 1 x 0 and z( t 0 ) C n + 1 . This completes the proof. □

4 Applications

Now, we apply Theorem 3.15 to prove a strong convergence theorem concerning maximal monotone operators in a Banach space E.

Let A be a multi-valued operator from E to E with the domain D(A)={zE:Az} and range R(A)={zE:zD(A)}. An operator A is said to be monotone if

x 1 x 2 , y 1 y 2 0

for each x 1 , x 2 D(A) and y 1 A x 1 , y 2 A x 2 . A monotone operator A is said to be maximal if its graph G(A)={(x,y):yAx} is not properly contained in the graph of any other monotone operator. We know that if A is a maximal monotone operator, then A 1 0 is closed and convex. The following result is also well known.

Theorem 4.1 (Rockafellar [28])

Let E be a reflexive, strictly convex and smooth Banach space, and let A be a monotone operator from E to E . Then A is maximal if and only if R(J+rA)= E for all r>0.

Let E be a reflexive, strictly convex and smooth Banach space, and let A be a maximal monotone operator from E to E . Using Theorem 4.1 and strict convexity of E, we obtain that for every r>0 and xE, there exists a unique x r such that

JxJ x r +rA x r .

Then we can define a single valued mapping J r :ED(A) by J r = ( J + r A ) 1 J and such a J r is called the resolvent of A. We know that A 1 =F( J r ) for all r>0, see [4, 15] for more details. Using Theorem 3.15, we can consider the problem of strong convergence concerning maximal monotone operators in a Banach space. Such a problem has been also studied in [4, 5, 15, 20, 22, 24, 2936].

Theorem 4.2 Let E be a uniformly convex and uniformly smooth real Banach space, let A be a maximal monotone operators from E to E such that A 1 0, let J r be the resolvent of A, where r>0. For any given gauss x 0 C 0 =C, define a sequence { x n } in C by the following algorithm:

{ C 0 = C , C n + 1 = { z C n : ϕ ( z , J r n x n ) = ϕ ( z , x n ) } , n = 0 , 1 , 2 , 3 , , x n + 1 = Π C n + 1 x 0 ,

with the condition, r n >0, lim inf n r n >0. Then { x n } converges strongly to q= Π A 1 0 x 0 .

Proof We only need to prove that { J r n } n = 0 , is a countable family of weak relatively nonexpansive mappings.

Firstly, we have n = 0 F( J r n )= A 1 0. Secondly, from the monotonicity of A, we have

ϕ ( p , J r n w ) = p 2 2 p , J J r n w + J r n w 2 = p 2 + 2 p , J w J J r n w J w + J r n w 2 = p 2 + 2 p , J w J J r n w 2 p , J w + J r n w 2 = p 2 2 J r n w p J r n w , J w J J r n w J w 2 p , J w + J r n w 2 = p 2 2 J r n w p , J w J J r n w J w + 2 J r n w , J w J J r n w 2 p , J w + J r n w 2 p 2 + 2 J r n w , J w J J r n w 2 p , J w + J r n w 2 = p 2 2 p , J w + w 2 J r n w 2 + 2 J r n w , J w w 2 = ϕ ( p , w ) ϕ ( J r n w , w ) ϕ ( p , w )

for all n0. Thirdly, we prove the set of strong asymptotic fixed points F ˜ ( { J r n } n = 0 )= n = 0 F( J r n )= A 1 0.

We first show that F ˜ ( { J r n } n = 0 ) A 1 0. Let p F ˜ ( { J r n } n = 0 ), then there exists { z n }E such that z n p and lim n z n J r n z n =0. Since J is uniformly norm-to-norm continuous on bounded sets, we obtain

1 r n (J z n J J r n z n )0.

It follows from

1 r n (J z n J J r n z n )A J r n z n

and the monotonicity of A that

w J r n z n , w 1 r n ( J z n J J r n z n ) 0

for all wD(A) and w Aw. Letting n, we have wp, w 0 for all wD(A) and w Aw. Therefore, from the maximality of A, we obtain p A 1 0. On the other hand, we know that F( J r n )= A 1 0, F( J r n ) F ˜ ( J r n ) for all n0; therefore, A 1 0= n = 0 F( J r n )= F ˜ ( n = 0 J r n ). From above three conclusions, we have proved { J r n } n = 0 is a countable family of weak relatively nonexpansive mappings. By using Theorem 3.16, we can conclude that { x n } converges strongly to Π A 1 0 x 0 . This completes the proof. □