Skip to main content

Equivalence of semistability of Picard, Mann, Krasnoselskij and Ishikawa iterations

An Erratum to this article was published on 31 March 2014

Abstract

In this paper, we show that convergence of Picard, Mann, Krasnoselskij and Ishikawa iterations is equivalent in cone normed spaces. Also, we prove that semistability of these iterations is equivalent.

1 Introduction

Let (E, ∥ ⋅ ∥ E ) be a real Banach space. A subset P⊆E is called a cone in E if it satisfies the following conditions:

  1. (i)

    P is closed, nonempty and P≠{0},

  2. (ii)

    a,b∈R, a,b≥0 and x,y∈P imply that ax+by∈P,

  3. (iii)

    x∈P and −x∈P imply that x=0.

The space E can be partially ordered by the cone P, by defining x≤y if and only if y−x∈P. Also, we write x≪y if y−x∈intP, where intP denotes the interior of P. A cone P is called normal if there exists a constant k>0 such that 0≤x≤y implies ∥ x ∥ E ≤k ∥ y ∥ E . The least positive number satisfying above is called the normal constant of P.

From now on, we suppose that E is a real Banach space, P is a cone in E and ≤ is a partial ordering with respect to P.

Lemma 1.1 ([1])

Let P be a normal cone and let { a n } and { b n } be sequences in E satisfying the following inequality:

a n + 1 ≤h a n + b n ,
(1)

where h∈(0,1) and b n →0 as n→∞. Then lim n → ∞ a n =0.

Definition 1.2 ([2])

Let X be a vector space over the field F. Assume that the function p:X→E having the properties:

  1. (i)

    0≤p(x) for all x in X,

  2. (ii)

    p(x+y)≤p(x)+p(y) for all x, y in X,

  3. (iii)

    p(αx)=|α|p(x) for all α∈F and x∈X.

Then p is called a cone seminorm on X. A cone norm is a cone seminorm p such that

  1. (iv)

    x=0 if p(x)=0.

We will denote a cone norm by ∥ ⋅ ∥ c and (X, ∥ ⋅ ∥ c ) is called a cone normed space. Also, d c (x,y)= ∥ x − y ∥ c defines a cone metric on X.

Definition 1.3 ([3])

Let (X, ∥ ⋅ ∥ c ) be a cone normed space. Then A⊆X is called bounded above if there exists c∈E, 0≪c such that ∥ x − y ∥ c ≤c for all x,y∈A.

Definition 1.4 Let (X, ∥ ⋅ ∥ c ) be a cone normed space. Let { x n } be a sequence in X and x∈X. If for any c∈E with 0≪c, there exists an integer N≥1 such that for all n≥N, ∥ x n − x ∥ c ≪c, then we will say { x n } converges to x and we write lim n → ∞ x n =x.

Definition 1.5 Let (X, ∥ ⋅ ∥ c ) be a cone normed space. Let { x n } be a sequence in X and x∈X. If for any c∈E with 0≪c, there exists an integer N≥1 such that for all n,m≥N, ∥ x n − x m ∥ c ≪c, then { x n } is said to be a Cauchy sequence. If every Cauchy sequence is convergent in X, then X is called a cone Banach space.

Lemma 1.6 ([4])

Let (X, d c ) be a cone metric space, P be a normal cone. Let { x n } be a sequence in X and x∈X. Then { x n } converges to x if and only if lim n → ∞ d c ( x n ,x)=0.

Lemma 1.7 Let (X, ∥ ⋅ ∥ c ) be a cone normed space over the real Banach space E with the cone P which is normal with the normal constant k. The mapping N:X→[0,∞) defined by N(x)= ∥ ( ∥ x ∥ c ) ∥ E satisfies the following properties:

  1. (i)

    ∥ x ∥ c ≤ ∥ y ∥ c implies N(x)≤kN(y),

  2. (ii)

    N(x+y)≤k[N(x)+N(y)] for all x,y∈X,

  3. (iii)

    N(αx)=|α|N(x) for all α∈F and x∈X,

  4. (iv)

    N(x−y)≤k[N(x− z 1 )+⋯+N(x− z n )] for all x,y, z 1 ,…, z n ∈X,

  5. (v)

    x=0 if and only if N(x)=0.

    Moreover, let A be a bounded above subset of X, then

  6. (vi)

    {N(x):x∈A} is a bounded set.

Proof The proof is obvious. □

Definition 1.8 Let (X, ∥ â‹… ∥ c ) be a cone normed space over the real Banach space E with the normal cone P. The mapping N, defined in Lemma 1.7, is called a norm type with respect to ∥ â‹… ∥ c .

Lemma 1.9 Let (X, ∥ ⋅ ∥ c ) be a cone normed space over the real Banach space E with the normal cone P. Also, let { x n } be a sequence in X and x∈X. Then { x n } converges to x if and only if lim n → ∞ N( x n −x)=0.

Proof Note that { ∥ x n − x ∥ c } is a sequence in E and by Lemma 1.6, the proof is obvious. □

Definition 1.10 Let X be a cone normed space and T:X→X be a map for which there exist real numbers a, b, c satisfying 0<a<1, 0<b<1/2 and 0<c<1/2. Then T is called a Zamfirescu operator with respect to (a,b,c) if and only if for each pair x,y∈X, T satisfies at least one of the following conditions:

