- Research
- Open access
- Published:
A hybrid iterative method for a combination of equilibria problem, a combination of variational inequality problems and a hierarchical fixed point problem
Fixed Point Theory and Applications volume 2014, Article number: 163 (2014)
Abstract
In this paper, we introduce and analyze a general iterative algorithm for finding a common solution of a combination of variational inequality problems, a combination of equilibria problem, and a hierarchical fixed point problem in the setting of real Hilbert space. Under appropriate conditions we derive the strong convergence results for this method. Several special cases are also discussed. Preliminary numerical experiments are included to verify the theoretical assertions of the proposed method. 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, the equilibrium problem is to find such that
which was considered and investigated by Blum and Oettli [1]. The solution set of (1.1) is denoted by . Equilibrium problems theory provides us with a unified, natural, innovative, and general framework to study a wide class of problems arising in finance, economics, network analysis, transportation, elasticity, and optimization. This theory has witnessed an explosive growth in theoretical advances and applications across all disciplines of pure and applied sciences; see [2–11].
If , where is a nonlinear operator, then problem (1.1) is equivalent to finding a vector such that
which is known as the classical variational inequality. The solution of (1.2) is denoted by . It is easy to observe that
Variational inequalities are being used as a mathematical programming tool in modeling a large class of problems arising in various branches of pure and applied sciences. In recent years, variational inequalities have been generalized and extended novel and new techniques in several directions. We now have a variety of techniques to suggest and analyze various iterative algorithms for solving variational inequalities and related optimization problems; see [1–33].
For , let be bifunctions and with . Define the mapping . The combination of equilibria problem is to find such that
which was considered and investigated by Suwannaut and Kangtunyakarn [12]. The set of solutions (1.3) is denoted by
If , , then the combination of equilibria problem (1.3) reduces to the equilibrium problem (1.1).
For , let be a strongly positive linear bounded operator on a Hilbert space H with coefficient and with . The combination of variational inequality problems is to find such that
If , , then the combination of variational inequality problems (1.4) reduces to the variational inequality problem (1.2).
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)
strongly positive linear bounded 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.7). 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 well known that the hierarchical fixed point problem (1.8) links with some monotone variational inequalities and convex programming problems; see [13]. Various methods have been proposed to solve the hierarchical fixed point problem; see [14–21]. By combining Korpelevich’s extragradient method and the viscosity approximation method, Ceng et al. [22] introduced and analyzed implicit and explicit iterative schemes for computing a common element of the set of fixed points of a nonexpansive mapping and the set of solutions of the variational inequality for an α-inverse-strongly monotone mapping in a Hilbert space. Under suitable assumptions, they proved the strong convergence of the sequences generated by the proposed schemes.
In 2010, Yao et al. [13] introduced the following strong convergence iterative algorithm to solve problem (1.8):
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.9) converges strongly to , which is the unique solution of the following variational inequality:
In 2011, Ceng et al. [23] 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.11) converges strongly to the unique solution of the variational inequality
Very recently, in 2013, Wang and Xu [24] investigated an iterative method for a hierarchical fixed point problem by
where is a nonexpansive mapping. They proved that under some approximate assumptions on the operators and parameters, the sequence generated by (1.13) converges strongly to the unique solution of the variational inequality (1.12).
In this paper, motivated by the work of Ceng et al. [23, 26], Yao et al. [13], Wang and Xu [24], Bnouhachem [15, 25] 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.3), (1.4), and (1.8) 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, equilibrium problems, and hierarchical fixed point problems; see, e.g., [13, 16, 18, 23, 25, 27] 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 satisfying the following assumptions:
(A1) , ;
(A2) is monotone, i.e., , ;
(A3) for each , ;
(A4) for each , is convex and lower semicontinuous.
Lemma 2.2 [2]
Let C be a nonempty closed convex subset of H. Let satisfy (A1)-(A4). Assume that 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 [12]
Let C be a nonempty closed convex subset of a real Hilbert space H. For , let be bifunctions satisfying (A1)-(A4) with . Then satisfies (A1)-(A4) and
where for and .
Lemma 2.4 [28]
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.5 [23]
Let be a τ-Lipschitzian mapping, and let be a k-Lipschitzian and η-strongly monotone mapping, then for , is -strongly monotone, i.e.,
Lemma 2.6 [29]
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.7 [30]
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.8 [31]
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.
Lemma 2.9 [12]
Let C be a nonempty closed convex subset of a real Hilbert space H. For every , let be a strongly positive linear bounded operator on a Hilbert space H with coefficient , i.e., , , and . Let with . Then the following properties hold:
-
(i)
and is a nonexpansive mapping for every ().
-
(ii)
.
3 The proposed method and some properties
In this section, we suggest and analyze our method for finding common solutions of the combination of equilibria problem (1.3), the combination of variational inequality problems (1.4), and the hierarchical fixed point problem (1.8).
Let C be a nonempty closed convex subset of a real Hilbert space H. For , let be bifunctions satisfying (A1)-(A4), let be a strongly positive linear bounded operator on a Hilbert space H with coefficient and , and 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
Suppose that the parameters satisfy , , where . Also , , , and are sequences in satisfying the following conditions:
-
(a)
,
-
(b)
and ,
-
(c)
,
-
(d)
,
-
(e)
, , and ,
-
(f)
and ,
-
(g)
and .
If for , and , then Algorithm 3.1 reduces to Algorithm 3.2 for finding the common solutions of equilibrium problem (1.1), variational inequality problem (1.2) and the hierarchical fixed point problem (1.8).
Algorithm 3.2 For an arbitrarily given arbitrarily, let the iterative sequences , , , and be generated by
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 Wang and Xu [24] and Bnouhachem [25] for finding the approximate element of the common set of solutions of a combination of variational inequality problems, a combination of equilibria problem and a hierarchical fixed point problem 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.[13] for finding the approximate element of the common set of solutions of a combination of variational inequality problems, a combination of equilibria problem and a hierarchical fixed point problem in a real Hilbert space.
-
The contractive mapping f with a coefficient in other papers [13, 27, 29] 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 Let ; we have . It follows from Lemmas 2.2 and 2.3 that . Since is nonexpansive mapping, we have
Since , without loss of generality, we may assume that , and , by Lemma 2.9, the mapping is nonexpansive mapping, and 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.6 and the fifth inequality follows from (3.3). 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.4) and (3.5) that
On the other hand, and , we obtain
and
Taking in (3.7) and in (3.8), we get
and
Adding (3.9) and (3.10) 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.6) and (3.11) that
Next, we estimate that
Applying Lemma 2.6 to get
From (3.12) and (3.14), we have
Substituting (3.15) into (3.13), we get
Here
It follows by conditions (a)-(b), (e)-(g) of Algorithm 3.1 and Lemma 2.7 that
Since , we obtain
Next, we show that . Since is firmly nonexpansive, we have
Hence, we get
From (3.3) and the inequality above, we have
which implies that
Hence,
Since , , , we obtain
By (2.2) and the nonexpansivity of the mapping , we get
Hence
where the second inequality follows from (3.2). From (3.18), and the inequality above, we have
which implies that
Hence,
Since , , , and , we obtain
It follows from (3.19) and (3.20) that
Since , we have
which implies that
Since , , , and and are bounded, and , we obtain
Since is bounded, without loss of generality we can assume that . It follows from Lemma 2.4 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 let us have . Then from (3.23), we obtain
Since , it follows from (3.24) that
Since satisfies (A1)-(A4), it follows from (3.25) that
which implies that . Letting , we have
therefore, .
Furthermore, we show that . Let
where is the normal cone to C at . Then T is maximal monotone and if and only if (see [33]). Let denote the graph of T, and let ; since and , we have
It follows from and that
and
Therefore, from (3.27) and strongly positivity of , 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.5, the operator is strongly monotone, and we get the uniqueness of the solution of the variational inequality (3.22) and denote it by .
Next, we claim that . Since is bounded, there exists a subsequence of such that
By (3.17), we deduce
Next, we show that . Note that
which implies that
From (3.1) and the inequality above, we get
Let
and
We have
and
It follows that
Thus all the conditions of Lemma 2.7 are satisfied. Hence we deduce that . This completes the proof. □
4 Applications
To verify the theoretical assertions, we consider the following examples.
Example 4.1 Let , , , , and .
We have
and
The sequence satisfies condition (b),
Condition (c) is satisfied. We compute
It is easy to show . Similarly, we can show and . The sequences , and satisfy condition (e). We have
and
Then the sequence satisfies condition (f),
Then the sequence satisfies condition (g).
Let ℝ be the set of real numbers, and let the mapping be defined by
let the mapping be defined by
let the mapping be defined by
let the mapping be defined by
and, for , let the mapping be defined by
and , and let the mapping be defined by
and .
It is easy to show that T and S are nonexpansive mappings, F is a 1-Lipschitzian mapping and -strongly monotone, U is a -Lipschitzian, is a strongly positive linear bounded operator, and the satisfy (A1)-(A4). It is clear that
By the definition of , we have
where . Then
Let . is a quadratic function of y with coefficient , , . We determine the discriminant Δ of B as follows:
We have , . If it has at most one solution in ℝ, then , we obtain
For every , from (4.1), we rewrite (3.1) as follows:
In all the tests we take and . In our example, , , . It is easy to show that the parameters satisfy , , where . All codes were written in Matlab, the values of , , , and with different n are reported in Tables 1 and 2.
Remark 4.1 Tables 1 and 2, and Figures 1 and 2 show that the sequences , , and converge to 0, where .
Tables 1 and 2 show that the convergence of Algorithm 3.1 is faster than Algorithm 3.2.
Example 4.2 In this example we take the same mappings and parameters as in Example 4.1 except T and .
Let be defined by
and for , let the mapping be defined by
and . It is clear that
By the definition of , we have
where . Then
Let . is a quadratic function of y with coefficient , , . We determine the discriminant Δ of A as follows:
We have , . If it has at most one solution in ℝ, then , we obtain
For every , we rewrite (3.1) as follows:
Remark 4.2 Table 3 and Figure 3 show that the sequences , , , and converge to 1, where .
Table 3 shows that the convergence of Algorithm 3.1 is faster than Algorithm 3.2.
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.3), (1.4), and (1.8) in real Hilbert space, which can be viewed as a refinement and improvement of some existing methods for solving a variational inequality problem, an equilibrium problem, and a hierarchical fixed point problem. Some existing methods (e.g. [13, 16, 18, 23, 25, 27]) can be viewed as special cases of Algorithm 3.1. Therefore, the new algorithm is expected to be widely applicable. In hierarchical fixed point problem (1.8), if , then we can get the variational inequality (3.22).
In (3.22), if then we get the variational inequality
which just is the variational inequality studied by Suzuki [29] extending the common set of solutions of a combination of variational inequality problems, a combination of equilibria problem, and a hierarchical fixed point problem.
References
Blum E, Oettli W: From optimization and variational inequalities to equilibrium problems. Math. Stud. 1994, 63: 123–145.
Combettes PL, Hirstoaga SA: Equilibrium programming using proximal like algorithms. Math. Program. 1997, 78: 29–41.
Combettes PL, Hirstoaga SA: Equilibrium programming in Hilbert spaces. J. Nonlinear Convex Anal. 2005, 6: 117–136.
Ceng LC, Yao JC: A hybrid iterative scheme for mixed equilibrium problems and fixed point problems. J. Comput. Appl. Math. 2008, 214(1):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(3):1025–1033. 10.1016/j.na.2008.02.042
Reich S, Sabach S: Three strong convergence theorems regarding iterative methods for solving equilibrium problems in reflexive Banach spaces. Contemp. Math. 568. Optimization Theory and Related Topics 2012, 225–240.
Kassay G, Reich S, Sabach S: Iterative methods for solving systems of variational inequalities in reflexive Banach spaces. SIAM J. Optim. 2011, 21: 1319–1344. 10.1137/110820002
Chang SS, Lee HWJ, 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(11):3897–3909. 10.1016/j.na.2007.10.025
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 C, Muglia L, Yao JC: Viscosity methods for common solutions of equilibrium and variational inequality problems via multi-step iterative algorithms and common fixed points. Nonlinear Anal. 2012, 75(4):1787–1798. 10.1016/j.na.2011.09.019
Suwannaut S, Kangtunyakarn A: The combination of the set of solutions of equilibrium problem for convergence theorem of the set of fixed points of strictly pseudo-contractive mappings and variational inequalities problem. Fixed Point Theory Appl. 2013., 2013: Article ID 291
Yao JC, 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
Bnouhachem A: Strong convergence algorithm for split equilibrium problems and hierarchical fixed point problems. Sci. World J. 2014., 2014: Article ID 390956
Bnouhachem A: Strong convergence algorithm for approximating the common solutions of a variational inequality, a mixed equilibrium problem and a hierarchical fixed-point problem. J. Inequal. Appl. 2014., 2014: Article ID 154
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-steps 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
Crombez G: A hierarchical presentation of operators with fixed points on Hilbert spaces. Numer. Funct. Anal. Optim. 2006, 27(3–4):259–277. 10.1080/01630560600569957
Ceng LC, Khan AR, Ansari QH, Yao JC: Viscosity approximation methods for strongly positive and monotone operators. Fixed Point Theory 2009, 10(1):35–71.
Ceng LC, Anasri QH, Yao JC: Some iterative methods for finding fixed points and for solving constrained convex minimization problems. Nonlinear Anal. 2011, 74(16):5286–5302. 10.1016/j.na.2011.05.005
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
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, Anasri 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(3):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(1):342–352. 10.1016/j.jmaa.2006.01.080
Xu HK: Iterative algorithms for nonlinear operators. J. Lond. Math. Soc. 2002, 66(1):240–256. 10.1112/S0024610702003332
Acedo GL, Xu HK: Iterative methods for strictly pseudo-contractions in Hilbert spaces. Nonlinear Anal. 2007, 67(7):2258–2271. 10.1016/j.na.2006.08.036
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
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
Acknowledgement
The author would like to thank Professor Omar Halli, Rector, Ibn Zohr University, for providing excellent research facilities.
Author information
Authors and Affiliations
Corresponding author
Additional information
Competing interests
The author declares that he has no competing interests.
Authors’ original submitted files for images
Below are the links to the authors’ original submitted files for images.
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. A hybrid iterative method for a combination of equilibria problem, a combination of variational inequality problems and a hierarchical fixed point problem. Fixed Point Theory Appl 2014, 163 (2014). https://doi.org/10.1186/1687-1812-2014-163
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/1687-1812-2014-163