- Research
- Open access
- Published:
An iterative method for a common solution of generalized mixed equilibrium problems, variational inequalities, and hierarchical fixed point problems
Fixed Point Theory and Applications volume 2014, Article number: 155 (2014)
Abstract
In this paper, we suggest and analyze an iterative method for finding a common solution of a variational inequality, a generalized mixed equilibrium problem, and a hierarchical fixed point problem in the setting of real Hilbert spaces. We prove the strong convergence of the sequence generated by the proposed method to a common solution of a variational inequality, a generalized mixed equilibrium problem, and a hierarchical fixed point problem. Several special cases are also discussed. The results presented in this paper extend and improve some well-known results in the literature.
MSC:49J30, 47H09, 47J20.
1 Introduction
Let H be a real Hilbert space whose inner product and norm are denoted by and . Let C be a nonempty closed convex subset of H. Let be a bifunction, be a nonlinear mapping, and be a function. Recently, Peng and Yao [1] considered the following generalized mixed equilibrium problem (GMEP), which involves finding such that
The set of solutions of (1.1) is denoted by . The GMEP is very general in the sense that it includes, as special cases, optimization problems, variational inequalities, minimax problems, and Nash equilibrium problems; see, for example, [2–5]. For instance, we quote reference [6] for a general system of generalized equilibrium problems.
Very recently, based on Yamada’s hybrid steepest-descent method [7] and Colao, Marino, and Xu’s hybrid viscosity approximation method [8], Ceng et al. [5] introduced a hybrid iterative method for finding a common element of the set of solutions of a generalized mixed equilibrium problem and the set of fixed points of finitely many nonexpansive mappings in a real Hilbert space. Under suitable assumptions, they proved the strong iterative algorithm to a common solution of problem (1.1) and the fixed point problem of finitely many nonexpansive mappings. By combining Korpelevič’s extragradient method [9], the hybrid steepest-descent method in [7], the viscosity approximation method, and the averaged mapping approach to the gradient-projection algorithm in [10], Al-Mazrooei et al. [2] proposed implicit and explicit iterative algorithms for finding a common element of the set of solutions of the convex minimization problem, the set of solutions of a finite family of generalized mixed equilibrium problems, and the set of solutions of a finite family of variational inequality problems for inverse strong monotone mappings in a real Hilbert space. Under very mild control conditions, they proved that the sequences generated by the proposed algorithms converge strongly to a common element of three sets, which is the unique solution of a variational inequality defined over the intersection of three sets.
If , then the generalized mixed equilibrium problem (1.1) becomes the following mixed equilibrium problem: Find such that
Problem (1.2) was studied by Ceng and Yao [11]. The set of solutions of (1.2) is denoted by .
If , then the generalized mixed equilibrium problem (1.1) becomes the following generalized equilibrium problem: Find such that
Problem (1.3) was studied by Takahashi and Takahashi [12]. The set of solutions of (1.3) is denoted by .
If and , then the generalized mixed equilibrium problem (1.1) becomes the following equilibrium problem: Find such that
The solution set of (1.4) is denoted by . Numerous problems in physics, optimization, and economics reduce to finding a solution of (1.4), see [13, 14].
Let A be a mapping from C into H. A classical variational inequality problem is to find a vector such that
The solution set of (1.5) is denoted by . It is easy to observe that
We now have a variety of techniques to suggest and analyze various iterative algorithms for solving variational inequalities and related optimization problems; see [1–41]. The fixed point theory has played an important role in the development of various algorithms for solving variational inequalities. Using the projection operator technique, one usually establishes an equivalence between variational inequalities and fixed point problems. We introduce the following definitions, which are useful in the following analysis.
Definition 1.1 The mapping is said to be
-
(a)
monotone if
-
(b)
strongly monotone if there exists such that
-
(c)
α-inverse strongly monotone if there exists such that
-
(d)
nonexpansive if
-
(e)
k-Lipschitz continuous if there exists a constant such that
-
(f)
a contraction on C if there exists a constant such that
It is easy to observe that every α-inverse strongly monotone T is monotone and Lipschitz continuous. It is well known that every nonexpansive operator satisfies, for all , the inequality
and therefore, we get, for all ,
The fixed point problem for the mapping T is to find such that
We denote by the set of solutions of (1.8). It is well known that is closed and convex, and is well defined.
Let be a nonexpansive mapping. The following problem is called a hierarchical fixed point problem: Find such that
It is known that the hierarchical fixed point problem (1.9) links with some monotone variational inequalities and convex programming problems; see [15]. Various methods have been proposed to solve the hierarchical fixed point problem; see [16–20]. In 2010, Yao et al. [15] introduced the following strong convergence iterative algorithm to solve problem (1.9):
where is a contraction mapping and and are two sequences in . Under some certain restrictions on the parameters, Yao et al. proved that the sequence generated by (1.10) converges strongly to , which is the unique solution of the following variational inequality:
In 2011, Ceng et al. [21] investigated the following iterative method:
where U is a Lipschitzian mapping, and F is a Lipschitzian and strongly monotone mapping. They proved that under some approximate assumptions on the operators and parameters, the sequence generated by (1.12) converges strongly to the unique solution of the variational inequality
Very recently, Ceng et al. [22] introduced and analyzed hybrid implicit and explicit viscosity iterative algorithms for solving a general system of variational inequalities with hierarchical fixed point problem constraint for a countable family of nonexpansive mappings in a real Banach space, which can be viewed as an extension and improvement of the recent results in the literature.
In this paper, motivated by the work of Ceng et al. [5, 21, 24], Al-Mazrooei et al. [2], Yao et al. [15], Bnouhachem [23] and by the recent work going in this direction, we give an iterative method for finding the approximate element of the common set of solutions of (1.1), (1.5), and (1.9) in a real Hilbert space. We establish a strong convergence theorem based on this method. We would like to mention that our proposed method is quite general and flexible and includes many known results for solving of variational inequality problems, mixed equilibrium problems and hierarchical fixed point problems; see, e.g., [15, 16, 18, 21, 23, 25] and relevant references cited therein.
2 Preliminaries
In this section, we list some fundamental lemmas that are useful in the consequent analysis. The first lemma provides some basic properties of projection onto C.
Lemma 2.1 Let denote the projection of H onto C. Then we have the following inequalities:
Assumption 2.1 [1]
Let be a bifunction and be a function satisfying the following assumptions:
(A1) , ;
(A2) is monotone, i.e., , ;
(A3) for each , ;
(A4) for each , is convex and lower semicontinuous;
(B1) for each and , there exists a bounded subset K of C and such that
(B2) C is a bounded set.
Lemma 2.2 [1]
Let C be a nonempty closed convex subset of H. Let satisfy (A1)-(A3), and let be a proper lower semicontinuous and convex function. Assume that either (B1) or (B2) holds. For and , define a mapping as follows:
Then the following hold:
-
(i)
is nonempty and single-valued;
-
(ii)
is firmly nonexpansive, i.e.,
-
(iii)
;
-
(iv)
is closed and convex.
Lemma 2.3 [26]
Let C be a nonempty closed convex subset of a real Hilbert space H. If is a nonexpansive mapping with , then the mapping is demiclosed at 0, i.e., if is a sequence in C weakly converging to x and if converges strongly to 0, then .
Lemma 2.4 [21]
Let be a τ-Lipschitzian mapping, and let be a k-Lipschitzian and η-strongly monotone mapping, then for , is -strongly monotone, i.e.,
Lemma 2.5 [27]
Suppose that and . Let be a k-Lipschitzian and η-strongly monotone operator. In association with a nonexpansive mapping , define the mapping by
Then is a contraction provided , that is,
where .
Lemma 2.6 [28]
Assume that is a sequence of nonnegative real numbers such that
where is a sequence in and is a sequence such that
-
(1)
;
-
(2)
or .
Then .
Lemma 2.7 [29]
Let C be a closed convex subset of H. Let be a bounded sequence in H. Assume that
-
(i)
the weak w-limit set , where ;
-
(ii)
for each , exists.
Then is weakly convergent to a point in C.
3 The proposed method and some properties
In this section, we suggest and analyze our method for finding common solutions of the generalized mixed equilibrium problem (1.1), the variational inequality (1.5), and the hierarchical fixed point problem (1.9).
Let C be a nonempty closed convex subset of a real Hilbert space H. Let be -inverse strongly monotone mappings, respectively. Let satisfy (A1)-(A4), and let be a proper lower semicontinuous and convex function. Let be nonexpansive mappings such that . Let be a k-Lipschitzian mapping and be η-strongly monotone, and let be a τ-Lipschitzian mapping.
Algorithm 3.1 For an arbitrarily given , let the iterative sequences , , , and be generated by
where , . Suppose that the parameters satisfy , , where . Also , , and are sequences in satisfying the following conditions:
-
(a)
, ,
-
(b)
and ,
-
(c)
,
-
(d)
, , and ,
-
(e)
and ,
-
(f)
and .
Remark 3.1 Our method can be viewed as an extension and improvement for some well-known results, for example, the following.
-
If , the proposed method is an extension and improvement of the method of Bnouhachem [23] and Wang and Xu [30] for finding the approximate element of the common set of solutions of generalized mixed equilibrium and hierarchical fixed point problems in a real Hilbert space.
-
If we have the Lipschitzian mapping , , , , and , we obtain an extension and improvement of the method of Yao et al.[15] for finding the approximate element of the common set of solutions of generalized mixed equilibrium and hierarchical fixed point problems in a real Hilbert space.
-
The contractive mapping f with a coefficient in other papers [15, 25, 27] is extended to the cases of the Lipschitzian mapping U with a coefficient constant .
This shows that Algorithm 3.1 is quite general and unifying.
Lemma 3.1 Let . Then , , , and are bounded.
Proof First, we show that the mapping is nonexpansive. For any ,
Similarly, we can show that the mapping is nonexpansive. It follows from Lemma 2.2 that . Let , we have .
Since the mapping A is α-inverse strongly monotone, we have
We define . Next, we prove that the sequence is bounded, and without loss of generality we can assume that for all . From (3.1), we have
where the third inequality follows from Lemma 2.5. By induction on n, we obtain for and . Hence is bounded, and consequently, we deduce that , , , , , , , and are bounded. □
Lemma 3.2 Let and be the sequence generated by Algorithm 3.1. Then we have
-
(a)
.
-
(b)
The weak w-limit set ().
Proof From the nonexpansivity of the mapping and , we have
Next, we estimate that
It follows from (3.3) and (3.4) that
On the other hand, and , we have
and
Taking in (3.6) and in (3.7), we get
and
Adding (3.8) and (3.9) and using the monotonicity of , we have
which implies that
and then
Without loss of generality, let us assume that there exists a real number μ such that for all positive integers n. Then we get
It follows from (3.5) and (3.10) that
Next, we estimate
where the second inequality follows from Lemma 2.5. From (3.11) and (3.12), we have
Here
It follows by conditions (a)-(e) of Algorithm 3.1 and Lemma 2.6 that
Next, we show that . Since , by using (3.1) and (3.2), we obtain
which implies that
Then from the above inequality, we get
Since , , , , , and , we obtain and .
Since is firmly nonexpansive, we have
Hence, we get
From (3.14), (3.2), and the above inequality, we have
which implies that
Hence
Since , , , and , we obtain
From (2.2), we get
Hence
From (3.14) and the inequality above, we have
which implies that
Hence
Since , , , , and , we get
It follows from (3.15) and (3.17) that
which implies that
Since , , we obtain
Since , we have
Since , , , , , and are bounded and , we obtain
Since is bounded, without loss of generality we can assume that . It follows from Lemma 2.3 that . Therefore . □
Theorem 3.1 The sequence generated by Algorithm 3.1 converges strongly to z, which is the unique solution of the variational inequality
Proof Since is bounded and from Lemma 3.2, we have . Next, we show that . Since , we have
It follows from the monotonicity of that
and
Since and , it is easy to observe that . For any and , let , and we have . Then from (3.20), we obtain
Since D is Lipschitz continuous and , we obtain . From the monotonicity of D, the weakly lower semicontinuity of φ and , it follows from (3.21) that
Hence, from assumptions (A1)-(A4) and (3.22), we have
which implies that . Letting , we have
which implies that .
Furthermore, we show that . Let
where is the normal cone to C at . Then T is maximal monotone and if and only if (see [31]). Let denote the graph of T, and let ; since and , we have
On the other hand, it follows from and that
and
Therefore, from (3.24) and the inverse strong monotonicity of A, we have
Since and , it is easy to observe that . Hence, we obtain . Since T is maximal monotone, we have , and hence . Thus we have
Observe that the constants satisfy and
therefore, from Lemma 2.4, the operator is -strongly monotone, and we get the uniqueness of the solution of the variational inequality (3.19) and denote it by .
Next, we claim that . Since is bounded, there exists a subsequence of such that
Next, we show that . We have
which implies that
Let and .
We have
and
It follows that
Thus all the conditions of Lemma 2.6 are satisfied. Hence we deduce that . This completes the proof. □
4 Applications
In this section, we obtain the following results by using a special case of the proposed method for example.
Putting and in Algorithm 3.1, we obtain the following result which can be viewed as an extension and improvement of the method of Wang and Xu [30] for finding the approximate element of the common set of solutions of a generalized mixed equilibrium problem and a hierarchical fixed point problem in a real Hilbert space.
Corollary 4.1 Let C be a nonempty closed convex subset of a real Hilbert space H. Let be a θ-inverse strongly monotone mapping. Let be a bifunction satisfying assumptions (i)-(iv) of Lemma 2.2 and be nonexpansive mappings such that . Let be a k-Lipschitzian mapping and η-strongly monotone, and let be a τ-Lipschitzian mapping. For an arbitrarily given , let the iterative sequences , , , and be generated by
where , , . Suppose that the parameters satisfy , , where . Also , , and are sequences satisfying conditions (b)-(e) of Algorithm 3.1. The sequence converges strongly to z, which is the unique solution of the variational inequality
Putting , , , , and , we obtain an extension and improvement of the method of Yao et al. [15] for finding the approximate element of the common set of solutions of a generalized mixed equilibrium problem and a hierarchical fixed point problem in a real Hilbert space.
Corollary 4.2 Let C be a nonempty closed convex subset of a real Hilbert space H. Let be a θ-inverse strongly monotone mapping. Let be a bifunction satisfying assumptions (i)-(iv) of Lemma 2.2 and be nonexpansive mappings such that . Let be a τ-Lipschitzian mapping. For an arbitrarily given , let the iterative sequences , , , and be generated by
where , , are sequences in satisfying conditions (b)-(e) of Algorithm 3.1. The sequence converges strongly to z, which is the unique solution of the variational inequality
Next, the following example shows that conditions (a)-(f) of Algorithm 3.1 are satisfied.
Example 4.1 Let , , (with ), , and .
We have
and
Conditions (a) and (b) are satisfied.
Condition (c) is satisfied. We compute
It is easy to show . Similarly, we can show and . The sequences , , and satisfy condition (d). We have
and
Then the sequence satisfies condition (e). We compute
Then the sequence satisfies condition (f).
Remark 4.1 In the hierarchical fixed point problem (1.9), if , then we can get the variational inequality (3.19). In (3.19), if then we get the variational inequality , , which just is the variational inequality studied by Suzuki [27] extending the common set of solutions of a system of variational inequalities, a generalized mixed equilibrium problem and a hierarchical fixed point problem.
5 Conclusions
In this paper, we suggest and analyze an iterative method for finding the approximate element of the common set of solutions of (1.1), (1.5), and (1.9) in a real Hilbert space, which can be viewed as a refinement and improvement of some existing methods for solving a variational inequality problem, a generalized mixed equilibrium problem, and a hierarchical fixed point problem. Some existing methods (e.g., [15, 16, 18, 21, 23, 25]) can be viewed as special cases of Algorithm 3.1. Therefore, the new algorithm is expected to be widely applicable.
References
Peng JW, Yao JC: A new hybrid-extragradient method for generalized mixed equilibrium problems and fixed point problems and variational inequality problems. Taiwan. J. Math. 2008, 12(6):1401–1432.
Al-Mazrooei AE, Latif A, Yao JC: Solving generalized mixed equilibria, variational inequalities,and constrained convex minimization. Abstr. Appl. Anal. 2014., 2014: Article ID 587865
Ansari QH, Schaible S, Yao JC: The system of generalized vector equilibrium problems with applications. J. Glob. Optim. 2002, 22: 3–16. 10.1023/A:1013857924393
Ceng LC, Hu HY, Wong MM: Strong and weak convergence theorems for generalized mixed equilibrium problem with perturbation and fixed pointed problem of infinitely many nonexpansive mappings. Taiwan. J. Math. 2011, 15(3):1341–1367.
Ceng LC, Guu SM, Yao JC: Hybrid iterative method for finding common solutions of generalized mixed equilibrium and fixed point problems. Fixed Point Theory Appl. 2012., 2012: Article ID 92
Ceng LC, Ansari QH, Schaible S, Yao JC: Iterative methods for generalized equilibrium problems, systems of general generalized equilibrium problems and fixed point problems for nonexpansive mappings in Hilbert spaces. Fixed Point Theory 2011, 12(2):293–308.
Yamada I: The hybrid steepest-descent method for the variational inequality problems over the intersection of the fixed point sets of nonexpansive mappings. In Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications. Edited by: Batnariu D, Censor Y, Reich S. North-Holland, Amsterdam; 2001:473–504.
Colao V, Marino G, Xu HK: An iterative method for finding common solutions of equilibrium and fixed point problems. J. Math. Anal. Appl. 2008, 344: 340–352. 10.1016/j.jmaa.2008.02.041
Korpelevič GM: An extragradient method for finding saddle points and for other problems. Èkon. Mat. Metody 1976, 12(4):747–756.
Xu HK: Averaged mappings and the gradient-projection algorithm. J. Optim. Theory Appl. 2011, 150(2):360–378. 10.1007/s10957-011-9837-z
Ceng LC, Yao JC: A hybrid iterative scheme for mixed equilibrium problems and fixed point problems. J. Comput. Appl. Math. 2008, 214: 186–201. 10.1016/j.cam.2007.02.022
Takahashi S, Takahashi W: Strong convergence theorem for a generalized equilibrium problem and a nonexpansive mapping in a Hilbert space. Nonlinear Anal. 2008, 69: 1025–1033. 10.1016/j.na.2008.02.042
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 Anal. 2009, 70: 3307–3319. 10.1016/j.na.2008.04.035
Qin X, Shang M, Su Y: A general iterative method for equilibrium problem and fixed point problem in Hilbert spaces. Nonlinear Anal. 2008, 69: 3897–3909. 10.1016/j.na.2007.10.025
Yao Y, Cho YJ, Liou YC: Iterative algorithms for hierarchical fixed points problems and variational inequalities. Math. Comput. Model. 2010, 52(9–10):1697–1705. 10.1016/j.mcm.2010.06.038
Mainge PE, Moudafi A: Strong convergence of an iterative method for hierarchical fixed-point problems. Pac. J. Optim. 2007, 3(3):529–538.
Moudafi A: Krasnoselski-Mann iteration for hierarchical fixed-point problems. Inverse Probl. 2007, 23(4):1635–1640. 10.1088/0266-5611/23/4/015
Cianciaruso F, Marino G, Muglia L, Yao Y: On a two-step algorithm for hierarchical fixed point problems and variational inequalities. J. Inequal. Appl. 2009., 2009: Article ID 208692
Gu G, Wang S, Cho YJ: Strong convergence algorithms for hierarchical fixed points problems and variational inequalities. J. Appl. Math. 2011., 2011: Article ID 164978
Marino G, Xu HK: Explicit hierarchical fixed point approach to variational inequalities. J. Optim. Theory Appl. 2011, 149(1):61–78. 10.1007/s10957-010-9775-1
Ceng LC, Ansari QH, Yao JC: Some iterative methods for finding fixed points and for solving constrained convex minimization problems. Nonlinear Anal. 2011, 74: 5286–5302. 10.1016/j.na.2011.05.005
Ceng LC, Al-Mezel SA, Latif A: Hybrid viscosity approaches to general systems of variational inequalities with hierarchical fixed point problem constraints in Banach spaces. Abstr. Appl. Anal. 2014., 2014: Article ID 945985
Bnouhachem A: A modified projection method for a common solution of a system of variational inequalities, a split equilibrium problem and a hierarchical fixed-point problem. Fixed Point Theory Appl. 2014., 2014: Article ID 22
Ceng LC, Ansari QH, Yao JC: Iterative methods for triple hierarchical variational inequalities in Hilbert spaces. J. Optim. Theory Appl. 2011, 151: 489–512. 10.1007/s10957-011-9882-7
Tian M: A general iterative algorithm for nonexpansive mappings in Hilbert spaces. Nonlinear Anal. 2010, 73: 689–694. 10.1016/j.na.2010.03.058
Geobel K, Kirk WA Stud. Adv. Math. 28. In Topics in Metric Fixed Point Theory. Cambridge University Press, Cambridge; 1990.
Suzuki N: Moudafi’s viscosity approximations with Meir-Keeler contractions. J. Math. Anal. Appl. 2007, 325: 342–352. 10.1016/j.jmaa.2006.01.080
Xu HK: Iterative algorithms for nonlinear operators. J. Lond. Math. Soc. 2002, 66: 240–256. 10.1112/S0024610702003332
Acedo GL, Xu HK: Iterative methods for strictly pseudo-contractions in Hilbert space. Nonlinear Anal. 2007, 67: 2258–2271. 10.1016/j.na.2006.08.036
Wang Y, Xu W: Strong convergence of a modified iterative algorithm for hierarchical fixed point problems and variational inequalities. Fixed Point Theory Appl. 2013., 2013: Article ID 121
Rockafellar RT: On the maximality of sums nonlinear monotone operators. Trans. Am. Math. Soc. 1970, 149: 75–88. 10.1090/S0002-9947-1970-0282272-5
Ansari QH, Lalitha CS, Mehta M: Generalized Convexity, Nonsmooth Variational Inequalities and Nonsmooth Optimization. Taylor & Francis, London; 2013.
Ansari QH, Yao JC: Systems of generalized variational inequalities and their applications. Appl. Anal. 2000, 76: 203–217. 10.1080/00036810008840877
Ceng LC, Wang CY, Yao JC: Strong convergence theorems by a relaxed extragradient method for a general system of variational inequalities. Math. Methods Oper. Res. 2008, 67: 375–390. 10.1007/s00186-007-0207-4
Ceng LC, Al-Mezel SA, Ansari QH: Implicit and explicit iterative methods for systems of variational inequalities and zeros of accretive operators. Abstr. Appl. Anal. 2013., 2013: Article ID 631382
Cianciaruso F, Marino G, Muglia L, Yao Y: A hybrid projection algorithm for finding solutions of mixed equilibrium problem and variational inequality problem. Fixed Point Theory Appl. 2010., 2010: Article ID 383740
Crombez G: A hierarchical presentation of operators with fixed points on Hilbert spaces. Numer. Funct. Anal. Optim. 2006, 27: 259–277. 10.1080/01630560600569957
Latif A, Ceng LC, Ansari QH: Multi-step hybrid viscosity method for systems of variational inequalities defined over sets of solutions of equilibrium problem and fixed point problems. Fixed Point Theory Appl. 2012., 2012: Article ID 186
Marino G, Muglia L, Yao Y: Viscosity methods for common solutions of equilibrium and variational inequality problems via multi-step iterative algorithms and common fixed points. Nonlinear Anal. 2012, 75: 1787–1798. 10.1016/j.na.2011.09.019
Peng JW, Yao JC: Strong convergence theorems of iterative scheme based on the extragradient method for mixed equilibrium problems and fixed point problems. Math. Comput. Model. 2009, 49: 1816–1828. 10.1016/j.mcm.2008.11.014
Verma RU: General convergence analysis for two-step projection methods and applications to variational problems. Appl. Math. Lett. 2005, 18: 1286–1292. 10.1016/j.aml.2005.02.026
Acknowledgements
The authors are very grateful to the referees for their careful reading, comments, and suggestions, which improved the presentation of this article. The first author would like to thank Prof. Xindan Li, Dean of the School of Management and Engineering of Nanjing University, for providing excellent research facilities. The second author was supported by NSFC 71173098.
Author information
Authors and Affiliations
Corresponding author
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors’ contributions
All authors contributed equally and significantly in writing this article. All authors read and approved the final manuscript.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (https://creativecommons.org/licenses/by/4.0), which permits use, duplication, adaptation, distribution, and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Bnouhachem, A., Chen, Y. An iterative method for a common solution of generalized mixed equilibrium problems, variational inequalities, and hierarchical fixed point problems. Fixed Point Theory Appl 2014, 155 (2014). https://doi.org/10.1186/1687-1812-2014-155
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/1687-1812-2014-155