(Z1) ∥ T x − T y ∥ c ≤a ∥ x − y ∥ c ,

(Z2) ∥ T x − T y ∥ c ≤b( ∥ x − T x ∥ c + ∥ y − T y ∥ c ),

(Z3) ∥ T x − T y ∥ c ≤c( ∥ x − T y ∥ c + ∥ y − T x ∥ c ).

Usually, for simplicity, T is called a Zamfirescu operator if T is Zamfirescu with respect to some triple (a,b,c) of scalers a, b and c with above restrictions. Also, T is called f-Zamfirescu operator if at least one of the relations (Z1), (Z2) and (Z3) hold for all x∈X and for all y∈F(T).

Remark 1.11 Let T be a Zamfirescu operator and x,y∈X be arbitrary. Since T is Zamfirescu, at least one of the conditions (Z1), (Z2) and (Z3) is satisfied. If (Z2) holds, then

∥ T x − T y ∥ c ≤ b ( ∥ x − T x ∥ c + ∥ y − T y ∥ c ) ≤ b ( 2 ∥ x − T x ∥ c + ∥ y − x ∥ c + ∥ T x − T y ∥ c ) .

Thus we get

(1−b) ∥ T x − T y ∥ c ≤b ∥ x − y ∥ c +2b ∥ x − T x ∥ c .

Since 0<b<1, we have

∥ T x − T y ∥ c ≤ b 1 − b ∥ x − y ∥ c + 2 b 1 − b ∥ x − T x ∥ c .

Similarly, if (Z3) holds, then we obtain

∥ T x − T y ∥ c ≤ c 1 − c ∥ x − y ∥ c + 2 c 1 − c ∥ x − T x ∥ c .

Hence

∥ T x − T y ∥ c ≤δ ∥ x − y ∥ c +2δ ∥ x − T x ∥ c ,
(2)

where δ:=max{a, b 1 − b , c 1 − c } and 0<δ<1.

Definition 1.12 Let X be a cone normed space. A self-map T of X is called a quasi-contraction if for some constant λ∈(0,1) and for every x,y∈X, there exists

u∈C(T;x,y)≡ { ∥ x − y ∥ c , ∥ x − T x ∥ c , ∥ y − T y ∥ c , ∥ y − T x ∥ c , ∥ x − T y ∥ c }

such that ∥ T x − T y ∥ c ≤λu. If this inequality holds for all x∈X and y∈F(T), we say that T is a f-quasi-contraction.

Definition 1.13 Let X be a cone normed space, T be a self-map of X and p 0 = u 0 = x 0 = v 0 ∈X. The Picard iteration is given by

p n + 1 =T p n .
(3)

For a sequence of self-maps { T n } n ∈ N , the iteration p n + 1 = T n p n is called the Picard’s S-iteration.

Another two well-known iteration procedures for obtaining fixed points of T are Mann iteration defined by

u n + 1 =(1− α n ) u n + α n T u n
(4)

and Ishikawa iteration defined by

x n + 1 = ( 1 − α n ) x n + α n T z n , z n = ( 1 − β n ) x n + β n T x n ,
(5)

where { α n }⊆(0,1) and { β n }⊆[0,1). Also, the Krasnoselskij iteration is defined by

v n + 1 =(1−λ) v n +λT v n ,
(6)

where λ∈(0,1).

If T is a self-map of X, then by F(T) we mean the set of fixed points of T. Also, N 0 denotes the set of nonnegative integers, i.e., N 0 =N∪{0}.

Lemma 1.14 ([5])

Let (X, d c ) be a complete cone metric space and P be a normal cone. Suppose that the mapping T:X→X satisfies the contractive condition

d c (Tx,Ty)≤k d c (x,y)

for all x,y∈X, where k∈[0,1) is a constant. Then T has a unique fixed point in X and for each x∈X, the iterative sequence { T n x} converges to the fixed point.

Lemma 1.15 ([5])

Let (X, d c ) be a complete cone metric space and P be a normal cone. Suppose that the mapping T:X→X satisfies the contractive condition

d c (Tx,Ty)≤k ( d c ( T x , x ) + d c ( T y , y ) )

for all x,y∈X, where k∈[0,1/2) is a constant. Then T has a unique fixed point in X and for each x∈X, the iterative sequence { T n x} converges to the fixed point.

Lemma 1.16 ([5])

Let (X, d c ) be a complete cone metric space and P be a normal cone. Suppose that the mapping T:X→X satisfies the contractive condition

d c (Tx,Ty)≤k ( d c ( T x , y ) + d c ( T y , x ) )

for all x,y∈X, where k∈[0,1/2) is a constant. Then T has a unique fixed point in X and for each x∈X, the iterative sequence { T n x} converges to the fixed point.

Lemma 1.17 ([2])

Let T be a quasi-contraction with 0<λ<1/2. Then T is a Zamfirescu operator.

