1 Introduction

Let H be a real Hilbert space with inner product , and norm , respectively. Let C be a nonempty, closed,and convex subset of H. Let T:CC be a nonlinear mapping. We useF(T) to denote the fixed point set of T.

Recall that T is said to be L-Lipschitzian if there existsL>0 such that

TxTyLxy

for all x,yC. In this case, if L<1, then we call T anL-contraction. If L=1, we call T nonexpansive. T is said to be asymptotically nonexpansiveif there exists a sequence { k n }[1,) with lim n k n =1 such that

T n x T n y k n xy
(1.1)

for all x,yC and all n1.

The class of asymptotically nonexpansive mappings was introduced by Goebel and Kirk [1] in 1972. They proved that, if C is a nonempty bounded, closed,and convex subset of a uniformly convex Banach space E, then everyasymptotically nonexpansive self-mapping T of C has a fixed point.Further, the set F(T) of fixed points of T is closed and convex.

Since then, a large number of authors have studied the following algorithms for theiterative approximation of fixed points of asymptotically nonexpansive mappings(see, e.g., [229] and the references therein).

  1. (A)

    The modified Mann iterative algorithm. For arbitrary x 0 C, the modified Mann iteration generates a sequence { x n } by

    x n + 1 =(1 α n ) x n + α n T n x n ,n1.
    (1.2)
  2. (B)

    The modified Ishikawa iterative algorithm. For arbitrary x 0 C, the modified Ishikawa iteration generates a sequence { x n } by

    { y n = ( 1 β n ) x n + β n T n x n , x n + 1 = ( 1 α n ) x n + α n T n y n , n 1 .
    (1.3)
  3. (C)

    The CQ algorithm. For arbitrary x 0 C, the CQ algorithm generates a sequence { x n } by

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

An important class of asymptotically pseudocontractive mappings generalizing theclass of asymptotically nonexpansive mapping has been introduced and studied by Schuin 1991; see [19].

Recall that T:CC is called an asymptotically pseudocontractivemapping if there exists a sequence { k n }[1,) with lim n k n =1 for which the following inequality holds:

T n x T n y , x y k n x y 2
(1.5)

for all x,yC and all n1. It is clear that (1.5) is equivalent to

T n x T n y 2 k n x y 2 + ( x T n x ) ( y T n y ) 2
(1.6)

for all x,yC and all n1.

Recall also that T is called uniformly L-Lipschitzian if there exists L>0 such that

T n x T n y Lxy

for all x,yC and all n1.

Now, we know that the class of asymptotically nonexpansive mappings is a propersubclass of the class of asymptotically pseudocontractive mappings. If we define amapping T:[0,1][0,1] by the formula Tx= ( 1 x 2 3 ) 3 2 , then we can verify that T is asymptoticallypseudocontractive but it is not asymptotically nonexpansive.

In order to approximate the fixed point of asymptotically pseudocontractive mappings,the following two results are interesting.

One is due to Schu [19], who proved the following convergence theorem.

Theorem 1.1 Let H be a Hilbert space, C be a nonempty closed bounded and convex subset of H. Let T be a completely continuous, uniformly L-Lipschitzian and asymptotically pseudocontractiveself-mapping of C with { k n }[1,) and n = 1 ( q n 2 1)<, where q n =(2 k n 1) for all n1. Let { α n }[0,1] and { β n }[0,1] be two sequences satisfying 0<ϵ α n β n b< L 2 ( 1 + L 2 1) for all n1. Then the sequence { x n } generated by the modified Ishikawa iteration (1.3) converges stronglyto some fixed point of T.

Another one is due to Chidume and Zegeye [30] who introduced the following algorithm in 2003.

Let a sequence { x n } be generated from x 1 C by

x n + 1 = λ n θ n x 1 +(1 λ n λ n θ n ) x n + λ n T n x n ,n1,
(1.7)

where the sequences { λ n } and { θ n } satisfy

  1. (i)

    n = 1 λ n θ n = and λ n (1+ θ n )1;

  2. (ii)

    λ n θ n 0, θ n 0 and ( θ n 1 θ n 1 ) λ n θ n 0;

  3. (iii)

    k n k n 1 λ n θ n 2 0;

  4. (iv)

    k n 1 θ n 0.

They gave the strong convergence analysis for the above algorithm (1.7) with somefurther assumptions on the mapping T in Banach spaces.

Remark 1.2 Note that there are some additional assumptions imposed on theunderlying space C and the mapping T in the above two results. In(1.7), the parameter control is also restricted.

Inspired by the results above, the main purpose of this article is to construct aniterative method for finding the fixed points of asymptotically pseudocontractivemappings. We construct an algorithm which is based on the algorithms (1.2) and(1.7). Under some mild conditions, we prove that the suggested algorithm convergesstrongly to the fixed point of asymptotically pseudocontractive mappingT.

2 Preliminaries

It is well known that in a real Hilbert space H, the following inequalityand equality hold:

x + y 2 x 2 +2y,x+y,x,yH
(2.1)

and

t x + ( 1 t ) y 2 =t x 2 +(1t) y 2 t(1t) x y 2
(2.2)

for all x,yH and t[0,1].

Lemma 2.1 ([31])

Let C be a nonempty bounded and closed convex subset of a real Hilbert space H. Let T:CC be a uniformly L-Lipschtzian and asymptotically pseudocontraction. Then IT is demiclosed at zero.

Lemma 2.2 ([32])

Let { r n } be a sequence of real numbers. Assume { r n } does not decrease at infinity, that is, there exists at leasta subsequence { r n k } of { r n } such that r n k r n k + 1 for all k0. For every nN, define an integer sequence {τ(n)} as

τ(n)=max{in: r n i < r n i + 1 }.

Then τ(n) as n, and for all nN

max{ r τ ( n ) , r n } r τ ( n ) + 1 .

Lemma 2.3 ([33])

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

a n + 1 (1 δ n ) a n + ξ n ,

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

  1. (i)

    n = 1 δ n =;

  2. (ii)

    lim sup n ξ n δ n 0 or n = 1 | ξ n |<.

Then lim n a n =0.

3 Main results

Now we introduce the following iterative algorithm for asymptoticallypseudocontractive mappings.

Let C be a nonempty, closed, and convex subset of a real Hilbert spaceH. Let T:CC be a uniformly L-Lipschitzian asymptoticallypseudocontractive mapping satisfying n = 1 ( k n 1)<. Let f:CC be a ρ-contractive mapping. Let{ α n }, { β n }, and { γ n } be three real number sequences in[0,1].

Algorithm 3.1 For x 0 C, define the sequence { x n } by

{ y n = ( 1 γ n ) x n + γ n T n x n , x n + 1 = α n f ( x n ) + ( 1 α n β n ) x n + β n T n y n , n 1 .
(3.1)

Next, we prove our main result as follows.

Theorem 3.2 Suppose that F(T). Assume the sequences { α n }, { β n }, and { γ n } satisfy the following conditions:

  1. (i)

    lim n α n =0 and n = 1 α n =;

  2. (ii)

    α n + β n γ n and 0< lim inf n β n ;

  3. (iii)

    0<a γ n b< 2 ( 1 + k n ) 2 + 4 L 2 + 1 + k n for all n1.

Then the sequence { x n } defined by (3.1) converges strongly to u= P F ( T ) f(u), which is the unique solution of the variationalinequality (If) x ,x x 0 for all xF(T).

Proof From (3.1), we have

x n + 1 u = α n f ( x n ) + ( 1 α n β n ) x n + β n T n y n u α n ( f ( x n ) u ) + ( 1 α n β n ) ( x n u ) + β n ( T n y n u ) = α n ( f ( x n ) u ) + ( 1 α n ) ( 1 α n β n 1 α n ( x n u ) + β n 1 α n ( T n y n u ) ) ( 1 α n ) ( 1 α n β n ) ( x n u ) 1 α n + β n ( T n y n u ) 1 α n + α n f ( x n ) u .
(3.2)

Using the equality (2.2), we get

( 1 α n β n ) ( x n u ) 1 α n + β n ( T n y n u ) 1 α n 2 = 1 α n β n 1 α n x n u 2 + β n 1 α n T n y n u 2 β n ( 1 α n β n ) ( 1 α n ) 2 x n T n y n 2 .
(3.3)

Picking up y=u in (1.6) we deduce

T n x u 2 k n x u 2 + x T n x 2
(3.4)

for all xC.

From (3.1), (3.4), and (2.2), we obtain

T n y n u 2 k n y n u 2 + y n T n y n 2 = k n ( 1 γ n ) x n + γ n T n x n u 2 + ( 1 γ n ) x n + γ n T n x n T n y n 2 = k n ( 1 γ n ) ( x n u ) + γ n ( T n x n u ) 2 + ( 1 γ n ) ( x n T n y n ) + γ n ( T n x n T n y n ) 2 = k n [ ( 1 γ n ) x n u 2 + γ n T n x n u 2 γ n ( 1 γ n ) x n T n x n 2 ] + ( 1 γ n ) x n T n y n 2 + γ n T n x n T n y n 2 γ n ( 1 γ n ) x n T n x n 2 k n [ ( 1 γ n ) x n u 2 + γ n ( k n x n u 2 + x n T n x n 2 ) γ n ( 1 γ n ) x n T n x n 2 ] + ( 1 γ n ) x n T n y n 2 + γ n T n x n T n y n 2 γ n ( 1 γ n ) x n T n x n 2 .
(3.5)

By (3.1), we have

x n y n = γ n x n T n x n .
(3.6)

Noting that T is uniformly L-Lipschitzian, from (3.5) and (3.6),we deduce

T n y n u 2 k n [ ( 1 γ n ) x n u 2 + γ n ( k n x n u 2 + x n T n x n 2 ) γ n ( 1 γ n ) x n T n x n 2 ] + ( 1 γ n ) x n T n y n 2 + γ n L 2 x n y n 2 γ n ( 1 γ n ) x n T n x n 2 = k n [ ( 1 γ n ) x n u 2 + γ n ( k n x n u 2 + x n T n x n 2 ) γ n ( 1 γ n ) x n T n x n 2 ] + ( 1 γ n ) x n T n y n 2 + γ n 3 L 2 x n T n x n 2 γ n ( 1 γ n ) x n T n x n 2 = [ 1 + ( k n γ n + 1 ) ( k n 1 ) ] x n u 2 + ( 1 γ n ) x n T n y n 2 γ n ( 1 γ n k n γ n γ n 2 L 2 ) x n T n x n 2 .
(3.7)

By condition (iii), we know that γ n b< 2 ( 1 + k n ) 2 + 4 L 2 + k n + 1 for all n. Then we deduce that1 γ n k n γ n γ n 2 L 2 >0 for all n0.

Therefore, from (3.7), we derive

T n y n u 2 [ 1 + ( k n γ n + 1 ) ( k n 1 ) ] x n u 2 + ( 1 γ n ) x n T n y n 2 .
(3.8)

Note that β n 1 α n and substituting (3.8) to (3.3), we obtain

( 1 α n β n ) ( x n u ) 1 α n + β n ( T n y n u ) 1 α n 2 β n 1 α n { [ 1 + ( k n γ n + 1 ) ( k n 1 ) ] x n u 2 + ( 1 γ n ) x n T n y n 2 } + 1 α n β n 1 α n x n u 2 β n ( 1 α n β n ) ( 1 α n ) 2 x n T n y n 2 = [ 1 + β n 1 α n ( k n γ n + 1 ) ( k n 1 ) ] x n u 2 + β n ( α n + β n γ n ) ( 1 α n ) 2 x n T n y n 2 [ 1 + β n 1 α n ( k n γ n + 1 ) ( k n 1 ) ] x n u 2 [ 1 + ( k n γ n + 1 ) ( k n 1 ) ] x n u 2 .

Thus,

( 1 α n β n ) ( x n u ) 1 α n + β n ( T n y n u ) 1 α n 1 + ( k n γ n + 1 ) ( k n 1 ) x n u [ 1 + ( k n γ n + 1 ) ( k n 1 ) ] x n u .
(3.9)

Since k n 1, without loss of generality, we assume that k n 2 for all n1. It follows from (3.2) and (3.9) that

n x n + 1 u α n f ( x n ) u + ( 1 α n ) [ 1 + ( k n γ n + 1 ) ( k n 1 ) ] n x n u α n f ( x n ) f ( u ) + α n f ( u ) u + ( 1 α n ) [ 1 + ( k n γ n + 1 ) ( k n 1 ) ] x n u α n ρ x n u + α n f ( u ) u + ( 1 α n ) [ 1 + ( k n γ n + 1 ) ( k n 1 ) ] x n u α n f ( u ) u + [ 1 ( 1 ρ ) α n ] x n u + ( k n γ n + 1 ) ( k n 1 ) x n u ( 1 ρ ) α n f ( u ) u 1 ρ + [ 1 ( 1 ρ ) α n ] x n u + 3 ( k n 1 ) x n u .

An induction induces

x n + 1 u [ 1 + 3 ( k n 1 ) ] max { x n u , f ( u ) u 1 ρ } j = 1 n [ 1 + 3 ( k j 1 ) ] max { x 0 u , f ( u ) u 1 ρ } .

This implies that the sequence { x n } is bounded by the condition n = 1 ( k n 1)<.

From (2.1) and (3.1), we have

x n + 1 u 2 = ( 1 α n ) ( x n u ) β n ( x n T n y n ) + α n ( f ( x n ) u ) 2 ( 1 α n ) ( x n u ) β n ( x n T n y n ) 2 + 2 α n f ( x n ) u , x n + 1 u = ( 1 α n ) ( x n u ) 2 2 β n ( 1 α n ) x n T n y n , x n u + β n 2 x n T n y n 2 + 2 α n f ( x n ) u , x n + 1 u .
(3.10)

From (3.7), we deduce

2 x n T n y n , x n u γ n x n T n y n 2 + γ n ( 1 γ n k n γ n γ n 2 L 2 ) x n T n x n 2 ( k n γ n + 1 ) ( k n 1 ) x n u 2 γ n ( 1 γ n k n γ n γ n 2 L 2 ) x n T n x n 2 + γ n x n T n y n 2 .
(3.11)

By condition (ii), we have 1 γ n α n + β n α n γ n + β n for all n1. Hence, by (3.10) and (3.11), we get

x n + 1 u 2 ( 1 α n ) x n u 2 β n ( 1 α n ) γ n x n T n y n 2 + β n 2 x n T n y n 2 β n ( 1 α n ) γ n ( 1 γ n k n γ n γ n 2 L 2 ) x n T n x n 2 + 2 α n f ( x n ) u , x n + 1 u ( 1 α n ) x n u 2 + 2 α n f ( x n ) u , x n + 1 u β n ( 1 α n ) γ n ( 1 γ n k n γ n γ n 2 L 2 ) x n T n x n 2 .
(3.12)

It follows that

x n + 1 u 2 x n u 2 + β n ( 1 α n ) γ n ( 1 γ n k n γ n γ n 2 L 2 ) x n T n x n 2 α n ( 2 f ( x n ) u , x n + 1 u x n u 2 ) .

Since { x n } and {f( x n )} are bounded, there exists M>0 such that sup n {2f( x n )u, x n + 1 u x n u 2 }M. So,

β n ( 1 α n ) γ n ( 1 γ n k n γ n γ n 2 L 2 ) x n T n x n 2 + x n + 1 u 2 x n u 2 α n M .
(3.13)

Next, we consider two possible cases.

Case 1. Assume there exists some integer m>0 such that { x n u} is decreasing for all nm.

In this case, we know that lim n x n u exists. From (3.13), we deduce

β n ( 1 α n ) γ n ( 1 γ n k n γ n γ n 2 L 2 ) x n T n x n 2 x n u 2 x n + 1 u 2 + M α n .
(3.14)

By conditions (ii) and (iii), we have lim inf n β n (1 α n ) γ n (1 γ n k n γ n γ n 2 L 2 )>0. Thus, from (3.14), we get

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

It follows from (3.6) and (3.15) that

lim n x n y n =0.
(3.16)

Since T is uniformly L-Lipschitzian, we have T n y n T n x n L x n y n . This together with (3.16) implies that

lim n T n y n T n x n =0.
(3.17)

Note that

x n T n y n x n T n x n + T n x n T n y n .
(3.18)

Combining (3.15), (3.17), and (3.18), we have

lim n x n T n y n =0.
(3.19)

From (3.1), we deduce

x n + 1 x n α n f ( x n ) x n + β n T n y n x n .

Therefore,

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

Since T is uniformly L-Lipschitzian, we derive

x n T x n x n T n x n + T n x n T x n x n T n x n + L T n 1 x n x n x n T n x n + L T n 1 x n T n 1 x n 1 + L T n 1 x n 1 x n 1 + L x n 1 x n x n T n x n + ( L 2 + L ) x n x n 1 + L T n 1 x n 1 x n 1 .
(3.21)

By (3.15), (3.20), and (3.21), we have immediately

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

Since { x n } is bounded, there exists a subsequence{ x n k } of { x n } satisfying

x n k x ˜ C

and

lim sup n f ( u ) u , x n u = lim k f ( u ) u , x n k u .

Thus, we use the demiclosed principle of T (Lemma 2.1) and (3.22) todeduce

x ˜ F(T).

So,

lim sup n f ( u ) u , x n u = lim k f ( u ) u , x n k u = f ( u ) u , x ˜ u 0 .

Returning to (3.12) to obtain

x n + 1 u 2 ( 1 α n ) x n u 2 + 2 α n f ( x n ) u , x n + 1 u = ( 1 α n ) x n u 2 + 2 α n f ( x n ) f ( u ) , x n + 1 u + 2 α n f ( u ) u , x n + 1 u ( 1 α n ) x n u 2 + 2 α n ρ x n u x n + 1 u + 2 α n f ( u ) u , x n + 1 u ( 1 α n ) x n u 2 + α n ρ ( x n u 2 + x n + 1 u 2 ) + 2 α n f ( u ) u , x n + 1 u .

It follows that

x n + 1 u 2 [ 1 ( 1 ρ ) α n ] x n u 2 + 2 α n 1 α n ρ f ( u ) u , x n + 1 u .
(3.23)

In Lemma 2.3, we take a n = x n + 1 u 2 , δ n =(1ρ) α n , and ξ n = 2 α n 1 α n ρ f(u)u, x n + 1 u. We can easily check that n = 1 δ n = and lim sup n ξ n δ n 0. Thus, we deduce that x n u.

Case 2. Assume there exists an integer n 0 such that x n 0 u x n 0 + 1 u. At this case, we set ω n ={ x n u}. Then we have ω n 0 ω n 0 + 1 . Define an integer sequence { τ n } for all n n 0 as follows:

τ(n)=max{lN| n 0 ln, ω l ω l + 1 }.

It is clear that τ(n) is a non-decreasing sequence satisfying

lim n τ(n)=

and

ω τ ( n ) ω τ ( n ) + 1

for all n n 0 . From (3.22), we get

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

This implies that ω w ( x τ ( n ) )F(T). Thus, we obtain

lim sup n f ( u ) u , x τ ( n ) u 0.
(3.24)

Since ω τ ( n ) ω τ ( n ) + 1 , we have from (3.23) that

ω τ ( n ) 2 ω τ ( n ) + 1 2 [ 1 ( 1 ρ ) α τ ( n ) ] ω τ ( n ) 2 + 2 α τ ( n ) 1 α τ ( n ) ρ f ( u ) u , x τ ( n ) + 1 u .

It follows that

ω τ ( n ) 2 2 ( 1 α τ ( n ) ρ ) ( 1 ρ ) f ( u ) u , x τ ( n ) + 1 u .
(3.25)

Combining (3.24) and (3.25), we have

lim sup n ω τ ( n ) 0,

and hence

lim n ω τ ( n ) =0.
(3.26)

From (3.23), we obtain

x τ ( n ) + 1 u 2 [ 1 ( 1 ρ ) α τ ( n ) ] x τ ( n ) u 2 + 2 α τ ( n ) 1 α τ ( n ) ρ f ( u ) u , x τ ( n ) + 1 u .

It follows that

lim sup n ω τ ( n ) + 1 lim sup n ω τ ( n ) .

This together with (3.26) imply that

lim n ω τ ( n ) + 1 =0.

Applying Lemma 2.2 to get

0 ω n max{ ω τ ( n ) , ω τ ( n ) + 1 }.

Therefore, ω n 0. That is, x n u. The proof is completed. □

Since the class of asymptotically nonexpansive mappings is a proper subclass of theclass of asymptotically pseudocontractive mappings and asymptotically nonexpansivemapping T is L-Lipschitzian with L= sup n k n . Thus, from Theorem 3.2, we get the followingcorollary.

Corollary 3.3 Let C be a nonempty closed convex subset of a real Hilbert space H. Let T:CC be an asymptotically nonexpansive mapping satisfying n = 1 ( k n 1)<. Suppose that F(T). Let f:CC be a ρ-contractive mapping. Let { α n }, { β n }, and { γ n } be three real number sequences in [0,1]. Assume the sequences { α n }, { β n }, and { γ n } satisfy the following conditions:

  1. (i)

    lim n α n =0 and n = 1 α n =;

  2. (ii)

    α n + β n γ n and 0< lim inf n β n ;

  3. (iii)

    0<a γ n b< 2 ( 1 + L ) 2 + 4 L 2 + 1 + L for all n1, where L= sup n k n .

Then the sequence { x n } defined by (3.1) converges strongly to u= P F ( T ) f(u), which is the unique solution of the variationalinequality (If) x ,x x 0 for all xF(T).

Remark 3.4 Our Theorem 3.2 does not impose any boundedness or compactnessassumption on the space C or the mapping T. The parameter controlconditions (i)-(iii) are mild.

Remark 3.5 Our Corollary 3.3 is also a new result.

4 Conclusion

This work contains our dedicated study to develop and improve iterative algorithmsfor finding the fixed points of asymptotically pseudocontractive mappings in Hilbertspaces. We introduced our iterative algorithm for this class of problems, and wehave proven its strong convergence. This study is motivated by relevant applicationsfor solving classes of real-world problems, which give rise to mathematical modelsin the sphere of nonlinear analysis.