1 Introduction

Throughout this paper, we denote by X and X a real Banach space and the dual space of X, respectively. Let C be a nonempty closed convex subset of X.

The duality mapping J:X 2 X is defined by J(x)={ x X :x, x = x 2 , x =x}, xX. It is well known that if X is smooth, then J is single-valued, which is denoted by j. Let q>1 be a real number. The generalized duality mapping J q :X 2 X is defined by

J q (x)= { x X : x , x = x q , x = x q 1 } ,

for all xX, where , denotes the generalized duality pairing between X and X . In particular, J= J 2 is called the normalized duality mapping and J q (x)= x q 2 J 2 (x) for x0. It is well known that if X is smooth, then J q is single-valued, which is denoted by j q .

Recall that a mapping f:CC is a contraction on C if there exists a constant α(0,1) such that

f ( x ) f ( y ) αxy,x,yC.
(1.1)

A mapping W:CC is said to be nonexpansive if

W ( x ) W ( y ) xy,x,yC.
(1.2)

A mapping F:EC is said to be L-Lipschitzian if there exists a positive constant L such that

F ( x ) F ( y ) Lxy,x,yC.
(1.3)

A mapping F:EC is said to be η-strongly accretive if there exist j q (xy) J q (xy) and η>0 such that

F x F y , j q ( x y ) η x y q ,x,yC.
(1.4)

Without loss of generality, we can assume that η(0,1] and L[1,).

Recall that if C and D are nonempty subsets of a Banach space X such that C is nonempty closed convex and DC, then a mapping P:CD is sunny [1] provided P(x+t(xP(x)))=P(x) for all xC and t0, whenever x+t(xP(x))C. A mapping P:CD is called a retraction if Px=x for all xD. Furthermore, P is a sunny nonexpansive retraction from C onto D if P is a retraction from C onto D which is also sunny and nonexpansive. A subset D of C is called a sunny nonexpansive retraction of C if there exists a sunny nonexpansive retraction from C onto D.

Let { B n } be a family of mappings from a subset C of a Banach space X into itself with n = 1 F( B n ). We say that { B n } satisfies the AKTT-condition if for each bounded subset D of C,

n = 1 sup ω D B n + 1 ω B n ω<.

Proposition 1.1 (Banach [2])

Let (X,d) be a complete metric space, and let f be a contraction on X, then f has a unique fixed point.

Proposition 1.2 (Meir and Keeler [3])

Let (X,d) be a complete metric space, and let ϕ be a Meir-Keeler contraction (MKC, for short) on X, that is, for every ε>0, there exists δ>0 such that d(x,y)<ε+δ implies d(ϕ(x),ϕ(y))<ε for all x,yX. Then ϕ has a unique fixed point.

This proposition is one of generalizations of Proposition 1.1, because the contractions are Meir-Keeler contractions.

Proposition 1.3 [4]

Let C be a closed convex subset of a smooth Banach space X. Let C ˜ be a nonempty subset of C. Let Q C :C C ˜ be a retraction, and let J be the normalized duality mapping on X. Then the following are equivalent:

  1. (i)

    Q C is sunny and nonexpansive.

  2. (ii)

    Q C x Q C y 2 xy,J( Q C x Q C y), x,yC.

  3. (iii)

    x Q C x,J(y Q C x)0, xC,y C ˜ .

Variational inequality theory has emerged as a great important tool in studying a wide class of unilateral, free, obstacle, moving and equilibrium problems arising in several branches of pure and applied sciences in a unified and general framework. This field is dynamics and it is experiencing an explosive growth in both theory and applications. Several numerical methods have been developed for solving variational inequalities and related optimization problems; see [47] and the references therein.

Let C be a nonempty closed convex subset of a real Hilbert space H. Recall that the classical variational inequality is to find an x such that

F x , x x 0,xC,
(1.5)

where F:CC is a nonlinear mapping. The set of solutions of (1.5) is denoted by VI(F,C).

In 2008, Yao et al. [8] modified Mann’s iterative scheme by using the viscosity approximation method which was introduced by Moudafi [1]. More precisely, they introduced and studied the following iterative algorithm:

{ x 0 = x C , y n = β n x n + ( 1 β n ) T x n , x n + 1 = α n f ( x n ) + ( 1 α n ) y n , n 0 ,
(1.6)

where T is a nonexpansive mapping of K into itself and f is a contraction on K. They obtained a strong convergence theorem under some mild restrictions on the parameters.

Zhou [9] and Qin et al. [10] modified normal Mann’s iterative process (1.6) for k-strictly pseudo-contractions to have strong convergence in Hilbert spaces. Qin et al. [10] introduced the following iterative algorithm scheme:

{ x 1 = x K , y n = P K [ β n x n + ( 1 β n ) T x n ] , x n + 1 = α n f ( x n ) + ( 1 α n A ) y n , n 1 ,
(1.7)

where T is a k-strictly pseudo-contraction, f is a contraction and A is a strong positive linear bounded operator, P K is the metric projection. They proved, under certain appropriate assumptions on the sequences { α n } and { β n }, that { x n } defined by (1.7) converges strongly to a fixed point of the k-strictly pseudo-contraction, which solves some variational inequality.

Very recently, Song et al. [11] introduced the following iteration process:

{ x 1 = x C , y n = P C [ β n x n + ( 1 β n ) i = 1 μ i ( n ) T i x n ] , x n + 1 = α n ϕ ( x n ) + γ n x n + ( ( 1 γ n ) I α n F ) y n , n 1 ,
(1.8)

where T i is a k i -strictly pseudo-contraction, ϕ is an MKC contraction and F:CC is an L-Lipschitzian and η-strongly monotone mapping in a Hilbert space, P C is the metric projection. Under certain appropriate assumptions on the sequences { α n }, { β n }, { γ n } and { μ i n }, the sequence { x n } defined by (1.8) converges strongly to a common fixed point of an infinite family of k i -strictly pseudo-contractions, which solves some variational inequality.

Question 1 Can the space in Song [11] be extended from a Hilbert space to a q-uniformly smooth Banach space?

Question 2 Can the projection P C in Song [11] be changed to the sunny nonexpansive retraction Q C and be put to other place of the iteration process?

Question 3 Can we extend the iterative scheme of algorithm (1.8) to a more general iterative scheme?

Question 4 Can we remove the very strict condition C+CC which is necessary in Lemma 3.1 and Theorem 3.2 of Song [11]?

The purpose of this paper is to give affirmative answers to these questions mentioned above. In this paper we study a new general iterative scheme as follows:

{ x 1 = x C , y n = β n x n + ( 1 β n ) i = 1 μ i ( n ) T i x n , x n + 1 = Q C [ α n γ ϕ ( x n ) + γ n ( α I + ( 1 α ) i = 1 μ i ( n ) T i ) x n + ( ( 1 γ n ) I α n F ) y n ] , n 1 ,
(1.9)

where T i is a λ i -strictly pseudo-contraction, ϕ is an MKC contraction, Q C is the sunny nonexpansive retraction and F:XC is an L-Lipschitzian and η-strongly accretive mapping in a q-uniformly smooth Banach space. Under some suitable assumptions on the sequences { α n }, { β n }, { γ n } and { μ i ( n ) }, the sequence { x n } defined by (1.9) converges strongly to a common fixed point of an infinite family of λ i -strictly pseudo-contractions, which solves some variational inequality.

2 Preliminaries

In this section, we first recall some notations. T is said to be a λ-strict pseudo-contraction in the terminology of Browder and Petryshyn [12] if there exists a constant λ[0,1) such that

T x T y , j q ( x y ) x y q λ ( I T ) x ( I T ) y q
(2.1)

for every x,yC and for some j q (xy) J q (xy). It is clear that (2.1) is equivalent to the following:

( I T ) x ( I T ) y , j q ( x y ) λ ( I T ) x ( I T ) y q .
(2.2)

A Banach space X is said to be strictly convex if whenever x and y are not collinear, then x+y<x+y.

Then the modulus of convexity of X is defined by

δ X (ϵ)=inf { 1 1 2 x + y : x , y 1 , x y ϵ }

for all ϵ[0,2]. X is said to be uniformly convex if δ X (0)=0 and δ X (ϵ)>0 for all 0<ϵ2, and if δ X (ϵ)c ϵ p with p2, then X is said to be p-uniformly convex. A Hilbert space H is 2-uniformly convex, while L p is max{p,2}-uniformly convex for every p>1. Let ρ X :[0,)[0,) be the modulus of smoothness of X defined by

ρ X (t)=sup { 1 2 ( x + y + x y ) 1 : x S ( X ) , y t } .

A Banach space X is said to be uniformly smooth if ρ X ( t ) t 0 as t0. A Banach space X is said to be q-uniformly smooth if there exists a fixed constant c>0 such that ρ X (t)c t q with q>1. A typical example of uniformly smooth Banach spaces is L p , where p>1. More precisely, L p is min{p,2}-uniformly smooth for every p>1.

The norm of a Banach space X is said to be Gâteaux differentiable if the limit

lim t 0 x + t y x t
(2.3)

exists for all x, y on the unit sphere S(X)={xX:x=1}. If, for each yS(X), the limit (2.3) is uniformly attained for xS(X), then the norm of X is said to be uniformly Gâteaux differentiable. The norm of X is said to be Fréchet differentiable if, for each xS(X), the limit (2.3) is attained uniformly for yS(X).

In order to prove our main results, we need the following lemmas.

Lemma 2.1 [13]

Let ϕ be an MKC on a convex subset C of a Banach space X. Then, for each ε>0, there exists r(0,1) such that

xyε implies ϕxϕyrxy,x,yC.

Lemma 2.2 [14]

Let X be a real q-uniformly smooth Banach space, then there exists a constant C q >0 such that

x + y q x q +q y , J q ( x ) + C q y q for all x,yX.

Lemma 2.3 [15]

Let { α n } be a sequence of nonnegative numbers satisfying the property

α n + 1 (1 γ n ) α n + b n + γ n c n ,n0,

where { γ n }, { b n }, { c n } satisfy the restrictions:

  1. (i)

    lim sup n γ n =0, n = 0 γ n =;

  2. (ii)

    b n 0, n = 1 b n <;

  3. (iii)

    lim sup n c n 0. Then lim n α n =0.

Lemma 2.4 [16]

Let C be a nonempty convex subset of a real q-uniformly smooth Banach space X, and let T:CC be a λ-strict pseudo-contraction. For α(0,1), we define T α x=(1α)x+αTx. Then, as α(0,μ], μ=min{1, ( q λ C q ) 1 q }, T α :CC is nonexpansive such that F( T α )=F(T).

Lemma 2.5 [17]

Let q>1, then the following inequality holds:

ab 1 q a q + q 1 q b q q 1

for arbitrary positive real numbers a, b.

Lemma 2.6 Let F be an L-Lipschitzian and η-strongly accretive operator on a nonempty closed convex subset C of a real q-uniformly smooth Banach space X with 0<ηq1 and 0<t< ( q η C q L q ) 1 q 1 . Then G=(ItF):CX is a contraction with contraction coefficient τ t =1 1 q (qtη C q L q t q ).

Proof From the definition of η-strongly accretive and L-Lipschitzian operator, we have

G x G y q = x y t ( F x F y ) q x y q q t F x F y , j q ( x y ) + C q t q F x F y q x y q q t η x y q + C q L q t q x y q = [ 1 ( q t η C q L q t q ) ] x y q .

Therefore, we have

G x G y [ 1 ( q t η C q L q t q ) ] 1 q x y [ 1 1 q ( q t η C q L q t q ) ] x y

for all x,yC. From 0<ηq1 and 0<t< ( q η C q L q ) 1 q 1 , we have 0<1 1 q (qtη C q L q t q )<1 and

GxGy τ t xy,

where τ t =1 1 q (qtη C q L q t q )(0,1). Hence, G is a contraction with contraction coefficient τ t . This completes the proof. □

Lemma 2.7 ([18], Demiclosedness principle)

Let C be a nonempty closed convex subset of a reflexive Banach space X which satisfies Opial’s condition, and suppose that T:CX is nonexpansive. Then the mapping IT is demiclosed at zero, that is, x n x, x n T x n 0 implies x=Tx.

Lemma 2.8 Let C be a closed convex subset of a smooth Banach space X. Let C ˜ be a nonempty subset of C. Let Q C :C C ˜ be a retraction, and let j, j q be the normalized duality mapping and generalized duality mapping on X, respectively. Then the following are equivalent:

  1. (i)

    Q C is sunny and nonexpansive.

  2. (ii)

    Q C x Q C y 2 xy,j( Q C x Q C y), x,yC.

  3. (iii)

    x Q C x,j(y Q C x)0, xC,y C ˜ .

  4. (iv)

    x Q C x, j q (y Q C x)0, xC,y C ˜ .

Proof From Proposition 1.3, we have (i) ⇔ (ii) ⇔ (iii). We need only to prove (iii) ⇔ (iv).

Indeed, if y Q C x0, it follows from the fact j q (x)= x q 2 j(x) that x Q C x,j(y Q C x)0x Q C x, j q (y Q C x)0, xC,y C ˜ .

If y Q C x=0, then x Q C x,j(y Q C x)=x Q C x, j q (y Q C x)=0, xC,y C ˜ . This completes the proof. □

Lemma 2.9 [19]

Suppose that { B n } satisfies the AKTT-condition, then for each bounded subset D of C:

  1. (i)

    { B n } converges strongly to some point in C for each xC;

  2. (ii)

    Furthermore, if the mapping B:CC is defined by Bx= lim n B n x for all xD, then lim n sup ω D Bω B n ω=0.

Lemma 2.10 Let C be a closed convex subset of a reflexive Banach space X which admits a weakly sequentially continuous duality mapping j q from X to X . Let S:CC be a nonexpansive mapping with F(S) and ϕ be an MKC on C. Suppose that F:CX is an η-strongly accretive and L-Lipschitzian mapping with coefficient and η>γ>0. Then the sequence { x t } defined by x t = Q C [tγϕ( x t )+(1tF)S x t ] converges strongly as t0 to a fixed point x ˜ of S, which solves the variational inequality

( F γ ϕ ) x ˜ , j q ( x ˜ z ) 0,zF(S).
(2.4)

Proof The definition of { x t } is a good definition. Indeed, from the definition of MKC, we can see that an MKC is also a nonexpansive mapping. Consider a mapping L t on C defined by

L t x= Q C [ t γ ϕ ( x ) + ( I t F ) S x ] ,xC.

It is easy to see that L t is a contraction when 0<t< ( q ( η γ ) C q L q ) 1 q 1 . Indeed, by Lemmas 2.1 and 2.5, we have

L t x L t y = Q C [ t γ ϕ ( x ) + ( I t F ) S x ] Q C [ t γ ϕ ( y ) + ( I t F ) S y ] t γ ϕ ( x ) + ( I t F ) S x t γ ϕ ( y ) ( I t F ) S y t γ ϕ ( x ) ϕ ( y ) + ( I t F ) S x ( I t F ) S y t γ ϕ ( x ) ϕ ( y ) + τ t S x S y t γ x y + τ t x y θ t x y ,

where θ t =tγ+ τ t (0,1). Hence L t has a unique fixed point, denoted by x t , which uniquely solves the fixed point equation

x t = Q C [ t γ ϕ ( x t ) + ( I t F ) S x t ] .
(2.5)

Next we show the uniqueness of a solution of the variational inequality (2.4). Suppose that x ˜ F(S) and x ˆ F(S) are solutions to (2.4), then, without loss of generality, we may assume that there is a number ε such that x ˆ x ˜ ε. Then, by Lemma 2.1, there is a number r(0,1) such that ϕ x ˆ ϕ x ˜ r x ˆ x ˜ . From (2.4) we have

( F γ ϕ ) x ˜ , j q ( x ˜ x ˆ ) 0,
(2.6)
( F γ ϕ ) x ˆ , j q ( x ˆ x ˜ ) 0.
(2.7)

Adding up (2.6) and (2.7), we obtain

( F γ ϕ ) x ˆ ( F γ ϕ ) x ˜ , j q ( x ˆ x ˜ ) 0.
(2.8)

Meanwhile, we notice that

( F γ ϕ ) x ˆ ( F γ ϕ ) x ˜ , j q ( x ˆ x ˜ ) = F x ˆ F x ˜ , j q ( x ˆ x ˜ ) γ ϕ ( x ˆ ) ϕ ( x ˜ ) , j q ( x ˆ x ˜ ) η x ˆ x ˜ q γ ϕ ( x ˆ ) ϕ ( x ˜ ) x ˆ x ˜ q 1 η x ˆ x ˜ q γ r x ˆ x ˜ x ˆ x ˜ q 1 η x ˆ x ˜ q γ r x ˆ x ˜ q = ( η γ r ) x ˆ x ˜ q ( η γ r ) ε > 0 .

Thus x ˆ = x ˜ and the uniqueness is proved. Below, we use x ˜ to denote the unique solution of (2.3).

First, we prove that { x t } is bounded.

Assume that 0<t< η γ L 2 for zF(S), fixed ε for each t.

Case 1. ( x t z< ε ). In this case, we can see easily that { x t } is bounded.

Case 2. ( x t z ε ). In this case, by Lemma 2.1, there is a number r (0,1) such that ϕ( x t )ϕ(p)< r x t p, then we have

x t z = Q C [ t γ ϕ ( x t ) + ( I t F ) S x t ] z = t γ ϕ ( x t ) + ( I t F ) S x t z = t ( γ ϕ ( x t ) F z ) + ( I t F ) S x t ( I t F ) z t γ ϕ ( x t ) p + τ t x t z t γ ϕ ( x t ) γ ϕ ( z ) + t γ ϕ ( z ) F z + τ t x t z t γ r x t z + t ϕ ( z ) F z + τ t x t z ,

which implies x t z 2 γ ϕ ( z ) z η γ . Thus { x t } is bounded.

Then, we prove that x t x ˜ ( x ˜ F(S)) as t0.

Since X is reflexive and { x t } is bounded, there exists a subsequence { x t n } of { x t } such that x t n x . Setting y t =tγϕ( x t )+(ItF)S x t , we obtain x t = Q C y t .

We claim x t n x 0.

It follows from Lemma 2.8 that

y t Q C y t , j q ( x Q C y t ) 0,
(2.9)

then we have

x t m x q = Q C y t m y t m , j q ( x t m x ) + y t m x , j q ( x t m x ) y t m x , j q ( x t m x ) = ( I t m F ) S x t m ( I t m F ) x , j q ( x t m x ) + t m γ ϕ x t m F x , j q ( x t m x ) τ m x t m x q + t m γ ϕ x t m F x , j q ( x t m x ) ,

which implies that

x t m x q t m 1 τ m γ ϕ x t m F x , j q ( x t m x ) .
(2.10)

Since t m 0 as m, by (2.10) we obtain that x t m x . Hence, we have x t n x .

Now, we prove that x solves the variational inequality (2.4).

Since

x t = Q C y t = Q C y t y t +tγϕ( x t )+(ItF)S x t ,
(2.11)

we get that

(Fγϕ) x t = 1 t ( Q C y t y t ) 1 t (IS) x t +(F x t FS x t ).
(2.12)

Notice that

( I S ) x t ( I S ) z , j q ( x t z ) = x t z , j q ( x t z ) S x t S z , j q ( x t z ) x t z q S x t S z x t z q 1 x t z q x t z q = 0 .

Then, for zF(S),

( F γ ϕ ) x t , j q ( x t z ) = 1 t Q C y t y t , j q ( x t z ) 1 t ( I S ) x t , j q ( x t z ) + F x t F S x t , j q ( x t z ) = 1 t Q C y t y t , j q ( x t z ) 1 t ( I S ) x t ( I S ) z , j q ( x t z ) + F x t F S x t , j q ( x t z ) F x t F ( S x t ) , j q ( x t z ) M x t S x t ,
(2.13)

where M= sup n 0 {L x t z q 1 }<. Notice

x t S x t =t [ γ ϕ ( x t ) F S x t ] .

Thus, we have

x t S x t 0as t0.

Now replacing t in (2.13) with t n and letting n, notice that (IS) x t n (IS) x =0 for x F(S), we obtain (Fγϕ) x , j q ( x z)0, i.e., x F(S) is a solution of (2.4). Hence x ˜ = x by uniqueness. Thus, we have shown that every cluster point of { x t } (at t0) equals x ˜ , therefore x t x ˜ as t0. □

Lemma 2.11 Let X be a q-uniformly smooth Banach space, and let C be a nonempty convex subset of X. Assume that T i :CC is a countable family of λ i -strict pseudo-contractions for some 0 λ i <1 and inf{ λ i :iN}>0 such that F:= i = 1 F( T i ). Assume that { μ i } is a positive sequence such that i = 1 μ i =1. Then i = 1 μ i T i :CC is a λ-strict pseudo-contraction with λ=inf{ λ i :iN} and F( i = 1 μ i T i )= i = 1 F( T i ).

Proof Let H n x= μ 1 T 1 x+ μ 2 T 2 x++ μ n T n x, where i = 1 μ i =1. Then H n :CX is a λ-strict pseudo-contraction with λ=min{ λ i :1in}.

Step 1. We firstly prove the case of n=2.

( I H 2 ) x ( I H 2 ) y , j q ( x y ) = μ 1 ( I T 1 ) x + μ 2 ( I T 2 ) x μ 1 ( I T 1 ) y μ 2 ( I T 2 ) y , j q ( x y ) = μ 1 ( I T 1 ) x ( I T 1 ) y , j q ( x y ) + μ 2 ( I T 2 ) x ( I T 2 ) y , j q ( x y ) μ 1 λ 1 ( I T 1 ) x ( I T 1 ) y q + μ 2 λ 2 ( I T 2 ) x ( I T 2 ) y q λ [ μ 1 ( I T 1 ) x ( I T 1 ) y q + μ 2 ( I T 2 ) x ( I T 2 ) y q ] = λ ( I H 2 ) x ( I H 2 ) y q ,

where λ=min{ λ i :i=1,2}, which shows that H 2 :CC is a λ-strict pseudo-contraction.

Using the same means, our proof method can easily carry over to the general finite case.

Step 2. We prove the infinite case. From the definition of λ-strict pseudo-contraction, we have

( I T n ) x ( I T n ) y , j q ( x y ) λ ( I T n ) x ( I T n ) y q ,
(2.14)

then we obtain

( I T n ) x ( I T n ) y ( 1 λ ) 1 q 1 xy.
(2.15)

Taking pF( T n ), it follows from (2.15) that

( I T n ) x = ( I T n ) x ( I T n ) p ( 1 λ ) 1 q 1 xp.
(2.16)

Thus, for xX, if i = 1 F( T i ) with μ i >0 and i = 1 μ i =1, then i = 1 μ i T i strongly converges.

Let

Hx= i = 1 μ i T i x,

then we obtain

Hx= i = 1 μ i T i x= lim n i = 1 n μ i T i x= lim n 1 i = 1 n μ i i = 1 n μ i T i x.

Therefore

( I H ) x ( I H ) y , j q ( x y ) = lim n ( I 1 i = 1 n μ i i = 1 n μ i T i ) x + ( I 1 i = 1 n μ i i = 1 n μ i T i ) y , j q ( x y ) = lim n 1 i = 1 n μ i i = 1 n μ i ( I T i ) x ( I T i ) y , j q ( x y ) lim n 1 i = 1 n μ i i = 1 n μ i λ ( I T i ) x ( I T i ) y q λ lim n ( I 1 i = 1 n μ i i = 1 n μ i T i ) x ( I 1 i = 1 n μ i i = 1 n μ i T i ) y q = λ ( I H ) x ( I H ) y q .

Thus, H is a λ-strict pseudo-contraction.

Step 3. We prove F( i = 1 μ i T i )= i = 1 F( T i ).

Let x= i = 1 μ i T i x, then, for p i = 1 F( T i ), we obtain

x p q = x p , j q ( x p ) = i = 1 μ i T i x p , j q ( x p ) = i = 1 μ i T i x p , j q ( x p ) x p q λ i = 1 μ i x T i x q ,

where λ=inf{ λ i :iN}. Thus, we obtain x= T i x, it follows that x i = 1 F( T i ). □

3 Main results

Lemma 3.1 Let C be a nonempty closed convex subset of a q-uniformly smooth Banach space X. Let Q C be the sunny nonexpansive retraction from X onto C, and let ϕ be an MKC on C. Let F:CX be η-strongly accretive and L-Lipschitzian with 0<γ<η, and let T i :CC be a λ i -strictly pseudo-contractive non-self-mapping such that F:= i = 1 F( T i ). Assume λ=inf{ λ i :iN}>0. Let { x n } be a sequence of C generated by (1.9). We assume that the following parameters are satisfied:

  1. (i)

    0< α n <1, i = 1 α n =, lim n α n =0, i = 1 | α n + 1 α n |<;

  2. (ii)

    0<1 ( q λ C q ) 1 q β n <1, i = 1 | β n + 1 β n |<;

  3. (iii)

    i = 1 μ i ( n ) =1, n = 1 i = 1 | μ i ( n + 1 ) μ i ( n ) |<;

  4. (iv)

    0< γ n <a<1, i = 1 | γ n + 1 γ n |<, α n + 1 β n L+α γ n + 1 + β n > α n + 1 L+ β n γ n + 1 ;

  5. (v)

    1bα<1, b:=min{1, ( q λ C q ) 1 q }.

Then lim n x n + 1 x n =0.

Proof Let B n = i = 1 μ i ( n ) T i , by Lemma 2.11 we obtain that for each n0, B n is a λ-strict pseudo-contraction on C and F( B n )= i = 1 F( T i ). Further, we can get that

n = 1 B n + 1 x B n x= n = 1 i = 1 | μ i ( n + 1 ) μ i ( n ) | T i x<,

thus { B n } n = 1 satisfies the AKTT-condition. Let W n =αI+(1α) i = 1 μ i ( n ) T i , where α[1b,1), b:=min{1, ( q λ C q ) 1 q }. From Lemma 2.4 and Lemma 2.11 we have that W n is a nonexpansive mapping and F( W n )= i = 1 F( T i )=F, then the iterative algorithm (1.9) can be rewritten as follows:

{ x 1 = x C , y n = β n x n + ( 1 β n ) B n x n , x n + 1 = Q C [ α n γ ϕ ( x n ) + γ n W n x n + ( ( 1 γ n ) I α n F ) y n ] , n 1 .
(3.1)

We divide the rest of the proof into two parts.

Step 1. We will prove that the sequence { x n } is bounded.

Letting

L n x= β n x+(1 β n ) B n x,

from Lemma 2.4 and condition (ii), we get that L n :CC is nonexpansive. Taking a point p i = 1 F( T i ), we have L n p=p and pF( W n ). Therefore, we obtain

y n p= L n x n p x n p.

From the definition of MKC and Lemma 2.1, for any ε>0, there is a number r ε (0,1), if x n p<ε, then ϕ( x n )ϕ(p)<ε; if x n pε, then ϕ( x n )ϕ(p) r ε x n p. It follows from (3.1) and Lemma 2.5 that

x n + 1 p = Q C [ α n γ ϕ ( x n ) + γ n W n x n + ( ( 1 γ n ) I α n F ) y n ] p α n γ ϕ ( x n ) + γ n W n x n + ( ( 1 γ n ) I α n F ) y n p = α n ( γ ϕ ( x n ) F p ) + γ n ( W n x n p ) + [ ( 1 γ n ) I α n F ] y n [ ( 1 γ n ) I α n F ] p [ 1 γ n ( α n η C q L q α n q q ( 1 γ n ) q 1 ) ] x n p + γ n x n p + α n γ ϕ ( x n ) F p [ 1 ( α n η C q L q α n q q ( 1 γ n ) q 1 ) ] x n p + α n γ max { r x n p , ε } + α n γ ϕ ( p ) F p = max { [ 1 ( α n η C q L q α n q q ( 1 γ n ) q 1 ) ] x n p + α n γ r x n p + α n γ ϕ ( p ) F p , [ 1 ( α n η C q L q α n q q ( 1 γ n ) q 1 ) ] x n p + α n γ ε + α n γ ϕ ( p ) F p } = max { [ 1 ( α n η C q L q α n q q ( 1 γ n ) q 1 α n γ r ) ] x n p + α n γ ϕ ( p ) F p , [ 1 ( α n η C q L q α n q q ( 1 γ n ) q 1 ) ] x n p + α n γ ε + α n γ ϕ ( p ) F p } .

By induction, we obtain

x n + 1 p max { [ 1 α n ( η C q L q α n q 1 q ( 1 γ n ) q 1 γ r ) ] x n p + α n ( η C q L q α n q 1 q ( 1 γ n ) q 1 γ r ) γ ϕ ( p ) F p η C q L q α n q 1 q ( 1 γ n ) q 1 γ r , [ 1 α n ( η C q L q α n q 1 q ( 1 γ n ) q 1 ) ] x n p + α n ( η C q L q α n q 1 q ( 1 γ n ) q 1 ) γ ε + γ ϕ ( p ) F p η C q L q α n q 1 q ( 1 γ n ) q 1 } .

Hence, we obtain

x n pmax { x 0 p , M } ,n0,

where M is a constant such that

M=max { sup n 0 { γ ϕ ( p ) F p η C q L q α n q 1 q ( 1 γ n ) q 1 γ r } , sup { γ ε + γ ϕ ( p ) F p η C q L q α n q 1 q ( 1 γ n ) q 1 } } ,

which implies that { x n } is bounded, so are { y n } and { L n x n }.

Step 2. We claim that x n + 1 x n 0 as n.

From (3.1) we have

x n + 2 x n + 1 = Q C [ α n + 1 γ ϕ ( x n + 1 ) + γ n + 1 W n + 1 x n + 1 + ( ( 1 γ n + 1 ) I α n + 1 F ) L n + 1 x n + 1 ] Q C [ α n γ ϕ ( x n ) + γ n W n x n + ( ( 1 γ n ) I α n F ) L n x n ] α n + 1 γ ϕ ( x n + 1 ) + γ n + 1 W n + 1 x n + 1 + ( ( 1 γ n + 1 ) I α n + 1 F ) L n + 1 x n + 1 α n γ ϕ ( x n ) γ n W n x n ( ( 1 γ n ) I α n F ) L n x n = ( ( 1 γ n + 1 ) I α n + 1 F ) L n + 1 x n + 1 ( ( 1 γ n ) I α n F ) L n x n + ( α n + 1 γ ϕ ( x n + 1 ) α n γ ϕ ( x n ) ) + ( γ n + 1 W n + 1 x n + 1 γ n W n x n ) ( ( 1 γ n + 1 ) I α n + 1 F ) L n + 1 x n + 1 ( ( 1 γ n + 1 ) I α n + 1 F ) L n + 1 x n + ( ( 1 γ n + 1 ) I α n + 1 F ) L n + 1 x n ( ( 1 γ n ) I α n F ) L n x n + α n + 1 γ ϕ ( x n + 1 ) α n γ ϕ ( x n ) + γ n + 1 W n + 1 x n + 1 γ n W n x n ( 1 γ n + 1 α n + 1 ( η C q L q α n + 1 q 1 q ( 1 γ n ) q 1 ) ) x n + 1 x n + ( 1 γ n + 1 ) L n + 1 x n L n x n + | γ n + 1 γ n | L n x n + α n + 1 F L n + 1 x n F L n x n + | α n + 1 α n | F L n x n + α n + 1 γ ϕ ( x n + 1 ) α n + 1 γ ϕ ( x n ) + α n + 1 γ ϕ ( x n ) α n γ ϕ ( x n ) + γ n + 1 W n + 1 x n + 1 γ n + 1 W n + 1 x n + γ n + 1 W n + 1 x n γ n W n x n ( 1 γ n + 1 α n + 1 ( η C q L q α n + 1 q 1 q ( 1 γ n ) q 1 ) ) x n + 1 x n + ( 1 γ n + 1 ) L n + 1 x n L n x n + | γ n + 1 γ n | L n x n + α n + 1 F L n + 1 x n F L n x n + | α n + 1 α n | F L n x n + α n + 1 γ x n + 1 x n + | α n + 1 α n | γ ϕ ( x n ) + γ n + 1 x n + 1 x n + γ n + 1 W n + 1 x n W n x n + | γ n + 1 γ n | W n x n ( 1 α n + 1 ( η C q L q α n + 1 q 1 q ( 1 γ n ) q 1 γ ) ) x n + 1 x n + ( 1 γ n + 1 ) L n + 1 x n L n x n + γ n + 1 W n + 1 x n W n x n + | γ n + 1 γ n | ( L n x n + W n x n ) + α n + 1 L L n + 1 x n L n x n + | α n + 1 α n | ( F L n x n + γ ϕ ( x n ) ) = ( 1 α n + 1 ( η C q L q α n + 1 q 1 q ( 1 γ n ) q 1 γ ) ) x n + 1 x n + | α n + 1 α n | ( F L n x n + γ ϕ ( x n ) ) + | γ n + 1 γ n | ( L n x n + W n x n ) + ( 1 + α n + 1 L γ n + 1 ) L n + 1 x n L n x n + γ n + 1 W n + 1 x n W n x n .
(3.2)

Next, we estimate L n + 1 x n L n x n and W n + 1 x n W n x n . Notice that

L n + 1 x n L n x n = [ β n + 1 x n + ( 1 β n + 1 ) B n + 1 x n ] [ β n x n + ( 1 β n ) B n x n ] L n + 1 x n L n x n | β n + 1 β n | x n B n + 1 x n + ( 1 β n ) B n + 1 x n B n x n ,
(3.3)
W n + 1 x n W n x n = α x n + B n + 1 x n α x n + ( 1 α ) B n x n W n + 1 x n W n x n = ( 1 α ) B n + 1 x n B n x n .
(3.4)

Substituting (3.3) and (3.4) into (3.2) and using condition (iv), we have

x n + 2 x n + 1 ( 1 α n + 1 ( η C q L q α n + 1 q 1 q ( 1 γ n ) q 1 γ ) ) x n + 1 x n + M 1 ( | α n + 1 α n | + ( 1 + α n + 1 L γ n + 1 ) | β n + 1 β n | + | γ n + 1 γ n | ) + [ 1 ( α n + 1 β n L + α γ n + 1 + β n α n + 1 L β n γ n + 1 ) ] B n + 1 x n B n x n ( 1 α n + 1 ( η C q L q α n + 1 q 1 q ( 1 γ n ) q 1 γ ) ) x n + 1 x n + M 1 ( | α n + 1 α n | + ( 1 + α n + 1 L γ n + 1 ) | β n + 1 β n | + | γ n + 1 γ n | ) + B n + 1 x n B n x n ,
(3.5)

where M 1 is an appropriate constant such that

M 1 x n B n + 1 x n +F L n x n + L n x n +γ ϕ ( x n ) + W n x n for all n.

Since { B n } satisfies the AKTT-condition, we get that

i = 1 B n + 1 x n B n x n <.

Noticing conditions (i), (iii) and (iv) and applying Lemma 2.3 to (3.5), we obtain

lim n x n + 1 x n =0.
(3.6)

This completes the proof. □

Lemma 3.2 Let C be a nonempty closed convex subset of a q-uniformly smooth Banach space X. Let Q C be the sunny nonexpansive retraction from X onto C, and let ϕ be an MKC on C. Let F:CX be η-strongly accretive and L-Lipschitzian with 0<γ<η, and let T i :CC be a λ i -strictly pseudo-contractive non-self-mapping such that F:= i = 1 F( T i ). Assume λ=inf{ λ i :iN}>0. Let { x n } be a sequence of C generated by (1.9). We assume that the parameters { α n }, { β n }, { μ i ( n ) } and { γ n } satisfy the conditions (i), (ii), (iii), (iv), (v) in Lemma  3.1 and (vi) lim n β n =α. Then { x n } converges strongly to x ˜ F, which solves the following variational inequality:

γ ϕ ( x ˜ ) F x ˜ , j q ( p x ˜ ) 0,p i = 1 F( T i ).

Proof The proof of the lemma will be split into three parts.

Step 1. We will prove that lim n T x n x n =0, where T:CC is defined by Tx=αx+(1α)Bx and Bx= lim n B n x. From (3.1) we have

L n x n x n + 1 = Q C [ α n γ ϕ ( x n ) + γ n W n x n + ( ( 1 γ n ) I α n F ) L n x n ] L n x n α n γ ϕ ( x n ) + γ n W n x n + ( ( 1 γ n ) I α n F ) L n x n L n x n = α n γ ϕ ( x n ) α n F L n x n + γ n W n x n γ n L n x n α n γ ϕ ( x n ) F L n x n + γ n W n x n L n x n = α n γ ϕ ( x n ) F L n x n + γ n α x n + ( 1 α ) B n x n β n x n ( 1 β n ) B n x n = α n γ ϕ ( x n ) F L n x n + γ n | β n α | x n B n x n .

Using conditions (i) and (vi), we obtain

lim n L n x n x n + 1 =0.
(3.7)

Since { B n } n = 1 satisfies the AKTT-condition, from Lemma 2.9 we can obtain lim n B n xBx=0. Furthermore, notice that

B x B y , j q ( x y ) = lim n B n x B n y , j q ( x y ) lim n [ B n x B n y q λ ( I B n ) x ( I B n ) y q ] = B x B y q λ ( I B ) x ( I B ) y q ,

therefore, we deduce that B:CC is a λ-strict pseudo-contraction. Applying Lemma 2.4, we obtain that T is nonexpansive with F(T)=F(B). Notice that

T x n x n L n x n T x n + L n x n x n + 1 + x n + 1 x n = β n x n + ( 1 β n ) B n x n α x n ( 1 α ) B x n + L n x n x n + 1 + x n + 1 x n = ( β n α ) ( x n B n x n ) + ( 1 α ) ( B n x n B x n ) + L n x n x n + 1 + x n + 1 x n | β n α | x n B n x n + ( 1 α ) B n x n B x n + L n x n x n + 1 + x n + 1 x n .

Using (3.6), (3.7) and (vi), we obtain

lim n T x n x n =0.
(3.8)

Step 2. We will show that

lim sup n γ ϕ ( x ˜ ) F x ˜ , j q ( x n x ˜ ) 0,
(3.9)

where x ˜ = lim t 0 x t with x t being the fixed point of the contraction

x Q C [ t γ ϕ ( x ) + ( 1 t F ) T x ] .

From the above, we know that x ˜ F=F(T), then we take a subsequence { x n k } of { x n } and assume that x n k ω, where ωF(T). Since the Banach space X has a weakly sequentially continuous generalized duality mapping j q :X X , by using Lemma 2.7, 2.10 and (3.8), we have

lim sup n γ ϕ ( x ˜ ) F x ˜ , j q ( x n x ˜ ) = lim sup k γ ϕ ( x ˜ ) F x ˜ , j q ( x n k x ˜ ) = γ ϕ ( x ˜ ) F x ˜ , j q ( ω x ˜ ) 0 .

Step 3. We will prove that lim n x n x ˜ =0.

By contradiction, there is a number ε 0 such that

lim sup n x n x ˜ ε 0 .

First, let

z n = α n γϕ( x n )+ γ n W n x n + ( ( 1 γ n ) I α n F ) y n .
(3.10)

Now, we will obtain the contradiction from two cases.

Case 1. Fix ε 1 ( ε 1 < ε 0 ), if for some n>NN such that x n x ˜ ε 0 ε 1 , and for the other n>NN such that x n x ˜ < ε 0 ε 1 .

Let

M n = q γ ϕ ( x ˜ ) F x ˜ , j q ( x n + 1 x ˜ ) ( ε 0 ε 1 ) q .

From (3.9) we know lim sup n M n 0, thus there are two numbers h and N. When n>N, we have M n h, where h=min{η C q L q α n 0 q 1 q ( 1 γ n 0 ) q 1 γ}. We extract a number n 0 >N satisfying x n 0 x ˜ < ε 0 ε 1 , then from Lemma 2.5 and (3.10), we have

x n 0 + 1 x ˜ q = Q C z n 0 z n 0 , j q ( x n 0 + 1 x ˜ ) + z n 0 x ˜ , j q ( x n 0 + 1 x ˜ ) z n 0 x ˜ , j q ( x n 0 + 1 x ˜ ) = α n 0 γ ϕ ( x n 0 ) + γ n 0 W n 0 x n 0 + ( ( 1 γ n 0 ) I α n 0 F ) y n 0 x ˜ , j q ( x n 0 + 1 x ˜ ) = [ ( 1 γ n 0 ) I α n 0 F ] y n 0 [ ( 1 γ n 0 ) I α n 0 F ] x ˜ + α n 0 [ γ ϕ ( x n 0 ) F x ˜ ] + γ n 0 ( W n 0 x n 0 x ˜ ) , j q ( x n 0 + 1 x ˜ ) = [ ( 1 γ n 0 ) I α n 0 F ] y n 0 [ ( 1 γ n 0 ) I α n 0 F ] x ˜ , j q ( x n 0 + 1 x ˜ ) + α n 0 [ γ ϕ ( x n 0 ) γ ϕ ( x ˜ ) ] , j q ( x n 0 + 1 x ˜ ) + α n 0 γ ϕ ( x ˜ ) F x ˜ , j q ( x n 0 + 1 x ˜ ) + γ n 0 W n 0 x n 0 x ˜ , j q ( x n 0 + 1 x ˜ ) [ ( 1 γ n 0 ) I α n 0 F ] y n 0 [ ( 1 γ n 0 ) I α n 0 F ] x ˜ x n 0 + 1 x ˜ q 1 + α n 0 γ x n 0 x ˜ x n 0 + 1 x ˜ q 1 + α n 0 γ ϕ ( x ˜ ) F x ˜ , j q ( x n 0 + 1 x ˜ ) + γ n 0 x n 0 x ˜ x n 0 + 1 x ˜ q 1 [ 1 γ n 0 α n 0 ( η C q L q α n 0 q 1 q ( 1 γ n 0 ) q 1 ) ] y n 0 x ˜ x n 0 + 1 x ˜ q 1 + α n 0 γ x n 0 x ˜ x n 0 + 1 x ˜ q 1 + α n 0 γ ϕ ( x ˜ ) F x ˜ , j q ( x n 0 + 1 x ˜ ) + γ n 0 x n 0 x ˜ x n 0 + 1 x ˜ q 1 [ 1 γ n 0 α n 0 ( η C q L q α n 0 q 1 q ( 1 γ n 0 ) q 1 ) ] x n 0 x ˜ x n 0 + 1 x ˜ q 1 + α n 0 γ x n 0 x ˜ x n 0 + 1 x ˜ q 1 + α n 0 γ ϕ ( x ˜ ) F x ˜ , j q ( x n 0 + 1 x ˜ ) + γ n 0 x n 0 x ˜ x n 0 + 1 x ˜ q 1 = [ 1 α n 0 ( η C q L q α n 0 q 1 q ( 1 γ n 0 ) q 1 γ ) ] x n 0 x ˜ x n 0 + 1 x ˜ q 1 + α n 0 γ ϕ ( x ˜ ) F x ˜ , j q ( x n 0 + 1 x ˜ ) 1 q [ 1 α n 0 ( η C q L q α n 0 q 1 q ( 1 γ n 0 ) q 1 γ ) ] x n 0 x ˜ q + q 1 q x n 0 + 1 x ˜ q + α n 0 γ ϕ ( x ˜ ) F x ˜ , j q ( x n 0 + 1 x ˜ ) 1 q [ 1 α n 0 ( η C q L q α n 0 q 1 q ( 1 γ n 0 ) q 1 γ ) ] ( ε 0 ε 1 ) q + q 1 q x n 0 + 1 x ˜ q + α n 0 γ ϕ ( x ˜ ) F x ˜ , j q ( x n 0 + 1 x ˜ ) ,

which implies that

x n 0 + 1 x ˜ q < [ 1 α n 0 ( η C q L q α n 0 q 1 q ( 1 γ n 0 ) q 1 γ ) ] ( ε 0 ε 1 ) q + q α n 0 γ ϕ ( x ˜ ) F x ˜ , j q ( x n 0 + 1 x ˜ ) = [ 1 α n 0 ( η C q L q α n 0 q 1 q ( 1 γ n 0 ) q 1 γ M n 0 ) ] ( ε 0 ε 1 ) q ( ε 0 ε 1 ) q .

Hence, we have

x n 0 + 1 x ˜ < ε 0 ε 1 .

In the same way, we obtain

x n x ˜ < ε 0 ε 1 ,n n 0 .

It contradicts lim sup n x n x ˜ ε 0 .

Case 2. Fix ε 1 ( ε 1 < ε 0 ), if x n x ˜ ε 0 ε 1 for all n>NN. In this case, from Lemma 2.1 there exists a number r(0,1) such that

ϕ ( x n ) ϕ ( x ˜ ) r x n x ˜ ,nN.

From (3.10) we have

x n + 1 x ˜ q = Q C z n z n , j q ( x n + 1 x ˜ ) + z n x ˜ , j q ( x n + 1 x ˜ ) z n x ˜ , j q ( x n + 1 x ˜ ) = α n γ ϕ ( x n ) + γ n W n x n + ( ( 1 γ n ) I α n F ) y n x ˜ , j q ( x n + 1 x ˜ ) = [ ( 1 γ n ) I α n F ] y n [ ( 1 γ n ) I α n F ] x ˜ + α n [ γ ϕ ( x n ) F x ˜ ] + γ n ( W n x n x ˜ ) , j q ( x n + 1 x ˜ ) = [ ( 1 γ n ) I α n F ] y n [ ( 1 γ n ) I α n F ] x ˜ , j q ( x n + 1 x ˜ ) + α n [ γ ϕ ( x n ) γ ϕ ( x ˜ ) ] , j q ( x n + 1 x ˜ ) + α n γ ϕ ( x ˜ ) F x ˜ , j q ( x n + 1 x ˜ ) + γ n W n x n x ˜ , j q ( x n + 1 x ˜ ) [ ( 1 γ n ) I α n F ] y n [ ( 1 γ n ) I α n F ] x ˜ x n + 1 x ˜ q 1 + α n γ r x n x ˜ x n + 1 x ˜ q 1 + α n γ ϕ ( x ˜ ) F x ˜ , j q ( x n + 1 x ˜ ) + γ n x n x ˜ x n + 1 x ˜ q 1 [ 1 γ n α n ( η C q L q α n q 1 q ( 1 γ n ) q 1 ) ] y n x ˜ x n + 1 x ˜ q 1 + α n γ r x n x ˜ x n + 1 x ˜ q 1 + α n γ ϕ ( x ˜ ) F x ˜ , j q ( x n + 1 x ˜ ) + γ n x n x ˜ x n + 1 x ˜ q 1 [ 1 γ n α n ( η C q L q α n q 1 q ( 1 γ n ) q 1 ) ] x n x ˜ x n + 1 x ˜ q 1 + α n γ r x n x ˜ x n + 1 x ˜ q 1 + α n γ ϕ ( x ˜ ) F x ˜ , j q ( x n + 1 x ˜ ) + γ n x n x ˜ x n + 1 x ˜ q 1 = [ 1 α n ( η C q L q α n q 1 q ( 1 γ n ) q 1 γ r ) ] x n x ˜ x n + 1 x ˜ q 1 + α n γ ϕ ( x ˜ ) F x ˜ , j q ( x n + 1 x ˜ ) 1 q [ 1 α n ( η C q L q α n q 1 q ( 1 γ n ) q 1 γ r ) ] x n x ˜ q + q 1 q x n + 1 x ˜ q + α n γ ϕ ( x ˜ ) F x ˜ , j q ( x n + 1 x ˜ ) ,

which implies that

x n + 1 x ˜ q < [ 1 α n ( η C q L q α n q 1 q ( 1 γ n ) q 1 γ r ) ] x n x ˜ q + q α n γ ϕ ( x ˜ ) F x ˜ , j q ( x n + 1 x ˜ ) .
(3.11)

Put a n = α n (η C q L q α n q 1 q ( 1 γ n ) q 1 γr) and c n = q γ ϕ ( x ˜ ) F x ˜ , j q ( x n + 1 x ˜ ) η C q L q α n q 1 q ( 1 γ n ) q 1 γ r . Applying Lemma 2.3 to (3.11), we obtain x n x ˜ as n, which contradicts x n x ˜ ε 0 ε 1 . Thus lim n x n x ˜ =0. This completes the proof. □

Theorem 3.1 Let C be a nonempty closed subset of a q-uniformly smooth Banach space X. Let Q C be the sunny nonexpansive retraction from X onto C, and let ϕ be an MKC on C. Let F:CX be an η-strongly accretive L-Lipschitzian and linear mapping with 0<γ<η, and let T i :CC be a λ i -strictly pseudo-contractive non-self-mapping such that F:= i = 1 F( T i ). Assume λ=inf{ λ i :iN}>0. Let { x n } be a sequence of C generated by (1.9). We assume that the following parameters are satisfied:

  1. (i)

    0< α n <1, i = 1 α n =, lim n α n =0, i = 1 | α n + 1 α n |<;

  2. (ii)

    0<1 ( q λ C q ) 1 q β n <1, i = 1 | β n + 1 β n |<;

  3. (iii)

    i = 1 μ i ( n ) =1, n = 1 i = 1 | μ i ( n + 1 ) μ i ( n ) |<;

  4. (iv)

    0< γ n <a<1, i = 1 | γ n + 1 γ n |<, α n + 1 β n L+α γ n + 1 + β n > α n + 1 L+ β n γ n + 1 ;

  5. (v)

    1bα<1, b:=min{1, ( q λ C q ) 1 q };

  6. (vi)

    lim n β n =α.

Then { x n } generated by (3.1) converges strongly to x ˜ F, which solves the following variational inequality:

γ ϕ ( x ˜ ) F x ˜ , j q ( p x ˜ ) 0,p i = 1 F( T i ).

Proof Combining the proof of Lemma 3.1 with Lemma 3.2, we can obtain the conclusion. □

Remark 3.1 Compared with Theorem 3.2 of Song [11], our results are different from those in the following aspects:

  1. (i)

    Theorem 3.1 improves and extends Theorem 3.2 of Song [11]. Especially, our results extend the above results from a Hilbert space to a more general q-uniformly smooth and uniformly convex Banach space.

  2. (ii)

    We change the metric projection P C in Song [11] into the sunny nonexpansive retraction Q C and put it to the other place of the iteration process so that our iteration process is better defined.

  3. (iii)

    We generalize the iteration process so that our iteration process is more general.

  4. (iv)

    We remove the very strict condition C+CC in Lemma 3.1 and Theorem 3.2 of Song [11], and it is worth stressing that the strict condition is also very necessary in Qin et al. [10] and Cai et al. [20].