Definition 1.18 Let (X, ∥ ⋅ ∥ c ) be a cone normed space and { T n } n be a sequence of self-maps of X with ⋂ n F( T n )≠∅. Let x 0 be a point of X and assume that x n + 1 =f( T n , x n ) is an iteration procedure involving { T n }, which yields a sequence { x n } of points from X. The iteration x n + 1 =f( T n , x n ) is said to be { T n }-semistable (or semistable with respect to { T n }) if whenever { x n } converges to a fixed point q in ⋂ n F( T n ) and { y n } is a sequence in X with lim n → ∞ ∥ y n + 1 − f ( T n , y n ) ∥ c =0 and ∥ y n − f ( T n , y n ) ∥ c =o( t n ) for some sequence { t n }⊆ R + , then y n →q.

The iteration x n + 1 =f( T n , x n ) is said to be { T n } -stable (or stable with respect to { T n }) if { x n } converges to a fixed point q in ⋂ n F( T n ) and whenever { y n } is a sequence in X with lim n → ∞ ∥ y n + 1 − f ( T n , y n ) ∥ c =0, we have y n →q.

Note that if T n =T for all n, then Definition 1.18 gives the definitions of T-semistability and T-stability respectively.

Lemma 1.19 ([2])

Let (X, d c ) be a cone metric space, P be a normal cone and { T n } n ∈ N 0 be a sequence of self-maps of X with ⋂ n F( T n )≠∅. Suppose that there exist nonnegative bounded sequences { a n }, { b n } with sup n b n <1 such that

d c ( T n x,q)≤ a n d c (x, T n x)+ b n d c (x,q)

for each n∈ N 0 , x∈X and q∈ ⋂ n F( T n ). Then the Picard’s S-iteration is semistable with respect to { T n }.

Lemma 1.20 ([2])

Let (X, d c ) be a cone metric space, P be a normal cone and { T n } n ∈ N 0 be a sequence of self-maps of X with ⋂ n F( T n )≠∅. If for all n∈ N 0 , T n is a f-Zamfirescu operator with respect to ( α n , β n , γ n ) with sup n γ n <1/2. Then the Picard’s S-iteration is semistable with respect to { T n }.

Lemma 1.21 ([2])

Under the conditions of Lemma  1.22 if T n is a Zamfirescu operator for all n, then the Picard’s S-iteration is semistable with respect to { T n } n .

Lemma 1.22 ([2])

Let (X, d c ) be a cone metric space, P be a normal cone and { T n } n ∈ N 0 be a sequence of self-maps of X with â‹‚ n F( T n )≠∅. If for all n∈ N 0 , T n is a f-quasi-contraction with λ n such that sup n λ n <1, then the Picard’s S-iteration is semistable with respect to  { T n } n .

For some other sources on these topics, we refer to [6–23].

2 Main results

Theorem 2.1 Let X be a cone normed space and P be a normal cone. Suppose that T is a Zamfirescu self-map of X and q∈F(T). Then the following are equivalent:

  1. (i)

    the Picard iteration converges to q,

  2. (ii)

    the Mann iteration converges to q.

Proof Let { α n }⊆(0,1) be given. We prove the implication (i)⇒(ii). Suppose that lim n → ∞ p n =q. Now, by using (3) and (4), we have

∥ u n + 1 − p n + 1 ∥ c ≤ ( 1 − α n ) ∥ u n − T p n ∥ c + α n ∥ T u n − T p n ∥ c ≤ ( 1 − α n ) ∥ u n − p n ∥ c + ( 1 − α n ) ∥ p n − T p n ∥ c + α n ∥ T u n − T p n ∥ c ≤ ( 1 − α n ) ∥ u n − p n ∥ c + ( 1 − α n ) ( ∥ p n − q ∥ c + ∥ T p n − T q ∥ c ) + α n ∥ T u n − T p n ∥ c .
(7)

Using (2) with x:= p n , y:= u n , we get

∥ T u n − T p n ∥ c ≤ δ ∥ u n − p n ∥ c + 2 δ ∥ p n − T p n ∥ c ≤ δ ∥ u n − p n ∥ c + 2 δ ( ∥ p n − q ∥ c + ∥ T p n − T q ∥ c ) .
(8)

Using (2) with x:=q, y:= p n , we obtain

∥ T p n − T q ∥ c ≤δ ∥ p n − q ∥ c .
(9)

Relations (7), (8) and (9) lead to

∥ u n + 1 − p n + 1 ∥ c ≤ ( 1 − ( 1 − δ ) α n ) ∥ u n − p n ∥ c +(1− α n +2δ α n )(1+δ) ∥ p n − q ∥ c .

Set

a n : = ∥ u n − p n ∥ c , b n : = ( 1 − α n + 2 δ α n ) ( 1 + δ ) ∥ p n − q ∥ c , h : = 1 − sup n α n .

Since lim n → ∞ ∥ p n − q ∥ c =0, by using Lemma 1.1, we get

lim n → ∞ ∥ u n − p n ∥ c =0.

Thus

0≤ ∥ u n − q ∥ c ≤ ∥ u n − p n ∥ c + ∥ p n − q ∥ c →0,

as n→∞. This completes the proof.

Now we prove (ii)⇒(i). Suppose that lim n → ∞ ∥ u n − q ∥ c =0. Applying (3) and (4), we have

