Skip to main content

Some results on parallel iterative algorithms for strictly pseudocontractive mappings

Abstract

In this paper, a parallel iterative algorithm with mixed errors is investigated. Strong and weak convergence theorems of common fixed points of a finite family of strictly pseudocontractive mappings are established in a real Banach space.

AMS Subject Classification:47H05, 47H09, 47J25.

1 Introduction and preliminaries

Throughout this paper, we denote by E and E ∗ a real Banach space and a dual space of E, respectively. Let 〈⋅,⋅〉 denote the pairing between E and E ∗ . The normalized duality mapping J:E→ 2 E ∗ is defined by

J(x)= { f ∈ E ∗ : 〈 x , f 〉 = ∥ x ∥ 2 = ∥ f ∥ 2 } ,∀x∈E.

In the sequel, we use j to denote the single-valued normalized duality mapping. Let K be a nonempty subset of E and T:K→K be a mapping. Recall the following.

T is said to be Lipschitz if there exists a positive constant L such that

∥Tx−Ty∥≤L∥x−y∥,∀x,y∈K.

T is said to be nonexpansive if

∥Tx−Ty∥≤∥x−y∥,∀x,y∈K.

T is said to be strictly pseudocontractive in the terminology of Browder and Petryshyn [1] if there exists λ>0 such that

〈 T x − T y , j ( x − y ) 〉 ≤ ∥ x − y ∥ 2 −λ ∥ ( x − T x ) − ( y − T y ) ∥ 2 ,∀x,y∈K,
(1.1)

for some j(x−y)∈J(x−y). It is clear that the class of strictly pseudocontractive mappings includes the class of nonexpansive mappings as a special case. It is also clear that (1.1) is equivalent to the following:

〈 ( I − T ) x − ( I T ) y , j ( x − y ) 〉 ≥λ ∥ ( I − T ) x − ( I − T ) y ∥ 2 ,∀x,y∈K.
(1.2)

We know that strictly pseudocontractive mappings are Lipschitz continuous. Indeed, we find from (1.2) that

∥Tx−Ty∥≤ 1 + λ λ ∥x−y∥,∀x,y∈K.

T is said to be strongly pseudocontractive if there exists k∈(0,1) such that

〈 T x − T y , j ( x − y ) 〉 ≤k ∥ x − y ∥ 2 ,∀x,y∈K,
(1.3)

for some j(x−y)∈J(x−y). T is said to be pseudocontractive if there exists some j(x−y)∈J(x−y) such that

〈 T x − T y , j ( x − y ) 〉 ≤ ∥ x − y ∥ 2 ,∀x,y∈K.
(1.4)

T is said to be Lipschitz if there exists a positive constant L such that

∥Tx−Ty∥≤L∥x−y∥,∀x,y∈K.

It is well known that [2] (1.4) is equivalent to the following:

∥x−y∥≤ ∥ x − y + s [ ( I − T ) x − ( I − T ) y ] ∥ ,∀s>0.
(1.5)

We remark that the class of strongly pseudocontractive mappings is independent of the class of strictly pseudocontractive mappings. This can be seen from the following examples.

Example 1.1 [3]

Take K=(0,∞) and define T:K→K by

Tx= x 2 1 + x .

Then T is a strictly pseudocontractive mapping but not a strongly pseudocontractive mapping.

Example 1.2 [3]

Take K=R and define T:K→K by

