- About this Journal ·
- Abstracting and Indexing ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Recently Accepted Articles ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents
Abstract and Applied Analysis
Volume 2014 (2014), Article ID 120172, 22 pages
Hybrid Extragradient-Like Viscosity Methods for Generalized Mixed Equilibrium Problems, Variational Inclusions, and Optimization Problems
1Department of Mathematics, Shanghai Normal University, Scientific Computing Key Laboratory of Shanghai Universities, Shanghai 200234, China
2Department of Applied Mathematics, National Hsinchu University of Education, Hsinchu 30033, Taiwan
3Department of Information Management, Yuan Ze University, Chung-Li 32003, Taiwan
Received 20 November 2013; Accepted 20 December 2013; Published 9 February 2014
Academic Editor: Erdal Karapinar
Copyright © 2014 Lu-Chuan Ceng et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
We introduce and analyze a new hybrid extragradient-like viscosity iterative algorithm for finding a common solution of a generalized mixed equilibrium problem, a finite family of variational inclusions for maximal monotone and inverse strongly monotone mappings, and a fixed point problem of infinitely many nonexpansive mappings in a real Hilbert space. Under some mild conditions, we prove the strong convergence of the sequence generated by the proposed algorithm to a common solution of these three problems which also solves an optimization problem.
Let be a real Hilbert space with inner product and norm , be a nonempty closed convex subset of , and be the metric projection of onto . Let be a nonlinear mapping on . We denote by the set of fixed points of and by the set of all real numbers. A mapping is called strongly positive on if there exists a constant such that A mapping is called -Lipschitz continuous if there exists a constant such that In particular, if then is called a nonexpansive mapping; if then is called a contraction.
Let be a nonlinear mapping on . Recall that the classical variational inequality problem (VIP) is to find a point such that The solution set of VIP (3) is denoted by . The VIP (3) was first discussed by Lions  and has been extensively studied since then. See, for example, [2–5].
In 1976, Korpelevič  proposed an iterative algorithm for solving the VIP (3) in Euclidean space : with as a given number, which is known as the extragradient method. The literature on the VIP is vast and Korpelevich's extragradient method has received great attention given by many authors, see, for example, [7–23] and the references therein. Let be a real-valued function, be a nonlinear mapping, and be a bifunction. In 2008, Peng and Yao  introduced the following generalized mixed equilibrium problem (GMEP) of finding such that We denote the set of solutions of GMEP (5) by . The GMEP (5) is very general in the sense that it includes, as special cases, optimization problems, variational inequalities, minimax problems, Nash equilibrium problems in noncooperative games, and others. The GMEP is further considered and studied; see, for example, [13, 16, 24–28].
We present some special cases of GMEP (5) as follows.
If , then GMEP (5) reduces to the generalized equilibrium problem (GEP) which is to find such that This problem was introduced and studied by S. Takahashi and W. Takahashi . The set of solutions of GEP is denoted by .
If ,, then GMEP (5) reduces to the equilibrium problem (EP) which is to find such that This was considered and studied in [32, 33]. The set of solutions of EP is denoted by . It is worth mentioning that the EP is a unified model of several problems, namely, variational inequality problems, optimization problems, saddle point problems, complementarity problems, fixed point problems, Nash equilibrium problems, and so forth.
For the bifunction and real-valued function in the GMEP (5), as in , we assume that is a bifunction satisfying conditions (H1)–(H4) and is a lower semicontinuous and convex function with restriction (H5), where(H1) for all ;(H2) is monotone, that is; for any ;(H3) is upper-hemicontinuous, that is; for each , (H4) is convex and lower semicontinuous for each ;(H5)for each and , there exists a bounded subset and such that for any ,
A differentiable function is called(i)convex, if where is the Frechet derivative of at ;(ii)strongly convex, if there exists a constant such that
It is easy to see that if is a differentiable strongly convex function with constant , then is strongly monotone with constant .
Given a positive number , let be the solution set of the auxiliary mixed equilibrium problem; that is, for each , In particular, whenever ,, is rewritten as .
Let be two bifunctions and be two nonlinear mappings. Consider the following system of generalized equilibrium problems (SGEP): find such that where and are two constants. It is introduced and studied in , that the SGEP reduces to a system of variational inequalities whenever . It is worth mentioning that the system of variational inequalities is a tool to solve the Nash equilibrium problem for noncooperative games.
In 2010, Ceng and Yao  transformed the SGEP into a fixed point problem in the following way.
Proposition CY (see ). Let be two bifunctions satisfying conditions (H1)–(H4) and let be -inverse-strongly monotone for . Let for . Then, is a solution of SGEP if and only if is a fixed point of the mapping defined by , where . Here, one denotes the fixed point set of by .
Let be an infinite family of nonexpansive mappings on and be a sequence of nonnegative numbers in . For any , define a self-mapping on as follows: Such a mapping is called the -mapping generated by and .
In 2011, for the case where, letbe a contraction, be differentiable and strongly convex, ,andbe given. Yao et al.  proposed the hybrid iterative algorithm for finding a common element of the setand the fixed setof an infinite family of nonexpansive mappingsonas follows: They proved the strong convergence of the sequence generated by the hybrid iterative algorithm (16) to a point under some appropriate conditions. This point also solves the following optimization problem: where is the potential function of .
Let be a contraction and be a strongly positive bounded linear operator on . Assume that is a lower semicontinuous and convex functional, that satisfy conditions (H1)–(H4), and that are inverse-strongly monotone. Very recently, Ceng et al.  introduced the following hybrid extragradient-like iterative algorithm: for finding a common solution of GMEP (5), SGEP (14), and the fixed point problem of an infinite family of nonexpansive mappings on , where ,, and are given. The authors proved the strong convergence of the sequence generated by the hybrid iterative algorithm (17) to a point under some suitable conditions. This point also solves the following optimization problem: where is the potential function of .
On the other hand, let be a single-valued mapping of into and be a set-valued mapping with . Consider the following variational inclusion: find a point such that We denote by the solution set of the variational inclusion (18). In particular, if , then . If , then problem (18) becomes the inclusion problem introduced by Rockafellar . It is known that problem (18) provides a convenient framework for the unified study of optimal solutions in many optimization related areas including mathematical programming, complementarity problems, variational inequalities, optimal control, mathematical economics, equilibria and game theory, etc. Let a set-valued mapping be maximal monotone. We define the resolvent operator associated with and as follows: where is a positive number.
In 1998, Huang  studied problem (18) in the case where is maximal monotone and is strongly monotone and Lipschitz continuous with . Subsequently, Zeng et al.  further studied problem (18) in the case which is more general than Huang's . Moreover, the authors  obtained the same strong convergence conclusion as in Huang's result . In addition, the authors also gave the geometric convergence rate estimate for approximate solutions. Also, various types of iterative algorithms for solving variational inclusions have been further studied and developed; for more details, refer to [21, 26, 37, 38] and the references therein.
Motivated and inspired by the above facts, we, in this paper, introduce and analyze a new iterative algorithm by a hybrid extragradient-like viscosity method for finding a common element of the set of solutions of a generalized mixed equilibrium problem, the set of solutions of a finite family of variational inclusions for maximal monotone and inverse strong monotone mappings, and the set of fixed points of a countable family of nonexpansive mappings in a real Hilbert space. Under some appropriate conditions, we prove the strong convergence of the sequence generated by the proposed algorithm to a common solution of these three problems. Such a solution also solves an optimization problem. Several special cases are also discussed. The results presented in this paper are the supplement, extension, improvement, and generalization of the previously known results in this area.
Throughout this paper, we assume that is a real Hilbert space whose inner product and norm are denoted by and , respectively. Let be a nonempty closed convex subset of . We write to indicate that the sequence converges weakly to and to indicate that the sequence converges strongly to . Moreover, we use to denote the weak -limit set of the sequence ; that is, Recall that a mapping is called(i)monotone if (ii)-strongly monotone if there exists a constant such that (iii)-inverse-strongly monotone if there exists a constant such that
It is easy to see that the projection is -ism. Inverse strongly monotone (also referred to as cocoercive) operators have been applied widely in solving practical problems in various fields.
The metric (or nearest point) projection from onto is the mapping which assigns to each point the unique point satisfying the property
Some important properties of projections are gathered in the following proposition.
Proposition 1. For given and :(i),;(ii),;(iii),. (This implies thatis nonexpansive and monotone.)
By using the technique of , we can readily obtain the following elementary result.
Proposition 2 (see [16, Lemma 1 and Proposition 1]). Let be a nonempty closed convex subset of a real Hilbert space and let be a lower semicontinuous and convex function. Let be a bifunction satisfying the conditions (H1)–(H4). Assume that(i)is strongly convex with constantand the functionis weakly upper semicontinuous for each;(ii)for each and , there exists a bounded subset and such that for any ,
Then the following hold:(a)for each ,;(b) is single-valued;(c) is nonexpansive if is Lipschitz continuous with constant and where for ;(d)for all and (e);(f) is closed and convex. In particular, whenever is a bifunction satisfying the conditions (H1)–(H4) and ,, then, that is, for any , ( is firmly nonexpansive) and In this case, is rewritten as . If, in addition, , then is rewritten as (see [15, Lemma 2.1] for more details).
Remark 3. Suppose is strongly convex with constant and is Lipschitz continuous with constant . Then is -strongly monotone and -Lipschitz continuous with positive constants . Utilizing Proposition 2(d) we obtain that for all and
which immediately implies that
We need some facts and tools in a real Hilbert space which are listed as lemmas below.
Lemma 4. Let be a real inner product space. Then there holds the following inequality:
Lemma 5. Let be a real Hilbert space. Then the following hold:(a) for all ;(b) for all and with ;(c)if is a sequence in such that , it follows that
We have the following crucial lemmas concerning the -mappings defined by (15).
Remark 8 (see [40, Remark 3.2]). Utilizing Lemma 6, we define a mapping as follows: Such a is called the -mapping generated by and . Since is nonexpansive, is also nonexpansive. Indeed, observe that for each If is a bounded sequence in , then we put . Hence, it is clear from Remark 3 that for an arbitrary there exists such that for all This implies that
Lemma 9 (see [39, Lemma 3.3]). Let be a sequence of nonexpansive self-mappings on such that and let be a sequence in for some . Then, .
Lemma 10 (see [41, Theorem 10.4 (Demiclosedness Principle)]). Let be a nonempty closed convex subset of a real Hilbert space . Let be nonexpansive. Then is demiclosed on . That is, whenever is a sequence in weakly converging to some and the sequence strongly converges to some , it follows that . Here is the identity operator of .
Lemma 11. Let be a monotone mapping. In the context of the variational inequality problem the characterization of the projection (see Proposition 1(i)) implies
The following lemma can be easily proven, and therefore, we omit the proof.
Lemma 12. Let be an -Lipschitzian mapping with constant and be a -Lipschitzian and -strongly monotone operator with positive constants . Then for ,
That is, is strongly monotone with constant .
Let be a nonempty closed convex subset of a real Hilbert space . We introduce some notations. Let be a number in and let . Associating with a nonexpansive mapping , we define the mapping by where is an operator such that, for some positive constants , is -Lipschitzian and -strongly monotone on ; that is, satisfies the conditions: for all .
Lemma 13 (see [42, Lemma 3.1]). is a contraction provided ; that is, where .
Recall that a set-valued mapping is called monotone if for all ,, and imply A set-valued mapping is called maximal monotone if is monotone and for each , where is the identity mapping of . We denote by the graph of . It is known that a monotone mapping is maximal if and only if, for , for every implies that . Next we provide an example to illustrate the concept of maximal monotone mapping.
Let be a monotone, -Lipschitz-continuous mapping and let be the normal cone to at ; that is, Define Then, is maximal monotone and if and only if ; see .
Lemma 14. is single-valued and firmly nonexpansive; that is, Consequently, is nonexpansive and monotone.
Lemma 16 (see ). Let be a maximal monotone mapping with and let be a strongly monotone, continuous, and single-valued mapping. Then for each , the equation has a unique solution for .
Lemma 17 (see ). Let be a maximal monotone mapping with and be a monotone, continuous, and single-valued mapping. Then for each . In this case, is maximal monotone.
Lemma 18 (see ). Let be a nonempty closed convex subset of a real Hilbert space , and be a proper lower semicontinuous differentiable convex function. If is a solution the minimization problem then, In particular, if solves (OP), then
Lemma 19 (see ). Let be a sequence of nonnegative real numbers satisfying where ,, and are three real sequences satisfying the conditions:(i),;(ii);(iii),.Then .
3. Main Results
We introduce and analyze a new iterative algorithm by hybrid extragradient-like viscosity method for finding a common element of the set of solutions of a generalized mixed equilibrium problem, the set of solutions of a finite family of variational inclusions for maximal monotone and inverse strong monotone mappings, and the set of fixed points of a countable family of nonexpansive mappings in a real Hilbert space. Under appropriate conditions imposed on the parameter sequences we will prove a strong convergence of the proposed algorithm.
Theorem 20. Let be a nonempty closed convex subset of a real Hilbert space . Let be an integer. Let be a bifunction from to satisfying (H1)–(H4) and be a lower semicontinuous and convex functional. Let be a maximal monotone mapping and let and be -inverse strongly monotone and -inverse strongly monotone, respectively, where . Let be a sequence of nonexpansive self-mappings on and be a sequence in for some . Let be a -Lipschitzian and -strongly monotone operator with positive constants . Let and . Let be an -Lipschitzian mapping with . Let be the -mapping defined by (15) and be a -strongly positive bounded linear operator with . Assume that is nonempty. Suppose ,, and are three sequences in . Assume that(i) is strongly convex with constant and its derivative is Lipschitz continuous with constant such that the function is weakly upper semicontinuous for each ;(ii)for each , there exist a bounded subset and such that for any , (iii),, and (iv),, and satisfies (v). Given arbitrarily, then the sequence generated iteratively by converges strongly to provided is firmly nonexpansive, where is a unique solution of the VIP:
Proof. Since and , we may assume, without loss of generality, that . Since is a -strongly positive bounded linear operator on , we know that
that is, is positive. It follows that
for all and , where is the identity mapping on . Then we have that .
We divide the rest of the proof into several steps.
Step 1. We show that is bounded. Indeed, take arbitrarily. Since , is -inverse strongly monotone and , we have, for any , Since , , and is -inverse strongly monotone, where ,, by Lemma 14 we deduce that for each Combining (62) and (63), we have Set . Then from (56) and (64), we obtain Therefore, by Lemma 13 we have By induction, we get Therefore, is bounded and so are the sequences ,,,,,, and .
Step 2. We show that as .
Indeed, define Then from the definition of , we obtain It follows that From (15), since ,, and are all nonexpansive, we have where is a constant such that On the other hand, we estimate . Taking into consideration that and , we may assume, without loss of generality, that and . Utilizing Remark 3 and Lemma 14, we have where for some .
Note that Hence, from (70), (71), (74), and (75) it follows that