∥ u n + 1 − p n + 1 ∥ c ≤ ( 1 − α n ) ∥ u n − T p n ∥ c + α n ∥ T u n − T p n ∥ c ≤ ( 1 − α n ) ∥ u n − T u n ∥ c + ∥ T u n − T p n ∥ c .
(10)

Using (2) with x:= u n , y:= p n , we obtain

∥ T u n − T p n ∥ c ≤δ ∥ u n − p n ∥ c +2δ ∥ u n − T u n ∥ c .
(11)

Therefore, from (10) and (11), we get

∥ u n + 1 − p n + 1 ∥ c ≤ δ ∥ u n − p n ∥ c + ( 1 − α n + 2 δ ) ∥ u n − T u n ∥ c ≤ δ ∥ u n − p n ∥ c + ( 1 − α n + 2 δ ) ( ∥ u n − q ∥ c + ∥ T u n − T q ∥ c ) ≤ δ ∥ u n − p n ∥ c + ( 1 − α n + 2 δ ) ( 1 + δ ) ∥ u n − q ∥ c .
(12)

Put

a n : = ∥ u n − p n ∥ c , b n : = ( 1 − α n + 2 δ ) ( 1 + δ ) ∥ u n − q ∥ c , h : = δ .

Since lim n → ∞ b n =0, by Lemma 1.1 and relation (12), we get lim n → ∞ ∥ u n − p n ∥ c =0. Thus

∥ p n −q∥≤ ∥ p n − u n ∥ c + ∥ u n − q ∥ c →0,

as n→∞ and so the proof is complete. □

Theorem 2.2 Let X be a cone normed space and P be a normal cone. Suppose that T is a Zamfirescu self-map of X and q∈F(T). Then the following are equivalent:

  1. (i)

    the Picard iteration converges to q,

  2. (ii)

    the Krasnoselskij iteration converges to q.

Proof For α n =λ, the Mann iteration reduces to the Krasnoselskij iteration. Now apply the proof of Theorem 2.1. □

Theorem 2.3 Let X be a cone normed space and P be a normal cone. Suppose that T is a Zamfirescu operator of X and q∈F(T). Then the following are equivalent:

  1. (i)

    the Mann iteration converges to q,

  2. (ii)

    the Ishikawa iteration converges to q.

Proof Let { α n }⊆(0,1) and { β n }⊆[0,1) be given. We prove the implication (i)⇒(ii). Suppose that lim n → ∞ u n =q. Using

lim n → ∞ ∥ x n − u n ∥ c =0,
(13)

and

0≤ ∥ q − x n ∥ c ≤ ∥ u n − q ∥ c + ∥ x n − u n ∥ c ,

we get lim n → ∞ x n =q. The proof is complete if we prove relation (13).

Using (2), (4) and (5) with x:= u n , y:= z n , we have

∥ u n + 1 − x n + 1 ∥ c ≤ ∥ ( 1 − α n ) ( u n − x n ) + α n ( T u n − T z n ) ∥ c ≤ ( 1 − α n ) ∥ u n − x n ∥ c + α n ∥ T u n − T z n ∥ c ≤ ( 1 − α n ) ∥ u n − x n ∥ c + α n δ ∥ u n − z n ∥ c + 2 α n δ ∥ u n − T u n ∥ c .
(14)

Using (2) with x:= u n , y:= x n , we have

∥ u n − z n ∥ c ≤ ∥ ( 1 − β n ) ( u n − x n ) + β n ( u n − T x n ) ∥ c ≤ ( 1 − β n ) ∥ u n − x n ∥ c + β n ∥ u n − T x n ∥ c ≤ ( 1 − β n ) ∥ u n − x n ∥ c + β n ∥ u n − T u n ∥ c + β n ∥ T u n − T x n ∥ c ≤ ( 1 − β n ) ∥ u n − x n ∥ c + β n ∥ u n − T u n ∥ c + β n δ ∥ u n − x n ∥ c + 2 β n δ ∥ u n − T u n ∥ c = ( 1 − β n ( 1 − δ ) ) ∥ u n − x n ∥ c + β n ( 1 + 2 δ ) ∥ u n − T u n ∥ c .
(15)

Relations (14) and (15) lead to

∥ u n + 1 − x n + 1 ∥ c ≤ ( 1 − α n ) ∥ u n − x n ∥ c + α n δ ( 1 − β n ( 1 − δ ) ) ∥ u n − x n ∥ c + α n β n δ ( 1 + 2 δ ) ∥ u n − T u n ∥ + 2 α n δ ∥ u n − T u n ∥ c = ( 1 − α n ( 1 − δ ( 1 − β n ( 1 − δ ) ) ) ) ∥ u n − x n ∥ c + α n δ ( β n ( 1 + 2 δ ) + 2 ) ∥ u n − T u n ∥ c .

Put

a n : = ∥ u n − x n ∥ c , b n : = α n δ ( β n ( 1 + 2 δ ) + 2 ) ∥ u n − T u n ∥ c , h : = 1 − sup n α n .

Note that lim n → ∞ ∥ u n − q ∥ c =0, T is Zamfirescu and q∈F(T). By (2) we obtain

0≤ ∥ u n − T u n ∥ c ≤ ∥ u n − q ∥ c + ∥ q − T u n ∥ c ≤(δ+1) ∥ u n − q ∥ c .

