 Research Article
 Open access
 Published:
An Iterative Algorithm Combining Viscosity Method with Parallel Method for a Generalized Equilibrium Problem and Strict Pseudocontractions
Fixed Point Theory and Applications volumeÂ 2009, ArticleÂ number:Â 794178 (2009)
Abstract
We introduce a new approximation scheme combining the viscosity method with parallel method for finding a common element of the set of solutions of a generalized equilibrium problem and the set of fixed points of a family of finitely strict pseudocontractions. We obtain a strong convergence theorem for the sequences generated by these processes in Hilbert spaces. Based on this result, we also get some new and interesting results. The results in this paper extend and improve some wellknown results in the literature.
1. Introduction
Let be a real Hilbert space with inner product and induced norm and let be a nonemptyclosed convex subset of . Let be a function and let be a bifunction from to such that , where is the set of real numbers and . FloresBazÃ¡n [1] introduced the following generalized equilibrium problem:
The set of solutions of (1.1) is denoted by . FloresBazÃ¡n [1] provided some characterizations of the nonemptiness of the solution set for problem (1.1) in reflexive Banach spaces in the quasiconvex case. Bigi et al. [2] studied a dual problem associated with the problem (1.1) with .
Let . Here denotes the indicator function of the set ; that is, if and otherwise. Then the problem (1.1) becomes the following equilibrium problem:
The set of solutions of (1.2) is denoted by . The problem (1.2) includes, as special cases, the optimization problem, the variational inequality problem, the fixed point problem, the nonlinear complementarity problem, the Nash equilibrium problem in noncooperative games, and the vector optimization problem. For more detail, please see [3â€“5] and the references therein.
If for all , where is a function, then the problem (1.1) becomes a problem of finding which is a solution of the following minimization problem:
The set of solutions of (1.3) is denoted by .
If is replaced by a realvalued function , the problem (1.1) reduces to the following mixed equilibrium problem introduced by Ceng and Yao [6]:
Recall that a mapping is said to be a strict pseudocontraction [7] if there exists such that
where denotes the identity operator on . When , is said to be nonexpansive. Note that the class of strict pseudocontraction mappings strictly includes the class of nonexpansive mappings. We denote the set of fixed points of by .
Ceng and Yao [6], Yao et al. [8], and Peng and Yao [9, 10] introduced some iterative schemes for finding a common element of the set of solutions of the mixed equilibrium problem (1.4) and the set of common fixed points of a family of finitely (infinitely) nonexpansive mappings (strict pseudocontractions) in a Hilbert space and obtained some strong convergence theorems(weak convergence theorems). Some methods have been proposed to solve the problem (1.2); see, for instance, [3â€“5, 11â€“18] and the references therein. Recently, S. Takahashi and W. Takahashi [12] introduced an iterative scheme by the viscosity approximation method for finding a common element of the set of solutions of problem (1.2) and the set of fixed points of a nonexpansive mapping in a Hilbert space and proved a strong convergence theorem. Su et al. [13] introduced an iterative scheme by the viscosity approximation method for finding a common element of the set of solutions of problem (1.2) and the set of fixed points of a nonexpansive mapping and the set of solutions of the variational inequality problem for an inverse strongly monotone mapping in a Hilbert space. Tada and Takahashi [14] introduced two iterative schemes for finding a common element of the set of solutions of problem (1.2) and the set of fixed points of a nonexpansive mapping in a Hilbert space and obtained both strong convergence theorem and weak convergence theorem. Ceng et al. [15] introduced an iterative algorithm for finding a common element of the set of solutions of problem (1.2) and the set of fixed points of a strict pseudocontraction mapping. Chang et al. [16] introduced some iterative processes based on the extragradient method for finding the common element of the set of fixed points of a family of infinitely nonexpansive mappings, the set of problem (1.2), and the set of solutions of a variational inequality problem for an inverse strongly monotone mapping. Colao et al. [17] introduced an iterative method for finding a common element of the set of solutions of problem (1.2) and the set of fixed points of a finite family of nonexpansive mappings in a Hilbert space and proved the strong convergence of the proposed iterative algorithm to the unique solution of a variational inequality, which is the optimality condition for a minimization problem. To the best of our knowledge, there is not any algorithms for solving problem (1.1).
On the other hand, Marino and Xu [19] and Zhou [20] introduced and researched some iterative scheme for finding a fixed point of a strict pseudocontraction mapping. Acedo and Xu [21] introduced some parallel and cyclic algorithms for finding a common fixed point of a family of finite strict pseudocontraction mappings and obtained both weak and strong convergence theorems for the sequences generated by the iterative schemes.
In the present paper, we introduce a new approximation scheme combining the viscosity method with parallel method for finding a common element of the set of solutions of the generalized equilibrium problem and the set of fixed points of a family of finitely strict pseudocontractions. We obtain a strong convergence theorem for the sequences generated by these processes. Based on this result, we also get some new and interesting results. The results in this paper extend and improve some wellknown results in the literature.
2. Preliminaries
Let be a real Hilbert space with inner product and norm . Let be a nonemptyclosed convex subset of . Let symbols and denote strong and weak convergences, respectively. In a real Hilbert space , it is well known that
for all and .
For any , there exists a unique nearest point in , denoted by , such that for all . The mapping is called the metric projection of onto . We know that is a nonexpansive mapping from onto . It is also known that and
for all and .
For each , we denote by the convex hull of . A multivalued mapping is said to be a KKM map if, for every finite subset ,
We will use the following results in the sequel.
Lemma 2.1 (see [22]).
Let be a nonempty subset of a Hausdorff topological vector space and let be a KKM map. If is closed for all and is compact for at least one , then
For solving the generalized equilibrium problem, let us give the following assumptions for the bifunction , and the set :
(A1) for all ;
(A2) is monotone, that is, for any ;
(A3) for each , is weakly upper semicontinuous;
(A4)for each is convex;
(A5)for each is lower semicontinuous;
(B1)For each and , there exist a bounded subset and such that for any ,
(B2) is a bounded set.
Lemma 2.2.
Let be a nonemptyclosed convex subset of . Let be a bifunction from to satisfying (A1)â€“(A4) and let be a proper lower semicontinuous and convex function such that . For and define a mapping as follows:
for all . Assume that either (B1) or (B2) holds. Then, the following conclusions hold:
(1)for each , ;
(2) is singlevalued;
(3) is firmly nonexpansive, that is, for any
(4)
(5) is closed and convex.
Proof.
Let be any given point in . For each , we define
Note that for each , is nonempty since and for each , . We will prove that is a KKM map on . Suppose that there exists a finite subset of and for all with such that for each . Then we have
for each . By (A4) and the convexity of , we have
which is a contradiction. Hence, is a KKM map on . Note that (the weak closure of ) is a weakly closed subset of for each . Moreover, if (B2) holds, then is also weakly compact for each . If (B1) holds, then for , there exists a bounded subset and such that for any ,
This shows that
Hence, is weakly compact. Thus, in both cases, we can use Lemma 2.1 and have .
Next, we will prove that for each ; that is, is weakly closed. Let and let be a sequence in such that . Then,
Since is weakly lower semicontinuous, we can show that
It follows from (A3) and the weak lower semicontinuity of that
This implies that . Hence, is weakly closed. Hence, . Hence, from the arbitrariness of , we conclude that , .
We observe that . So by similar argument with that in the proof of Lemma 2.3 in [9], we can easily show that is singlevalued and is a firmly nonexpansivetype map. Next, we claim that . Indeed, we have the following:
At last, we claim that is a closed convex. Indeed, Since is firmly nonexpansive, is also nonexpansive. By [23, Proposition 5.3], we know that is closed and convex.
Remark 2.3.
It is easy to see that Lemma 2.2 is a generalization of [9, Lemma 2.3].
Assume that is a sequence of nonnegative real numbers such that
where is a sequence in and is a sequence such that
Then,
Lemma 2.5.
In a real Hilbert space , there holds the following inequality:
for all
3. Strong Convergence Theorems
In this section, we show a strong convergence of an iterative algorithm based on both viscosity approximation method and parallel method which solves the problem of finding a common element of the set of solutions of a generalized equilibrium problem and the set of fixed points of a family of finitely strict pseudocontractions in a Hilbert space.
We need the following assumptions for the parameters and :
(C1) and ;
(C2);
(C3) for some and ;
(C4) and ;
(C5) for all .
Theorem 3.1.
Let be a nonemptyclosed convex subset of a real Hilbert space . Let be a bifunction from to satisfying (A1)â€“(A5), and let be a proper lower semicontinuous and convex function such that . Let be an integer. For each , let be an strict pseudocontraction for some such that . Assume for each , is a finite sequence of positive numbers such that for all and for all . Let . Assume that either (B1) or (B2) holds. Let be a contraction of into itself and let , and be sequences generated by
for every , where and are sequences of numbers satisfying the conditions (C1)â€“(C5). Then, , and converge strongly to .
Proof.
We show that is a contraction of into itself. In fact, there exists such that for all . So, we have
for all Since is complete, there exists a unique element such that .
Let and let be a sequence of mappings defined as in Lemma 2.2. From , we have
We define a mapping by
By [21, Proposition 2.6], we know that is an strict pseudocontraction and . It follows from (3.3), and such that
Put It is obvious that Suppose From (3.3), (3.5), and , we have
for every Therefore, is bounded. From (3.3) and (3.5), we also obtain that and are bounded.
Following [26], define by
As shown in [26], each is a nonexpansive mapping on . Set , we have
On the other hand, from and , we have
Putting in (3.9) and in (3.10), we have
So, from the monotonicity of , we get
hence
Without loss of generality, let us assume that there exists a real number such that for all Then,
hence
where
It follows from (3.8) and (3.15) that
Define a sequence such that
Then, we have
From (3.18) and (3.16), we have
It follows from (C1)â€“(C5) that
Hence, by [27, Lemma 2.2], we have . Consequently,
Since , we have
thus
It follows from (C1) and (C2) that .
Since for , it follows from (3.5) and (3.3) that
from which it follows that
It follows from (C1)â€“(C3) and that
For , we have from Lemma 2.2,
Hence,
By (3.24) and (3.28), we have
Hence,
It follows from (C1), (C2), and that .
Next, we show that
where . To show this inequality, we can choose a subsequence of such that
Since is bounded, there exists a subsequence of which converges weakly to . Without loss of generality, we can assume that From , we obtain that . From , we also obtain that . Since and is closed and convex, we obtain .
We first show that To see this, we observe that we may assume (by passing to a further subsequence if necessary) (as ) for It is easy to see that and . We also have
where . Note that by [21, Proposition 2.6], is an strict pseudocontraction and . Since
it follows from (3.26) and that
So by the demiclosedness principle [21, Proposition 2.6(ii)], it follows that .
We now show By we know that
It follows from (A2) that
Hence,
It follows from (A4), (A5) and the weakly lower semicontinuity of , and that
For with and , let Since and , we obtain and hence . So by (A4) and the convexity of , we have
Dividing by , we get
Letting , it follows from (A3) and the weakly lower semicontinuity of that
for all . Observe that if , then holds. Moreover, hence . This implies Therefore, we have
Finally, we show that , where .
From Lemma 2.5, we have
thus
It follows from (C1), (3.43), (3.45), and Lemma 2.4 that . From and , we have and . The proof is now complete.
Theorem 3.2.
Let be a nonemptyclosed convex subset of a real Hilbert space . Let be a bifunction from to satisfying (A1)â€“(A5), and let be a proper lower semicontinuous and convex function such that . Let be an integer. For each , let be an strict pseudocontraction for some such that . Assume for each , is a finite sequence of positive numbers such that for all and for all . Let . Assume that either (B1) or (B2) holds. Let be an arbitrary point in and let , and be sequences generated by
for every where and are sequences of numbers satisfying the conditions (C1)â€“(C5). Then, , and converge strongly to .
Proof.
Let for all , by Theorem 3.1, we obtain the desired result.
4. Applications
By Theorems 3.1 and 3.2, we can obtain many new and interesting strong convergence theorems. Now, give some examples as follows: for , let , by Theorems 3.1 and 3.2, respectively, we have the following results.
Theorem 4.1.
Let be a nonemptyclosed convex subset of a real Hilbert space . Let be a bifunction from to satisfying (A1)â€“(A5), and let be a proper lower semicontinuous and convex function such that . Let be an strict pseudocontraction for some such that . Assume that either (B1) or (B2) holds. Let be a contraction of into itself and let , and be sequences generated by
for every where , , and are sequences of numbers satisfying the conditions (C1)â€“(C4). Then, , and converge strongly to .
Theorem 4.2.
Let be a nonemptyclosed convex subset of a real Hilbert space . Let be a bifunction from to satisfying (A1)â€“(A5), and let be a proper lower semicontinuous and convex function such that . Let be an strict pseudocontraction for some such that . Assume that either (B1) or (B2) holds. Let be an arbitrary point in and let , and be sequences generated by
for every where , , and are sequences of numbers satisfying the conditions (C1)â€“(C4). Then, , and converge strongly to .
We need the following two assumptions.
(B3)For each and , there exist a bounded subset and such that for any ,
(B4)For each and , there exist a bounded subset and such that for any ,
Let , by Theorems 3.1 and 3.2, respectively, we obtain the following results.
Theorem 4.3.
Let be a nonemptyclosed convex subset of a real Hilbert space . Let be a bifunction from to satisfying (A1)â€“(A5). Let be an integer. For each , let be an strict pseudocontraction for some such that . Assume for each , is a finite sequence of positive numbers such that for all and for all . Let . Assume that either (B3) or (B2) holds. Let be a contraction of into itself, and let , and be sequences generated by
for every where and are sequences of numbers satisfying the conditions (C1)â€“(C5). Then, , and converge strongly to .
Theorem 4.4.
Let be a nonemptyclosed convex subset of a real Hilbert space . Let be a bifunction from to satisfying (A1)â€“(A5). Let be an integer. For each , let be an strict pseudocontraction for some such that . Assume for each , is a finite sequence of positive numbers such that for all and for all . Let . Assume that either (B3) or (B2) holds. Let be an arbitrary point in and let , and be sequences generated by
for every where and are sequences of numbers satisfying the conditions (C1)â€“(C5). Then, , and converge strongly to .
Let for all , by Theorems 3.1 and 3.2, respectively, we obtain the following results.
Theorem 4.5.
Let be a nonemptyclosed convex subset of a real Hilbert space . Let be a lower semicontinuous and convex function, and let be a proper lower semicontinuous and convex function such that . Let be an integer. For each , let be an strict pseudocontraction for some such that . Assume for each , is a finite sequence of positive numbers such that for all and for all . Let . Assume that either (B4) or (B2) holds. Let be a contraction of into itself, and let , and be sequences generated by
for every , where and are sequences of numbers satisfying the conditions (C1)â€“(C5). Then, , and converge strongly to .
Theorem 4.6.
Let be a nonemptyclosed convex subset of a real Hilbert space . Let be a lower semicontinuous and convex function, and let be a proper lower semicontinuous and convex function such that . Let be an integer. For each , let be an strict pseudocontraction for some such that . Assume for each , is a finite sequence of positive numbers such that for all and for all . Let . Assume that either (B4) or (B2) holds. Let be an arbitrary point in and let , and be sequences generated by
for every where and are sequences of numbers satisfying the conditions (C1)â€“(C5). Then, , and converge strongly to .
Let , and let for all . Then . By Theorems 3.1 and 3.2, we obtain the following results.
Theorem 4.7.
Let be a nonemptyclosed convex subset of a real Hilbert space . Let be an integer. For each , let be an strict pseudocontraction for some such that . Assume for each , is a finite sequence of positive numbers such that for all and for all . Let . Let be a contraction of into itself, and let and be sequences generated by
for every , where and are sequences of numbers satisfying the conditions (C1)â€“(C3) and (C5). Then, and converge strongly to .
Theorem 4.8.
Let be a nonemptyclosed convex subset of a real Hilbert space . Let be an integer. For each , let be an strict pseudocontraction for some such that . Assume for each , is a finite sequence of positive numbers such that for all and for all . Let . Let be an arbitrary point in and let and be sequences generated by
for every , where and are sequences of numbers satisfying the conditions (C1)â€“(C3) and (C5). Then, and converge strongly to .
Remark 4.9.