Tx={ 1 , x ∈ ( − ∞ , − 1 ) , 1 − ( 1 + x ) 2 , x ∈ [ − 1 , 0 ) , − 1 − ( x − 1 ) 2 , x ∈ [ 0 , 1 ] , 1 , x ∈ ( 1 , ∞ ) .

Example 1.3 [4]

Take E= R 2 , B={x∈ R 2 :∥x∥≤1}, B 1 ={x∈B:∥x∥≤ 1 2 }, B 2 ={x∈B: 1 2 ≤∥x∥≤1}. If x=(a,b)∈E, we define x ⊥ to be (b,−a)∈E. Define T:B→B by

Tx={ x + x ⊥ , x ∈ B 1 , x ∥ x ∥ − x + x ⊥ , x ∈ B 2 .

Then T is a Lipschitz pseudocontractive mapping but not a strictly pseudocontractive mapping.

Let U={x∈E:∥x∥=1}. E is said to be smooth or is said to have a Gâteaux differentiable norm if the limit

lim t → 0 ∥ x + t y ∥ − ∥ x ∥ t

exists for each x,y∈U. E is said to have a uniformly Gâteaux differentiable norm if for each y∈U, the limit is attained uniformly for all x∈U. E is said to be uniformly smooth or is said to have a uniformly Fréchet differentiable norm if the limit is attained uniformly for x,y∈U. It is known that if the norm of E is uniformly Gâteaux differentiable, then the duality mapping J is single valued and uniformly norm to weak∗ continuous on each bounded subset of E.

In 2001, Xu and Ori [5], in the framework of Hilbert spaces, introduced the following implicit iteration process for a finite family of nonexpansive mappings { T 1 , T 2 ,…, T N } with { α n } a real sequence in (0,1) and an initial point x 0 ∈C:

which can written in the following compact form:

x n = α n x n − 1 +(1− α n ) T n x n ,∀n≥1,
(1.6)

where T n = T n ( mod N ) (here the modN takes values in {1,2,…,N}).

They obtained the following weak convergence theorem.

Theorem XO Let H be a real Hilbert space, K be a nonempty closed convex subset of H, and T i :K→K be a nonexpansive mapping such that F= ⋂ i = 1 N F( T i )≠∅. Let { x n } be defined by (1.6). If { α n } is chosen so that α n →0 as n→∞, then { x n } converges weakly to a common fixed point of the family of { T i } i = 1 N .

They further remarked that it is yet unclear what assumptions on the mappings and/or the parameters { α n } are sufficient to guarantee the strong convergence of the sequence { x n }.

In 2004, Osilike [6] further extended the above results from Hilbert spaces to Banach spaces. To be more precise, he obtain the following results.

Theorem O Let H be a real Hilbert space, K be a nonempty closed convex subset of H, and T i :K→K be a strictly pseudocontractive mapping such that F= ⋂ i = 1 N F( T i )≠∅. Let { x n } be defined by (1.6). If { α n } is chosen so that α n →0 as n→∞, then { x n } converges weakly to a common fixed point of the family of { T i } i = 1 N .

Subsequently, many authors have investigated the fixed point problem of strictly pseudocontractive mappings based on an implicit or non-implicit iterative algorithm in Banach spaces; see [7–32] and the references therein.

In 2007, Acedo and Xu proposed a parallel iterative algorithm for strictly pseudocontractive mappings in the framework of Hilbert spaces. Weak and strong convergence theorems for common fixed points of a family of strictly pseudocontractive mappings were established; see [26] for more details and the reference therein.

In this paper, motivated by the above results, we consider an implicitly parallel iterative algorithm for a finite family of strictly pseudocontractive mappings. Weak and strong convergence theorems are established in the framework of Banach spaces.

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

Recall that the space E is said to satisfy Opial’s condition [33] if, for each sequence { x n } in E, the convergence x n →x weakly implies that

lim inf n → ∞ ∥ x n −x∥< lim inf n → ∞ ∥ x n −y∥,∀y∈E(y≠x).

Recall that the mapping T:K→K is semicompact if any sequence { x n } in K satisfying lim n → ∞ ∥ x n −T x n ∥=0 has a convergent subsequence.

Lemma 1.1 [34]

Let E be a real Banach space, K be a nonempty closed convex subset of E, and T:K→K be a continuous strongly pseudocontractive mapping. Then T has a unique fixed point in K.

Lemma 1.2 [11]

Let E be a smooth Banach space and K be a nonempty convex subset of E. Let r≥1 be some integer. Let T i :K→K be a strictly pseudocontractive mapping. Assume that ⋂ i = 1 r F( T i ) is not empty. Assume that { μ i } i = 1 r is a positive sequence such that ∑ i = 1 r μ i =1. Then ⋂ i = 1 r F( T i )=F( ∑ i = 1 r μ i T i ).

Lemma 1.3 [35]

Let { a n }, { b n }, and { c n } be three nonnegative sequences satisfying the following condition:

a n + 1 ≤(1+ b n ) a n + c n ,∀n≥ n 0 ,

where n 0 is some nonnegative integer, ∑ n = 1 ∞ b n <∞, and ∑ n = 1 ∞ c n <∞. Then the limit lim n → ∞ a n exists.

2 Main results

Theorem 2.1 Let E be a smooth and reflexive Banach space which also satisfies Opial’s condition and K be a nonempty closed convex subset of E. Let N≥1 be some positive integer. Let T m :K→K, where m∈{1,…,N}, be a λ i -strictly pseudocontractive mapping and { u n } be a bounded sequence in K. Let { x n } n = 0 ∞ be a sequence generated in the following algorithm:

x 0 ∈K, x n = α n x n − 1 + β n ∑ m = 1 N δ m T m x n + γ n u n ,n≥1,
(2.1)

where { α n }, { β n }, { γ n }, and { δ m } are real number sequences in [0,1]. Assume that F:= ⋂ m = 1 N F( T m )≠∅, and the above control sequences satisfy the following restrictions:

  1. (a)

    ∑ m = 1 N δ m = α n + β n + γ n =1;

  2. (b)

    ∑ n = 1 ∞ γ n <∞;

  3. (c)

    0<a≤ α n ≤b<1, where a and b are constants.

Then { x n } converges weakly to some point in F.

Proof Put T:= ∑ m = 1 N δ m T m . We show that T is λ-strictly pseudocontractive mapping, where λ:=min{ λ m :1≤m≤N}. Notice that

This proves that T is λ-strictly pseudocontractive mapping. Next, we show that the implicit iterative algorithm (2.1) is well defined for the strictly pseudocontractive mappings. Define a mapping

P n (x)= α n x n − 1 + β n ∑ m = 1 N δ m T m x+ γ n u n ,∀n≥1.

It follows that

This shows that P n is strongly pseudocontractive. Since strictly pseudocontractive mappings are Lipschitz continuous, we see that P n is also continuous. In view of Lemma 1.1, we see that P n has a unique fixed point. This proves that the implicit iterative algorithm (2.1) is well defined. In view of Lemma 1.2, we see that F=F( ∑ m = 1 N δ m F( T m ))=F(T). Fixing p∈F, we see that

∥ x n − p ∥ 2 = α n 〈 x n − 1 − p , j ( x − p ) 〉 + β n 〈 ∑ m = 1 N δ m T m x n − p , j ( x − y ) 〉 + γ n 〈 u n − p , j ( x − y ) 〉 = α n 〈 x n − 1 − p , j ( x − p ) 〉 + β n 〈 T x n − p , j ( x − p ) 〉 + γ n 〈 u n − p , j ( x − p ) 〉 ≤ α n ∥ x n − 1 − p ∥ ∥ x − p ∥ + β n ∥ x − p ∥ 2 − β n λ ∥ x n − T x n ∥ 2 + γ n ∥ u n − p ∥ ∥ x − p ∥ .

It follows that

∥ x n −p∥≤ α n ∥ x n − 1 −p∥+ β n ∥ x n −p∥− β n λ ∥ x n − T x n ∥ 2 + γ n ∥ u n −p∥.

This implies, from the restriction (c), that

∥ x n −p∥≤∥ x n − 1 −p∥+ γ n M− β n λ ∥ x n − T x n ∥ 2 ,
(2.2)

where M is an appropriate constant such that M≥ sup n ≥ 1 { ∥ u n − p ∥ a }. In view of Lemma 1.3, we obtain that lim n → ∞ ∥ x n −p∥ exits. Thanks to (2.2), we find from the restrictions (b) and (c) that

lim n → ∞ ∥ x n −T x n ∥=0.
(2.3)

Since the space is reflexive and { x n } is bounded, there exists a subsequence { x n i } of the sequence { x n }, which weakly converges to some x∈. In view of Lemma 1.4, we find that x∈F(T)=F.

Finally, we show the sequence { x n } weakly converges to x. Suppose the contrary, then there exists some subsequence { x n j } of the sequence { x n } which weakly converges to x ′ ≠x∈C. It also follows from Lemma 1.4 that x ′ ∈F. Since lim n → ∞ ∥ x n −p∥ exits for any p∈F. Put

lim n → ∞ ∥ x n −x∥=d, lim n → ∞ ∥ x n − x ′ ∥ = d ′ .

Since the space satisfies Opial’s condition, we see that

d = lim n → ∞ ∥ x n − x ∥ = lim inf i → ∞ ∥ x n i − x ∥ < lim inf i → ∞ ∥ x n i − x ′ ∥ = lim n → ∞ ∥ x n − x ′ ∥ = lim inf j → ∞ ∥ x n j − x ′ ∥ < lim inf j → ∞ ∥ x n j − x ∥ = lim n → ∞ ∥ x n − x ∥ = d .

This is a contradiction. This shows that x= x ′ . This proves that the sequence { x n } converges weakly to x∈F. This completes the proof. □

Corollary 2.2 Let E be a smooth and reflexive Banach space which also satisfies Opial’s condition and let K be a nonempty closed convex subset of E. Let N≥1 be some positive integer. Let T m :K→K, where m∈{1,…,N}, be a λ i -strictly pseudocontractive mapping. Let { x n } n = 0 ∞ be a sequence generated in the following algorithm:

x 0 ∈K, x n = α n x n − 1 +(1− α n ) ∑ m = 1 N δ m T m x n ,n≥1,

where { α n } and { δ m } are real number sequences in [0,1]. Assume that F:= ⋂ m = 1 N F( T m )≠∅ and the above control sequences satisfy the following restrictions:

  1. (a)

    ∑ m = 1 N δ m =1;

  2. (b)

    0<a≤ α n ≤b<1, where a and b are constants.

Then { x n } converges weakly to some point in F.

In Hilbert spaces, we find from Theorem 2.1 the following.

Corollary 2.3 Let E be a Hilbert space and K be a nonempty closed convex subset of E. Let N≥1 be some positive integer. Let T m :K→K, where m∈{1,…,N}, be a λ i -strictly pseudocontractive mapping and { u n } be a bounded sequence in K. Let { x n } n = 0 ∞ be a sequence generated in the following algorithm:

x 0 ∈K, x n = α n x n − 1 + β n ∑ m = 1 N δ m T m x n + γ n u n ,n≥1,

where { α n }, { β n }, { γ n }, and { δ m } are real number sequences in [0,1]. Assume that F:= ⋂ m = 1 N F( T m )≠∅ and the above control sequences satisfy the following restrictions:

  1. (a)

    ∑ m = 1 N δ m = α n + β n + γ n =1;

  2. (b)

    ∑ n = 1 ∞ γ n <∞;

  3. (c)

    0<a≤ α n ≤b<1, where a and b are constants.

Then { x n } converges weakly to some point in F.

Next, we give a strong convergence theorem.

Theorem 2.4 Let E be a smooth and reflexive Banach space and K be a nonempty closed convex subset of E. Let N≥1 be some positive integer. Let T m :K→K, where m∈{1,…,N}, be a λ i -strictly pseudocontractive mapping and { u n } be a bounded sequence in K. Let { x n } n = 0 ∞ be a sequence generated in the following algorithm:

x 0 ∈K, x n = α n x n − 1 + β n ∑ m = 1 N δ m T m x n + γ n u n ,n≥1,

where { α n }, { β n }, { γ n }, and { δ m } are real number sequences in [0,1]. Assume that F:= ⋂ m = 1 N F( T m )≠∅ and the above control sequences satisfy the following restrictions:

  1. (a)

    ∑ m = 1 N δ m = α n + β n + γ n =1;

  2. (b)

    ∑ n = 1 ∞ γ n <∞;

  3. (c)

    0<a≤ α n ≤b<1, where a and b are constants.

If ∑ m = 1 N δ m T m is semicompact, then { x n } converges strongly to some point in F.

Proof Since ∑ m = 1 N δ m T m is semicompact, we see that there exists a subsequence { x n i } of { x n } such that x n i → x ∗ . Notice that

∥ x ∗ − ∑ m = 1 N δ m T m x ∗ ∥ ≤ ∥ x ∗ − x n i ∥ + ∥ x n i − ∑ m = 1 N δ m T m x n i ∥ + ∥ ∑ m = 1 N δ m T m x n i − ∑ m = 1 N δ m T m x n i x ∗ ∥ .

Since ∑ m = 1 N δ m T m is Lipschitz continuous, we see from (2.3) that x ∗ ∈F( ∑ m = 1 N δ m T m )=F. From Theorem 2.1, we know that lim n → ∞ ∥ x n −p∥ exits for any p∈F. That is, lim n → ∞ ∥ x n − x ∗ ∥ exits. In view of x n i → x ∗ , we find that

lim n → ∞ ∥ x n − x ∗ ∥ =0.

This completes the proof. □

Corollary 2.5 Let E be a smooth and reflexive Banach space and K be a nonempty closed convex subset of E. Let N≥1 be some positive integer. Let T m :K→K, where m∈{1,…,N}, be a λ i -strictly pseudocontractive mapping. Let { x n } n = 0 ∞ be a sequence generated in the following algorithm:

x 0 ∈K, x n = α n x n − 1 +(1− α n ) ∑ m = 1 N δ m T m x n ,n≥1,

where { α n } and { δ m } are real number sequences in [0,1]. Assume that F:= ⋂ m = 1 N F( T m )≠∅ and the above control sequences satisfy the following restrictions:

  1. (a)

    ∑ m = 1 N δ m =1;

  2. (b)

    0<a≤ α n ≤b<1, where a and b are constants.

If ∑ m = 1 N δ m T m is semicompact, then { x n } converges strongly to some point in F.

In Hilbert spaces, we find from Theorem 2.1 the following.

Corollary 2.6 Let E be a Hilbert space and K be a nonempty closed convex subset of E. Let N≥1 be some positive integer. Let T m :K→K, where m∈{1,…,N}, be a λ i -strictly pseudocontractive mapping and { u n } be a bounded sequence in K. Let { x n } n = 0 ∞ be a sequence generated in the following algorithm:

x 0 ∈K, x n = α n x n − 1 + β n ∑ m = 1 N δ m T m x n + γ n u n ,n≥1,

where { α n }, { β n }, { γ n }, and { δ m } are real number sequences in [0,1]. Assume that F:= ⋂ m = 1 N F( T m )≠∅ and the above control sequences satisfy the following restrictions:

  1. (a)

    ∑ m = 1 N δ m = α n + β n + γ n =1;

  2. (b)

    ∑ n = 1 ∞ γ n <∞;

  3. (c)

    0<a≤ α n ≤b<1, where a and b are constants.

If ∑ m = 1 N δ m T m is semicompact, then { x n } converges strongly to some point in F.

References

  1. Browder FE, Petryshyn WV: Construction of fixed points of nonlinear mappings in Hilbert spaces. J. Math. Anal. Appl. 1967, 20: 197–228. 10.1016/0022-247X(67)90085-6

    Article  MathSciNet  Google Scholar 

  2. Browder FE Proc. Sympos. Math. 18. In Nonlinear Operators and Nonlinear Equations of Evolution in Banach Spaces. Am. Math. Soc., Providence; 1976.

    Chapter  Google Scholar 

  3. Zhou H: Convergence theorems of common fixed points for a finite family of Lipschitz pseudocontractions in Banach spaces. Nonlinear Anal. 2008, 68: 2977–2983. 10.1016/j.na.2007.02.041

    Article  MathSciNet  Google Scholar 

  4. Chidume CE, Mutangadura SA: An example on the Mann iteration method for Lipschitz pseudo-contractions. Proc. Am. Math. Soc. 2001, 129: 2359–2363. 10.1090/S0002-9939-01-06009-9

    Article  MathSciNet  Google Scholar 

  5. Xu HK, Ori RG: An implicit iteration process for nonexpansive mappings. Numer. Funct. Anal. Optim. 2001, 22: 767–773. 10.1081/NFA-100105317

    Article  MathSciNet  Google Scholar 

  6. Osilike MO: Implicit iteration process for common fixed points of a finite family of strictly pseudocontractive maps. J. Math. Anal. Appl. 2004, 294: 73–81. 10.1016/j.jmaa.2004.01.038

    Article  MathSciNet  Google Scholar 

  7. Cho SY, Kang SM: Approximation of fixed points of pseudocontraction semigroups based on a viscosity iterative process. Appl. Math. Lett. 2011, 24: 224–228. 10.1016/j.aml.2010.09.008

    Article  MathSciNet  Google Scholar 

  8. Cho SY, Qin X, Kang SM: Hybrid projection algorithms for treating common fixed points of a family of demicontinuous pseudocontractions. Appl. Math. Lett. 2012, 25: 854–857. 10.1016/j.aml.2011.10.031

    Article  MathSciNet  Google Scholar 

  9. Zhou H: Convergence theorems for λ -strict pseudo-contractions in 2-uniformly smooth Banach spaces. Nonlinear Anal. 2008, 69: 3160–3173. 10.1016/j.na.2007.09.009

    Article  MathSciNet  Google Scholar 

  10. Qin X, Cho SY, Kang SM: Strong convergence of shrinking projection methods for quasi- ϕ -nonexpansive mappings and equilibrium problems. J. Comput. Appl. Math. 2010, 234: 750–760. 10.1016/j.cam.2010.01.015

    Article  MathSciNet  Google Scholar 

  11. Zhou H: Convergence theorems of common fixed points for a finite family of Lipschitz pseudocontractions in Banach spaces. Nonlinear Anal. 2008, 68: 2977–2983. 10.1016/j.na.2007.02.041

    Article  MathSciNet  Google Scholar 

  12. Cho SY, Kang SM: Approximation of common solutions of variational inequalities via strict pseudocontractions. Acta Math. Sci. 2012, 32: 1607–1618.

    Article  Google Scholar 

  13. Kim JK, Nam YM, Sim JY: Convergence theorems of implicit iterative sequences for a finite family of asymptotically quasi-nonexpansive type mappings. Nonlinear Anal. 2009, 71: e2839-e2848. 10.1016/j.na.2009.06.090

    Article  MathSciNet  Google Scholar 

  14. Qin X, Cho YJ, Kang SM: Convergence theorems of common elements for equilibrium problems and fixed point problems in Banach spaces. J. Comput. Appl. Math. 2009, 225: 20–30. 10.1016/j.cam.2008.06.011

    Article  MathSciNet  Google Scholar 

  15. Luo H, Wang Y: Iterative approximation for the common solutions of a infinite variational inequality system for inverse-strongly accretive mappings. J. Math. Comput. Sci. 2012, 2: 1660–1670.

    MathSciNet  Google Scholar 

  16. Qin X, Cho SY, Kang SM: An extragradient-type method for generalized equilibrium problems involving strictly pseudocontractive mappings. J. Glob. Optim. 2012, 49: 679–693.

    Article  MathSciNet  Google Scholar 

  17. Zegeye H, Shahzad N: Strong convergence theorem for a common point of solution of variational inequality and fixed point problem. Adv. Fixed Point Theory 2012, 2: 374–397.

    Google Scholar 

  18. Lv S, Wu C: Convergence of iterative algorithms for a generalized variational inequality and a nonexpansive mapping. Eng. Math. Lett. 2012, 1: 44–57.

    Google Scholar 

  19. Qin X, Cho SY, Kang SM: On hybrid projection methods for asymptotically quasi- ϕ -nonexpansive mappings. Appl. Math. Comput. 2010, 215: 3874–3883. 10.1016/j.amc.2009.11.031

    Article  MathSciNet  Google Scholar 

  20. Qing Y, Kim JK: Weak convergence of algorithms for asymptotically strict pseudocontractions in the intermediate sense and equilibrium problems. Fixed Point Theory Appl. 2012., 2012: Article ID 132

    Google Scholar 

  21. Ye J, Huang J: Strong convergence theorems for fixed point problems and generalized equilibrium problems of three relatively quasi-nonexpansive mappings in Banach spaces. J. Math. Comput. Sci. 2011, 1: 1–18.

    Article  MathSciNet  Google Scholar 

  22. Hao H, Wang X, Tong A: Weak and strong convergence theorems for two finite families of asymptotically nonexpansive mappings in Banach spaces. Adv. Fixed Point Theory 2012, 2: 417–432.

    Google Scholar 

  23. Qin X, Shang M, Su Y: Strong convergence of a general iterative algorithm for equilibrium problems and variational inequality problems. Math. Comput. Model. 2008, 48: 1033–1046. 10.1016/j.mcm.2007.12.008

    Article  MathSciNet  Google Scholar 

  24. Kim JK, Cho SY, Qin X: Hybrid projection algorithms for generalized equilibrium problems and strictly pseudocontractive mappings. J. Inequal. Appl. 2010., 2010: Article ID 312602

    Google Scholar 

  25. Osilike MO, Shehu Y: Explicit averaging cyclic algorithm for common fixed points of a finite family of asymptotically strictly pseudocontractive maps in Banach spaces. Comput. Math. Appl. 2009, 57: 1502–1510. 10.1016/j.camwa.2009.01.022

    Article  MathSciNet  Google Scholar 

  26. Kim JK, Cho SY, Qin X: Some results on generalized equilibrium problems involving strictly pseudocontractive mappings. Acta Math. Sci. 2011, 31: 2041–2057.

    Article  MathSciNet  Google Scholar 

  27. Acedo GL, Xu HK: Iterative methods for strict pseudo-contractions in Hilbert spaces. Nonlinear Anal. 2007, 67: 2258–2271. 10.1016/j.na.2006.08.036

    Article  MathSciNet  Google Scholar 

  28. Qin X, Cho YJ, Kang SM, Zhou H: Convergence of a modified Halpern-type iteration algorithm for quasi- ϕ -nonexpansive mappings. Appl. Math. Lett. 2009, 22: 1051–1055. 10.1016/j.aml.2009.01.015

    Article  MathSciNet  Google Scholar 

  29. Kim JK: Strong convergence theorems by hybrid projection methods for equilibrium problems and fixed point problems of the asymptotically quasi- Ï• -nonexpansive mappings. Fixed Point Theory Appl. 2011., 2011: Article ID 10

    Google Scholar 

  30. Kim JK, Anah PN, Nam YM: Strong convergence of an extended extragradient method for equilibrium problems and fixed point problems. J. Korean Math. Soc. 2012, 49: 187–200. 10.4134/JKMS.2012.49.1.187

    Article  MathSciNet  Google Scholar 

  31. Cho SY, Kang SM: Zero point theorems for m -accretive operators in a Banach space. Fixed Point Theory Appl. 2012, 13: 49–58.

    MathSciNet  Google Scholar 

  32. Kang SM, Cho SY, Liu Z: Generalized equilibrium problems involving inverse-strongly monotone mappings. J. Inequal. Appl. 2010., 2010: Article ID 827082

    Google Scholar 

  33. Opial Z: Weak convergence of the sequence of successive approximation for nonexpansive mappings. Bull. Am. Math. Soc. 1967, 73: 591–597. 10.1090/S0002-9904-1967-11761-0

    Article  MathSciNet  Google Scholar 

  34. Deimling K: Zeros of accretive operators. Manuscr. Math. 1974, 13: 365–374. 10.1007/BF01171148

    Article  MathSciNet  Google Scholar 

  35. Tan KK, Xu HK: Approximating fixed points of nonexpansive mappings by the Ishikawa iterative process. J. Math. Anal. Appl. 1993, 178: 301–308. 10.1006/jmaa.1993.1309

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The authors are grateful to the reviewers’ suggestions which improved the contents of the article.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mingliang Zhang.

Additional information

Competing interests

The authors declare that they have no competing interests.

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

Yang, X., Qing, Y. & Zhang, M. Some results on parallel iterative algorithms for strictly pseudocontractive mappings. J Inequal Appl 2013, 74 (2013). https://doi.org/10.1186/1029-242X-2013-74

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1186/1029-242X-2013-74

Keywords