Hence lim n → ∞ ∥ u n − T u n ∥ c =0; that is, lim n → ∞ b n =0. Lemma 1.1 leads to

lim n → ∞ ∥ u n − x n ∥ c =0.

Now we will prove that (ii)⇒(i). Using (2) with x:= z n , y:= u n , we obtain

∥ x n + 1 − u n + 1 ∥ c ≤ ∥ ( 1 − α n ) ( x n − u n ) + α n ( T z n − T u n ) ∥ c ≤ ( 1 − α n ) ∥ x n − u n ∥ c + α n ∥ T z n − T u n ∥ c ≤ ( 1 − α n ) ∥ x n − u n ∥ c + α n δ ∥ z n − u n ∥ c + 2 α n δ ∥ z n − T z n ∥ c .
(16)

Also, the following relation holds:

∥ z n − u n ∥ c ≤ ∥ ( 1 − β n ) ( x n − u n ) + β n ( T x n − u n ) ∥ c ≤ ( 1 − β n ) ∥ x n − u n ∥ c + β n ∥ T x n − u n ∥ c ≤ ( 1 − β n ) ∥ x n − u n ∥ c + β n ∥ T x n − x n ∥ c + β n ∥ x n − u n ∥ c ≤ ∥ x n − u n ∥ c + β n ∥ T x n − x n ∥ c .
(17)

Substituting (17) in (16), we obtain

∥ x n + 1 − u n + 1 ∥ c ≤ ( 1 − α n ) ∥ x n − u n ∥ c + α n δ ( ∥ x n − u n ∥ c + β n ∥ T x n − x n ∥ c ) + 2 α n δ ∥ z n − T z n ∥ ≤ ( 1 − ( 1 − δ ) α n ) ∥ x n − u n ∥ c + α n β n δ ∥ T x n − x n ∥ c + 2 α n δ ∥ z n − T z n ∥ c .
(18)

Put

a n : = ∥ x n − u n ∥ c , b n : = α n β n δ ∥ T x n − x n ∥ c + 2 α n δ ∥ z n − T z n ∥ c , h : = 1 − sup n α n .

From lim n → ∞ ∥ x n − q ∥ c =0, T is Zamfirescu, q∈F(T) and by (2) we obtain

0≤ ∥ x n − T x n ∥ c ≤ ∥ x n − q ∥ c + ∥ q − T x n ∥ c ≤(δ+1) ∥ x n − q ∥ c ,

and

0 ≤ ∥ z n − T z n ∥ c ≤ ∥ z n − q ∥ c + ∥ q − T z n ∥ c ≤ ( δ + 1 ) ∥ z n − q ∥ c ≤ ( δ + 1 ) [ ( 1 − β n ) ∥ x n − q ∥ c + β n ∥ q − T x n ∥ c ] ≤ ( δ + 1 ) [ ( 1 − β n ) ∥ x n − q ∥ c + δ β n ∥ q − x n ∥ c ] ≤ ( δ + 1 ) ( 1 − β n ( 1 − δ ) ) ∥ q − x n ∥ c .

Hence lim n → ∞ ∥ x n − T x n ∥ c =0 and lim n → ∞ ∥ z n − T z n ∥ c =0; that is, lim n → ∞ b n =0.

Lemma 1.1 and (18) lead to lim n → ∞ ∥ x n − u n ∥ c =0. Thus, we get

∥q− u n ∥≤ ∥ x n − u n ∥ c + ∥ x n − q ∥ c →0,

and the proof is complete. □

Corollary 2.4 Let X be a cone Banach space, P be a normal cone and T be a Zamfirescu self-map of X. Then T has a unique fixed point in X and the Picard, Mann, Krasnoselskij and Ishikawa iterative sequences converge to the fixed point of T.

Corollary 2.5 Let X be a cone Banach space, P be a normal cone and T be a quasi-contraction mapping of X with 0<λ<1/2. Then T has a unique fixed point in X and the Picard, Mann, Krasnoselskij and Ishikawa iterative sequences converge to the fixed point of T.

Theorem 2.6 Let X be a cone Banach space and P be a normal cone. Suppose that T is a self-map of X and that every Picard and Mann iteration converges to a fixed point of T. Then the following are equivalent:

  1. (i)

    the Picard iteration is semistable with respect to T,

  2. (ii)

    the Mann iteration is semistable with respect to T.

Proof Suppose that q is a fixed point of T such that every Picard and Mann iteration converges to q. Let { y n } be an arbitrary sequence in X. For (i)⇒(ii), let

lim n → ∞ ∥ y n + 1 − ( 1 − α n ) y n − α n T y n ∥ c =0

and ∥ y n − T y n ∥ c =o( t n ) for some { t n }⊆ R + . We have

∥ y n + 1 − T y n ∥ c ≤ ∥ y n + 1 − ( 1 − α n ) y n − α n T y n ∥ c +(1− α n ) ∥ y n − T y n ∥ c →0

as n→∞. By assumption (i), we get lim n → ∞ y n =q.

Conversely, we prove (ii)⇒(i). Let lim n → ∞ ∥ y n + 1 − T y n ∥ c =0 and ∥ y n − T y n ∥ c =o( t n ) for some { t n }⊆ R + . We have

