Skip to main content

Strong convergence of approximated iterations for asymptoticallypseudocontractive mappings

Abstract

The asymptotically nonexpansive mappings have been introduced by Goebel and Kirkin 1972. Since then, a large number of authors have studied the weak and strongconvergence problems of the iterative algorithms for such a class of mappings.It is well known that the asymptotically nonexpansive mappings is a propersubclass of the class of asymptotically pseudocontractive mappings. In thepresent paper, we devote our study to the iterative algorithms for finding thefixed points of asymptotically pseudocontractive mappings in Hilbert spaces. Wesuggest an iterative algorithm and prove that it converges strongly to the fixedpoints of asymptotically pseudocontractive mappings.

MSC: 47J25, 47H09, 65J15.

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.

References

  1. Goebel K, Kirk WA: A fixed point theorem for asymptotically nonexpansive mappings. Proc. Am. Math. Soc. 1972, 35: 171–174. 10.1090/S0002-9939-1972-0298500-3

    Article  MathSciNet  Google Scholar 

  2. Ceng LC, Sahu DR, Yao JC: Implicit iterative algorithms for asymptotically nonexpansive mappings in theintermediate sense and Lipschitz-continuous monotone mappings. J. Comput. Appl. Math. 2010, 233: 2902–2915. 10.1016/j.cam.2009.11.035

    Article  MathSciNet  Google Scholar 

  3. Ceng LC, Wong NC, Yao JC: Fixed point solutions of variational inequalities for a finite family ofasymptotically nonexpansive mappings without common fixed pointassumption. Comput. Math. Appl. 2008, 56: 2312–2322. 10.1016/j.camwa.2008.05.002

    Article  MathSciNet  Google Scholar 

  4. Ceng LC, Xu HK, Yao JC: The viscosity approximation method for asymptotically nonexpansive mappingsin Banach spaces. Nonlinear Anal. 2008, 69: 1402–1412. 10.1016/j.na.2007.06.040

    Article  MathSciNet  Google Scholar 

  5. Chang SS, Lee HWJ, Chan CK, Kim JK: Approximating solutions of variational inequalities for asymptoticallynonexpansive mappings. Appl. Math. Comput. 2009, 212: 51–59. 10.1016/j.amc.2009.01.078

    Article  MathSciNet  Google Scholar 

  6. Chidume CE, Ali B: Weak and strong convergence theorems for finite families of asymptoticallynonexpansive mappings in Banach spaces. J. Math. Anal. Appl. 2007, 330: 377–387. 10.1016/j.jmaa.2006.07.060

    Article  MathSciNet  Google Scholar 

  7. Cho YJ, Zhou H, Guo G: Weak and strong convergence theorems for three-step iterations with errorsfor asymptotically nonexpansive mappings. Comput. Math. Appl. 2004, 47: 707–717. 10.1016/S0898-1221(04)90058-2

    Article  MathSciNet  Google Scholar 

  8. Dehghan H, Shahzad N: Strong convergence of a CQ method for k -strictly asymptoticallypseudocontractive mappings. Fixed Point Theory Appl. 2012., 2012: Article ID 208 10.1186/1687-1812-2012-208

    Google Scholar 

  9. Gornicki J: Weak convergence theorems for asymptotically nonexpansive mappings inuniformly convex Banach spaces. Comment. Math. Univ. Carol. 1989, 30: 249–252.

    MathSciNet  Google Scholar 

  10. Guo WP, Cho YJ, Guo W: Convergence theorems for mixed type asymptotically nonexpansive mappings. Fixed Point Theory Appl. 2012., 2012: Article ID 224 10.1186/1687-1812-2012-224

    Google Scholar 

  11. Huang Z: Mann and Ishikawa iterations with errors for asymptotically nonexpansivemappings. Comput. Math. Appl. 1999, 37: 1–7. 10.1016/S0898-1221(99)00040-1

    Article  Google Scholar 

  12. Kim TH, Xu HK: Strong convergence of modified Mann iterations for asymptoticallynonexpansive mappings and semigrous. Nonlinear Anal. 2006, 64: 1140–1152. 10.1016/j.na.2005.05.059

    Article  MathSciNet  Google Scholar 

  13. Lim TC, Xu HK: Fixed point theorems for asymptotically nonexpansive mappings. Nonlinear Anal. 1994, 22: 1345–1355. 10.1016/0362-546X(94)90116-3

    Article  MathSciNet  Google Scholar 

  14. Liu LQ: Convergence theorems of the sequence of iterates for asymptoticallydemicontractive and hemicontractive mappings. Nonlinear Anal. 1996, 26: 1835–1842. 10.1016/0362-546X(94)00351-H

    Article  MathSciNet  Google Scholar 

  15. Osilike MO, Aniagbosor SC: Weak and strong convergence theorems for fixed points of asymptoticallynonexpansive mappings. Math. Comput. Model. 2000, 32: 1181–1191. 10.1016/S0895-7177(00)00199-0

    Article  MathSciNet  Google Scholar 

  16. Plubtieng S, Wangkeeree R, Punpaeng R: On the convergence of modified Noor iterations with errors for asymptoticallynonexpansive mappings. J. Math. Anal. Appl. 2006, 322: 1018–1029. 10.1016/j.jmaa.2005.09.078

    Article  MathSciNet  Google Scholar 

  17. Qin X, Agarwal RP, Cho SY, Kang SM: Convergence of algorithms for fixed points of generalized asymptoticallyquasi- ϕ -nonexpansive mappings with applications. Fixed Point Theory Appl. 2012., 2012: Article ID 58 10.1186/1687-1812-2012-58

    Google Scholar 

  18. Qin X, Cho SY, Kang SM: A weak convergence theorem for total asymptotically pseudocontractivemappings in Hilbert spaces. Fixed Point Theory Appl. 2011., 2012: Article ID 859795 10.1155/2011/859795

    Google Scholar 

  19. Schu J: Iteration construction of fixed points of asymptotically nonexpansivemappings. J. Math. Anal. Appl. 1991, 158: 407–413. 10.1016/0022-247X(91)90245-U

    Article  MathSciNet  Google Scholar 

  20. Schu J: Approximation of fixed points of asymptotically nonexpansive mappings. Proc. Am. Math. Soc. 1991, 112: 143–151. 10.1090/S0002-9939-1991-1039264-7

    Article  MathSciNet  Google Scholar 

  21. Shahzad N, Udomene A: Fixed point solutions of variational inequalities for asymptoticallynonexpansive mappings in Banach spaces. Nonlinear Anal. 2006, 64: 558–567. 10.1016/j.na.2005.03.114

    Article  MathSciNet  Google Scholar 

  22. Shimizu T, Takahashi W: Strong convergence theorem for asymptotically nonexpansive mappings. Nonlinear Anal. 1996, 26: 265–272. 10.1016/0362-546X(94)00278-P

    Article  MathSciNet  Google Scholar 

  23. Shioji N, Takahashi W: Strong convergence theorems for asymptotically nonexpansive semigroups inHilbert spaces. Nonlinear Anal. 1998, 34: 87–99. 10.1016/S0362-546X(97)00682-2

    Article  MathSciNet  Google Scholar 

  24. Shioji N, Takahashi W: Strong convergence of averaged approximants for asymptotically nonexpansivemappings in Banach spaces. J. Approx. Theory 1999, 97: 53–64. 10.1006/jath.1996.3251

    Article  MathSciNet  Google Scholar 

  25. Sunthrayuth P, Kumam P: Fixed point solutions of variational inequalities for a semigroup ofasymptotically nonexpansive mappings in Banach spaces. Fixed Point Theory Appl. 2012., 2012: Article ID 177 10.1186/1687-1812-2012-177

    Google Scholar 

  26. Yao Y, Ćirić L, Liou YC, Chen R: Iterative algorithms for a finite family of asymptotically nonexpansivemappings. Dyn. Contin. Discrete Impuls. Syst., Ser. A Math. Anal. 2011, 18: 27–39.

    MathSciNet  Google Scholar 

  27. Yao Y, Liou YC: Strong convergence to common fixed points of a finite family ofasymptotically nonexpansive mappings. Taiwan. J. Math. 2007, 11: 849–865.

    MathSciNet  Google Scholar 

  28. Zegeye H, Shahzad N: Strong convergence theorems for continuous semigroups of asymptoticallynonexpansive mappings. Numer. Funct. Anal. Optim. 2009, 30: 833–848. 10.1080/01630560903123197

    Article  MathSciNet  Google Scholar 

  29. Zegeye H, Shahzad N: Approximation of the common minimum-norm fixed point of a finite family ofasymptotically nonexpansive mappings. Fixed Point Theory Appl. 2013., 2013: Article ID 1 10.1186/1687-1812-2013-1

    Google Scholar 

  30. Chidume CE, Zegeye H: Approximate fixed point sequences and convergence theorems for asymptoticallypseudocontractive mappings. J. Math. Anal. Appl. 2003, 278: 354–366. 10.1016/S0022-247X(02)00572-3

    Article  MathSciNet  Google Scholar 

  31. Zhou H: Demiclosedness principle with applications for asymptoticallypseudo-contractions in Hilbert spaces. Nonlinear Anal. 2009, 70: 3140–3145. 10.1016/j.na.2008.04.017

    Article  MathSciNet  Google Scholar 

  32. Mainge PE: Approximation methods for common fixed points of nonexpansive mappings inHilbert spaces. J. Math. Anal. Appl. 2007, 325: 469–479. 10.1016/j.jmaa.2005.12.066

    Article  MathSciNet  Google Scholar 

  33. Xu HK: Iterative algorithms for nonlinear operators. J. Lond. Math. Soc. 2002, 66: 240–256. 10.1112/S0024610702003332

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Shin Min Kang.

Additional information

Competing interests

The authors declare that they have no competing interests.

Authors’ contributions

All authors read and approved the final manuscript.

Rights and permissions

Open Access  This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made.

The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.

To view a copy of this licence, visit https://creativecommons.org/licenses/by/4.0/.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yao, Y., Postolache, M. & Kang, S.M. Strong convergence of approximated iterations for asymptoticallypseudocontractive mappings. Fixed Point Theory Appl 2014, 100 (2014). https://doi.org/10.1186/1687-1812-2014-100

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1186/1687-1812-2014-100

Keywords