(1)
Since the nonexpansive mappings have been replaced by the strict pseudocontractions, Theorems 3.1, 3.2, 4.1 and 4.2 extend and improve [6, Theorem 3.1], [8, Theorem 3.5], [9, Theorems 4.1 and 4.2], [18, Theorem 4.1], and the main results in [9â€“11, 13â€“16].

(2)
Since the weak convergence has been replaced by strong convergence, Theorems 3.1, 3.2, 4.1âˆ’4.4 extend and improve [12, Theorem 3.1], [10, Corollary 4.1].

(3)
Theorems 4.7 and 4.8 are strong convergence theorems for strict pseudocontractions without constraints and hence they improve the corresponding results in [19, 21]. Theorems 3.1 and 3.2 also improve [10, Corollary 3.1].
References
FloresBazÃ¡n F: Existence theorems for generalized noncoercive equilibrium problems: the quasiconvex case. SIAM Journal on Optimization 2000,11(3):675â€“690.
Bigi G, Castellani M, Kassay G: A dual view of equilibrium problems. Journal of Mathematical Analysis and Applications 2008,342(1):17â€“26. 10.1016/j.jmaa.2007.11.034
Iusem AN, Sosa W: Iterative algorithms for equilibrium problems. Optimization 2003,52(3):301â€“316. 10.1080/0233193031000120039
FlÃ¥m SD, Antipin AS: Equilibrium programming using proximallike algorithms. Mathematical Programming 1997,78(1):29â€“41.
Blum E, Oettli W: From optimization and variational inequalities to equilibrium problems. The Mathematics Student 1994,63(1â€“4):123â€“145.
Ceng LC, Yao JC: A hybrid iterative scheme for mixed equilibrium problems and fixed point problems. Journal of Computational and Applied Mathematics 2008,214(1):186â€“201. 10.1016/j.cam.2007.02.022
Browder FE, Petryshyn WV: Construction of fixed points of nonlinear mappings in Hilbert space. Journal of Mathematical Analysis and Applications 1967, 20: 197â€“228. 10.1016/0022247X(67)900856
Yao Y, Liou YC, Yao JC: A new hybrid iterative algorithm for fixedpoint problems, variational inequality problems, and mixed equilibrium problems. Fixed Point Theory and Applications 2008, 2008:15.
Peng JW, Yao JC: A new hybridextragradient method for generalized mixed equilibrium problems, fixed point problems and variational inequality problems. Taiwanese Journal of Mathematics 2008,12(6):1401â€“1432.
Peng JW, Yao JC: Some new iterative algorithms for generalized mixed equilibrium problems with strict pseudocontractions and monotone mappings. to appear in Taiwanese Journal of Mathematics
Combettes PL, Hirstoaga SA: Equilibrium programming in Hilbert spaces. Journal of Nonlinear and Convex Analysis 2005,6(1):117â€“136.
Takahashi S, Takahashi W: Viscosity approximation methods for equilibrium problems and fixed point problems in Hilbert spaces. Journal of Mathematical Analysis and Applications 2007,331(1):506â€“515. 10.1016/j.jmaa.2006.08.036
Su Y, Shang M, Qin X: An iterative method of solution for equilibrium and optimization problems. Nonlinear Analysis: Theory, Methods & Applications 2008,69(8):2709â€“2719. 10.1016/j.na.2007.08.045
Tada A, Takahashi W: Weak and strong convergence theorems for a nonexpansive mapping and an equilibrium problem. Journal of Optimization Theory and Applications 2007,133(3):359â€“370. 10.1007/s109570079187z
Ceng LC, AIHomidan S, Ansari QH, Yao JC: An iterative scheme for equilibrium problems and fixed point problems of strict pseudocontraction mappings. Journal of Computational and Applied Mathematics 2009,223(2):967â€“974. 10.1016/j.cam.2008.03.032
Chang SS, Joseph Lee HW, Chan CK: A new method for solving equilibrium problem, fixed point problem and variational inequality problem with application to optimization. Nonlinear Analysis: Theory, Methods & Applications. In press
Colao V, Marino G, Xu HK: An iterative method for finding common solutions of equilibrium and fixed point problems. Journal of Mathematical Analysis and Applications 2008,344(1):340â€“352. 10.1016/j.jmaa.2008.02.041
Takahashi S, Takahashi W: Strong convergence theorem for a generalized equilibrium problem and a nonexpansive mapping in a Hilbert space. Nonlinear Analysis: Theory, Methods & Applications 2008,69(3):1025â€“1033. 10.1016/j.na.2008.02.042
Marino G, Xu HK: Weak and strong convergence theorems for strict pseudocontractions in Hilbert spaces. Journal of Mathematical Analysis and Applications 2007,329(1):336â€“346. 10.1016/j.jmaa.2006.06.055
Zhou H: Convergence theorems of fixed points for strict pseudocontractions in Hilbert spaces. Nonlinear Analysis: Theory, Methods & Applications 2008,69(2):456â€“462. 10.1016/j.na.2007.05.032
Acedo GL, Xu HK: Iterative methods for strict pseudocontractions in Hilbert spaces. Nonlinear Analysis: Theory, Methods & Applications 2007,67(7):2258â€“2271. 10.1016/j.na.2006.08.036
Fan K: A generalization of Tychonoff's fixed point theorem. Mathematische Annalen 1961, 142: 305â€“310. 10.1007/BF01353421
Goebel K, Reich S: Uniform Convexity, Hyperbolic Geometry, and Nonexpansive Mappings, Monographs and Textbooks in Pure and Applied Mathematics. Volume 83. Marcel Dekker, New York, NY, USA; 1984:ix+170.
Xu HK: Iterative algorithms for nonlinear operators. Journal of the London Mathematical Society. Second Series 2002,66(1):240â€“256. 10.1112/S0024610702003332
Xu HK: An iterative approach to quadratic optimization. Journal of Optimization Theory and Applications 2003,116(3):659â€“678. 10.1023/A:1023073621589
Marino G, Colao V, Qin X, Kang SM: Strong convergence of the modified Mann iterative method for strict pseudocontractions. Computers & Mathematics with Applications 2009,57(3):455â€“465. 10.1016/j.camwa.2008.10.073
Suzuki T: Strong convergence theorems for infinite families of nonexpansive mappings in general Banach spaces. Fixed Point Theory and Applications 2005,2005(1):103â€“123. 10.1155/FPTA.2005.103
Acknowledgments
The first author was supported by the National Natural Science Foundation of China (Grants No. 10771228 and No. 10831009), the Science and Technology Research Project of Chinese Ministry of Education (Grant no. 206123), the Education Committee project Research Foundation of Chongqing Normal University (Grant no. KJ070816); the second and third authors were partially supported by the Grants NSC972221E230017 and NSC962628E110014MY3, respectively.
Author information
Authors and Affiliations
Corresponding author
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.
About this article
Cite this article
Peng, JW., Liou, YC. & Yao, JC. An Iterative Algorithm Combining Viscosity Method with Parallel Method for a Generalized Equilibrium Problem and Strict Pseudocontractions. Fixed Point Theory Appl 2009, 794178 (2009). https://doi.org/10.1155/2009/794178
Received:
Accepted:
Published:
DOI: https://doi.org/10.1155/2009/794178