∥ y n + 1 − ( 1 − α n ) y n − α n T y n ∥ c ≤ ∥ y n + 1 − T y n ∥ c + ( 1 − α n ) ∥ y n + 1 − y n ∥ c + ( 1 − α n ) ∥ y n + 1 − T y n ∥ c ≤ ( 2 − α n ) ∥ y n + 1 − T y n ∥ c + ( 1 − α n ) ∥ y n + 1 − y n ∥ c ≤ ( 2 − α n ) ∥ y n + 1 − T y n ∥ c + ( 1 − α n ) ( ∥ y n + 1 − T y n ∥ c + ∥ y n − T y n ∥ c ) = ( 3 − 2 α n ) ∥ y n + 1 − T y n ∥ c + ( 1 − α n ) ∥ y n − T y n ∥ c → 0

as n→∞. Thus lim n → ∞ y n =q and so the Picard iteration is semistable with respect to T. □

Theorem 2.7 Let X be a cone Banach space and P be a normal cone. Suppose that T is a self-map of X and that every Picard and Krasnoselskij iteration converges to a fixed point of T. Then the following are equivalent:

  1. (i)

    the Picard iteration is semistable with respect to T,

  2. (ii)

    the Krasnoselskij iteration is semistable with respect to T.

Proof In Theorem 2.7, put α n =λ. Then by the same method used in the proof of Theorem 2.7, we can complete the proof. □

Theorem 2.8 Let X be a cone Banach space and P be a normal cone. Suppose that { α n } in Ishikawa iteration procedure satisfies lim n → ∞ α n =0, T is a self-map of X with bounded above range and also every Picard and Ishikawa iterative sequence converges to a fixed point of T. Then the following are equivalent:

  1. (i)

    the Picard iteration is semistable with respect to T,

  2. (ii)

    the Ishikawa iteration is semistable with respect to T.

Proof Suppose that q is a fixed point of T such that every Picard and Ishikawa iterative sequence converges to q. Let { y n }⊆X and { β n }⊆[0,1) be given and set

s n : = ( 1 − β n ) y n + β n T y n , γ n : = ∥ y n + 1 − T y n ∥ c , δ n : = ∥ y n + 1 − ( 1 − α n ) y n − α n T s n ∥ c , M : = sup { N ( T x ) : x ∈ X } ,

where N is the norm type with respect to ( ∥ â‹… ∥ c ). It is assumed that T has bounded above range and so, by Lemma 1.7, M<∞.

Now we prove that (i)⇒(ii). Let lim n → ∞ δ n =0 and ∥ y n − T y n ∥ c =o( t n ) for some { t n }⊆ R + . Observe that

γ n = ∥ y n + 1 − T y n ∥ c ≤ ∥ y n + 1 − ( 1 − α n ) y n − α n T s n ∥ c + ∥ ( 1 − α n ) y n + α n T s n − T y n ∥ c ≤ ∥ y n + 1 − ( 1 − α n ) y n − α n T s n ∥ c + α n ( ∥ y n ∥ c + ∥ T s n ∥ c ) + ∥ y n − T y n ∥ c ≤ δ n + α n ( ∥ y n − T y n ∥ c + ∥ T y n ∥ c + ∥ T s n ∥ c ) + ∥ y n − T y n ∥ c ≤ δ n + α n ( ∥ T y n ∥ c + ∥ T s n ∥ c ) + ( 1 + α n ) ∥ y n − T y n ∥ c .

By Lemma 1.7 we have

N ( γ n ) ≤ k N ( δ n + α n ( ∥ T y n ∥ c + ∥ T s n ∥ c ) + ( 1 + α n ) ∥ y n − T y n ∥ c ) ≤ k N ( δ n ) + 2 k M α n + k ( 1 + α n ) N ( y n − T y n ) → 0

as n→∞ (here k is the normal constant of P). So, by Lemma 1.9, lim n → ∞ γ n =0 and the condition (i) assures that lim n → ∞ y n =q. Thus the Ishikawa iteration is semistable with respect to T.

Conversely, we prove (ii)⇒(i). Let lim n → ∞ γ n =0 and ∥ y n − T y n ∥ c =o( t n ) for some { t n }⊆ R + . We have

δ n = ∥ y n + 1 − ( 1 − α n ) y n − α n T s n ∥ c ≤ ∥ y n + 1 − T y n ∥ c + ∥ T y n − ( 1 − α n ) y n − α n T s n ∥ c = ∥ y n + 1 − T y n ∥ c + ∥ T y n − ( 1 − α n ) y n − α n T s n + α n T y n − α n T y n ∥ c ≤ γ n + ( 1 − α n ) ∥ y n − T y n ∥ c + α n ∥ T y n − T s n ∥ c .

By Lemmas 1.7 and 1.9, we get

N ( δ n ) ≤ k N ( γ n + ( 1 − α n ) ∥ y n − T y n ∥ c + α n ∥ T y n − T s n ∥ c ) ≤ k N ( γ n ) + k ( 1 − α n ) N ( y n − T y n ) + k α n N ( T y n − T s n ) ≤ k N ( γ n ) + k ( 1 − α n ) N ( y n − T y n ) + 2 k M α n → 0

as n→∞, where k is the normal constant of P. So lim n → ∞ δ n =0 and by assumption (ii), we have lim n → ∞ y n =q. Thus the Picard iteration is semistable with respect to T. □

Theorem 2.9 Let X be a cone Banach space and P be a normal cone. Suppose that { α n } in Mann and Ishikawa procedures satisfies lim n → ∞ α n =0, T is a self-map of X with bounded above range and also every Mann and Ishikawa iterative sequence converges to a fixed point of T. Then the following are equivalent:

  1. (i)

    the Mann iteration is T-stable,

  2. (ii)

    the Ishikawa iteration is T-stable.

Proof Let q be a fixed point of T and every Mann and Ishikawa iterative sequence converge to q. Suppose that k is the normal constant of P and put

M:=sup { N ( T x ) : x ∈ X } ,

where N is the norm type with respect to ∥ ⋅ ∥ c . Since T has bounded above range, then M<∞. Now let { y n } be an arbitrary sequence in X. We prove (i)⇒(ii). For this suppose that

lim n → ∞ ∥ y n + 1 − ( 1 − α n ) y n − α n T s n ∥ c =0,

where s n =(1− β n ) y n + β n T y n and { β n }⊆[0,1). We show that lim n → ∞ y n =q. Note that

∥ y n + 1 − ( 1 − α n ) y n − α n T y n ∥ c ≤ ∥ y n + 1 − ( 1 − α n ) y n − α n T s n ∥ c + ∥ α n T s n − α n T y n ∥ c .

By Lemma 1.7 and Lemma 1.9, we obtain

N ( y n + 1 − ( 1 − α n ) y n − α n T y n ) ≤kN ( y n + 1 − ( 1 − α n ) y n − α n T s n ) +2kM α n →0,

as n→∞ and so

lim n → ∞ ∥ y n + 1 − ( 1 − α n ) y n − α n T y n ∥ c =0.

Condition (i) assures that lim n → ∞ y n =q. Thus the Ishikawa iteration is T-stable.

Conversely, we prove (ii)⇒(i). Suppose that

lim n → ∞ ∥ y n + 1 − ( 1 − α n ) y n − α n T y n ∥ c =0.

We show that lim n → ∞ y n =q. Put

s n :=(1− β n ) y n + β n T y n ,

and observe that

∥ y n + 1 − ( 1 − α n ) y n − α n T s n ∥ c ≤ ∥ y n + 1 − ( 1 − α n ) y n − α n T y n ∥ c + ∥ α n T y n − α n T s n ∥ c .

By Lemma 1.7 and Lemma 1.9, we obtain

N ( y n + 1 − ( 1 − α n ) y n − α n T s n ) ≤kN ( y n + 1 − ( 1 − α n ) y n − α n T y n ) +2kM α n →0

as n→∞ and hence lim n → ∞ ∥ y n + 1 − ( 1 − α n ) y n − α n T s n ∥ c =0. By assumption (ii), we get lim n → ∞ y n =q and the proof is complete. □

Corollary 2.10 Let (X, ∥ ⋅ ∥ c ) be a cone normed space, P be a normal cone and T be a self-map of X and q∈F(T). Suppose that there exist nonnegative real numbers a and b with b<1 such that

∥ T x − q ∥ c ≤a ∥ x − T x ∥ c +b ∥ x − q ∥ c

for each x∈X. Assume that for { α n }⊆(0,1), lim n → ∞ α n =0, and let every Picard, Mann, Krasnoselskij and Ishikawa iterative sequence converge to q. Then the Picard, Mann and Krasnoselskij iterations are T-semistable. Moreover, if T has bounded above range, then the Ishikawa iteration is T-semistable.

Corollary 2.11 Let (X, ∥ ⋅ ∥ c ) be a cone normed space, P be a normal cone and T be a f-Zamfirescu or quasi-contraction self-map of X and q∈F(T). Assume that { α n } in Mann and Ishikawa iteration procedures satisfies { α n }⊆(0,1) and lim n → ∞ α n =0. Also, let every Picard, Mann, Krasnoselskij and Ishikawa iterative sequence converge to q. Then the Picard, Mann and Krasnoselskij iterations are T-semistable. Moreover, if T has bounded above range, then the Ishikawa iteration is T-semistable.

References

  1. Asadi M, Soleimani H, Vaezpour SM, Rhoades BE: On T -stability of Picard iteration in cone metric spaces. Fixed Point Theory Appl. 2009., 2009: Article ID 751090

    Google Scholar 

  2. Yadegarnejad A, Jahedi S, Yousefi B, Vaezpour SM: Semistability of iterations in cone spaces. Fixed Point Theory Appl. 2011. 10.1186/1687-1812-2011-70

    Google Scholar 

  3. Turkoglu D, Abuloha M: Cone metric spaces and fixed point theorems in diametrically contractive mappings. Acta Math. Sin. Engl. Ser. 2010, 26(3):489–496. 10.1007/s10114-010-8019-5

    Article  MathSciNet  Google Scholar 

  4. Huang LG, Zhang X: Cone metric spaces and fixed point theorems of contractive mappings. J. Math. Anal. Appl. 2007, 332: 1468–1476. 10.1016/j.jmaa.2005.03.087

    Article  MathSciNet  Google Scholar 

  5. Rezapour S, Hamlbarani R: Cone metric spaces and fixed point theorems of contractive mappings. J. Math. Anal. Appl. 2008, 345: 719–724. 10.1016/j.jmaa.2008.04.049

    Article  MathSciNet  Google Scholar 

  6. Azadi Kenary H, Young Jang S, Park C: A fixed point approach to the Hyers-Ulam stability of a functional equation in various normed spaces. Fixed Point Theory Appl. 2011. 10.1186/1687-1812-2011-67

    Google Scholar 

  7. Azadi Kenary H, Je Cho Y: Stability of mixed additive-quadratic Jensen type functional equation in various spaces. Comput. Math. Appl. 2011, 61: 2407–2724.

    Article  Google Scholar 

  8. Azadi Kenary H: Random approximation of an additive functional equation of m -Appollonius type. Acta Math. Sci. 2012, 32B(5):1813–1825.

    Article  MathSciNet  Google Scholar 

  9. Azadi Kenary H, Rezaei H, Talebzadeh S, Park C:Stability of the Jensen equation in C ∗ -algebras: a fixed point approach. Adv. Differ. Equ. 2012. 10.1186/1687-1847-2012-17

    Google Scholar 

  10. Azadi Kenary H, Rezaei H, Talebzadeh S, Jin Lee S: Stabilities of cubic mappings in various normed spaces: direct and fixed point methods. J. Appl. Math. 2012., 2012: Article ID 546819 10.1155/2012/546819

    Google Scholar 

  11. Geoffroy MH: Stability of Mann’s iterates under metric regularity. Appl. Math. Comput. 2009, 215: 686–694. 10.1016/j.amc.2009.05.057

    Article  MathSciNet  Google Scholar 

  12. Ilic D, Rakocevic V: Quasi-contraction on cone metric space. Appl. Math. Lett. 2009, 22: 728–731. 10.1016/j.aml.2008.08.011

    Article  MathSciNet  Google Scholar 

  13. Ioana T: On the weak stability of Picard iteration for some contractive type mappings. An. Univ. Craiova, Ser. Mat. Inform. 2010, 37(2):106–114.

    MathSciNet  Google Scholar 

  14. Khamsi MA: Remarks on cone metric spaces and fixed point theorems of contractive mappings. Fixed Point Theory Appl. 2010., 2010: Article ID 315398

    Google Scholar 

  15. Qing Y, Rhoades BE: T -Stability of Picard iteration in metric spaces. Fixed Point Theory Appl. 2008., 2008: Article ID 418971

    Google Scholar 

  16. Rezapour SH, Haghi RH, Rhoades BE: Some results about T -stability and almost T -stability. Fixed Point Theory 2011, 12(1):179–186.

    MathSciNet  Google Scholar 

  17. Rhoades BE, Soltuz SM: The equivalence between the T -stabilities of Mann and Ishikawa iterations. J. Math. Anal. Appl. 2006, 318: 472–475. 10.1016/j.jmaa.2005.05.066

    Article  MathSciNet  Google Scholar 

  18. Shenghua W, Baohua G: Distance in cone metric spaces and common fixed point theorems. Appl. Math. Lett. 2011, 24: 1735–1739. 10.1016/j.aml.2011.04.031

    Article  MathSciNet  Google Scholar 

  19. Soltuz SM: The equivalence of Picard, Mann and Ishikawa iterations dealing with quasi-contractive operators. Math. Commun. 2005, 10: 81–88.

    MathSciNet  Google Scholar 

  20. Soltuz SM: The equivalence between T -stability of the Krasnoselskij and the Mann iterations. Fixed Point Theory Appl. 2007., 2007: Article ID 60732

    Google Scholar 

  21. Soltuz SM: The equivalence between the T -stabilities of Picard-Banach and Mann-Ishikawa iterations. Appl. Math. E-Notes 2008, 8: 109–114.

    MathSciNet  Google Scholar 

  22. Xue Z: Remarks of equivalence among Picard, Mann, and Ishikawa iterations in normed spaces. Fixed Point Theory Appl. 2007., 2007: Article ID 61434

    Google Scholar 

  23. Yousefi B, Kashkooly AI: On the eleventh question of Allen Shields. Fixed Point Theory Appl. 2011. 10.1186/1687-1812-2011-16

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Choonkil Park.

Additional information

Competing interests

The authors declare that they have no competing interests.

Authors’ contributions

All authors contributed equally and significantly in writing this paper. All authors read and approved the final manuscript.

An erratum to this article is available at http://dx.doi.org/10.1186/1687-1812-2014-84.

Rights and permissions

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

Reprints and permissions

About this article

Cite this article

Yousefi, B., Yadegarnejad, A., Azadi Kenary, H. et al. Equivalence of semistability of Picard, Mann, Krasnoselskij and Ishikawa iterations. Fixed Point Theory Appl 2014, 5 (2014). https://doi.org/10.1186/1687-1812-2014-5

Download citation

  • Received:

  • Accepted:

  • Published:

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

Keywords