Abstract
We present a sufficient condition for the existence of a solution to the generalized vector equilibrium problem on Hadamard manifolds using a version of the Knaster–Kuratowski–Mazurkiewicz Lemma. In particular, the existence of solutions to optimization, vector optimization, Nash equilibria, complementarity, and variational inequality problems is a special case of the existence result for the generalized vector equilibrium problem.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
The generalized vector equilibrium problem (GVEP) has been widely studied and continues to be an active topic for research. One of the primary reasons for this is that multiple problems can be formulated as generalized vector equilibrium problems, such as optimization, vector optimization, Nash equilibria, complementarity, fixed point, and variational inequality problems. Extensive developments of these problems can be found in Fu [1], Fu and Wan [2], Konnov and Yao[3], Ansari et al. [4], Farajzadeh et al. [5], and the references therein. An important question concerns the conditions under which a solution to the GVEP exists. In a linear setting, multiple authors have provided results that answer this question, such as Ansari and Yao [7], Fu [1], Fu and Wan [2], Konnov and Yao[3], Ansari et al. [4], Farajzadeh et al. [5], and the authors referenced in their work. Moreover, it should be noted that Ky Fan studied inequalities in [6], which prompted present equilibrium theory.
Colao et al. [8] and Zhou and Huang [9] were the first authors to examine the existence of solutions for equilibrium problems in the Riemannian context by generalizing the Knaster–Kuratowski–Mazurkiewicz (KKM) Lemma to a Hadamard manifold. Applying the KKM Lemma in a Riemannian setting allowed Zhou and Huang [10] to confirm solution existence for vector optimization problems and vector variational inequalities in this context. Similarly, Li and Huang [11] presented results concerning solution existence for a special class of the GVEP. In this paper, we apply the KKM Lemma in a Riemannian setting in order to prove solution existence for the GVEP. To the best of our knowledge, our contribution is unprecedented. However, it should be noted that the results of this paper include the results presented in [8, 10] and are not included in [11].
This paper is organized as follows. In Sect. 2, we present the notations and basic results used in the paper. Our main results are stated and proved in Sect. 3, and conclusions are discussed in Sect. 4.
2 Notations and Basics Definitions
In this paper, every manifold M is assumed to be Hadamard and finite dimensional. The notations, results, and concepts used throughout this paper can be found in Bento et al. [12].
A set \(\varOmega \subseteq M\) is said to be convex iff any geodesic segment with end points in \(\varOmega \) is contained in \(\varOmega \), that is, iff \(\gamma :[ a,b ]\rightarrow M\) is a geodesic such that \(x =\gamma (a)\in \varOmega \) and \(y =\gamma (b)\in \varOmega \); then \(\gamma ((1-t)a + tb)\in \varOmega \) for all \(t\in [0,1]\). Given an arbitrary set, \({\fancyscript{B}} \subset M\), the minimal convex subset that contains \({\fancyscript{B}}\) is called the convex hull of \({\fancyscript{B}}\) and is denoted by \( \text{ conv }({\fancyscript{B}})\); see [8].
Suppose \(\varOmega \subseteq M\) is a convex set. Then for any set \({\fancyscript{A}}\), we let \(2^{{\fancyscript{A}}}\) represent the set of all subsets of \({\fancyscript{A}}\). Let \(\varOmega \subseteq M\) be a nonempty set and \( {\mathbb {Y}}\) a topological vector space. Given a set-valued mapping \(T: \varOmega \rightrightarrows {{\mathbb {Y}}}\), the domain and range are the sets, respectively, defined by the following:
Moreover, the inverse of T is the set-valued mapping \(T^{-1}: {{\mathbb {Y}}} \rightrightarrows \varOmega \) defined by
A set-valued mapping \(T: \varOmega \rightrightarrows {{\mathbb {Y}}}\) is said to be upper semicontinuous on \(\varOmega \) iff, for each \(x_0\in \varOmega \) and any open set V in \( {\mathbb {Y}}\) containing \(T(x_0)\), there exists an open neighborhood U of \(x_0\) in \(\varOmega \) such that \(T(x)\subset V\) for all \(x\in U\).
The following result is a version of the KKM lemma in Riemannian context due to [8], which is an extension of KKM theorem that can be found, for example, in [13].
Lemma 2.1
Let \(\varOmega \subseteq M\) be a nonempty, closed, and convex set, and \(G:\varOmega \rightrightarrows {\varOmega }\) a set-valued mapping, such that, for each \(y\in \varOmega , G(y)\) is closed. Suppose that there exists \(y_0\in \varOmega \) such that \(G(y_0)\) is compact, and for all \(y_1,\ldots ,y_m\in \varOmega \), we have \(conv (\{y_1,\ldots ,y_m\})\subset \bigcup _{i=1}^{m}G(y_i)\). Then \(\bigcap _{y\in \varOmega }^{}G(y)\ne \varnothing .\)
Proof
See [8, Lemma 3.1]. \(\square \)
3 Generalized Vectorial Equilibrium Problem
In this section, we present a sufficient condition for the existence of a solution to the generalized vector equilibrium problem on Hadamard manifolds. We should note that this material is motivated by the results found in [7]. Henceforth, we let \(\varOmega \subseteq M\) denote a nonempty, closed and convex set, and \( {\mathbb {Y}}\) denote a metric vector space. Assume \(C: \varOmega \rightrightarrows {{\mathbb {Y}}}\) is a set-valued mapping such that
Also suppose \(x\in \varOmega \). A set-valued mapping \(F:\varOmega \times \varOmega \rightrightarrows {{\mathbb {Y}}}\) is called C(x) - quasiconvex-like iff for any geodesic segment \(\gamma :[0, 1]\rightarrow \varOmega \), either \( F(x,\gamma (t))\subseteq F(x,\gamma (0))-C(x)\) or \(F(x,\gamma (t))\subseteq F(x,\gamma (1))-C(x)\), for all \(t\in [0,1]. \)
Example 3.1
Let \({\mathbb {H}}^2 :=\left\{ x=(x_1,x_2) \in {\mathbb {R}}^{2}~:~ x_{2}>0, \right\} \) be the two-dimensional hyperbolic space endowed with the Riemannian metric \(g_{ij}(x_1, x_2):=\delta _{ij}/ x^2_2\), for \(i,j=1,2\). The curvature of \({\mathbb {H}}^2 \) is \(K=-1\), and the geodesics in \({\mathbb {H}}^2\) are semicircles centered on \(x_1\)-axis and vertical lines. Udriste discusses more details of this in [15]. In addition, assume that \(F:{\mathbb {H}}^2\times {\mathbb {H}}^2\rightarrow {\mathbb {R}}\) is the bifunction given by
Since, for every \( c\in {\mathbb {R}}\), the sub-level set
is convex in \({\mathbb {H}}^2\), where \( \psi (y_1, y_2)= F((x_1, x_2), (y_1, y_2))\) and \((x_1, x_2)\in \varOmega \) is a fixed point, we can conclude that F is C(x)-quasiconvex-like. It should be noted that F is not C(x)-quasiconvex-like in the Euclidean setting.
Given a set-valued mapping \(F: \varOmega \times \varOmega \rightrightarrows {{\mathbb {Y}}}\), the generalized vector equilibrium problem (GVEP) in the Riemannian context consists in
Remark 3.1
Let \(M={\mathbb {R}}^n ,\,{\mathbb {Y}}={\mathbb {R}}^m\) and \(\text{ int }\,C(x)=K\) for all \(x\in {\mathbb {R}}^n\), where \(K\subset {\mathbb {R}}^m\) is a closed pointed and convex cone such that \(\text{ int }\,K\!\ne \! \varnothing \). Given a function \(f: {\mathbb {R}}^n \rightarrow {\mathbb {R}}^m\), if \(F: {\mathbb {R}}^n \!\times \! {\mathbb {R}}^n \!\rightarrow \! {\mathbb {R}}^m\) is defined by \(F(x, y)\!=\!f(y)\!-\!f(x)\), then we can transform the GVEP in (4) into the classic vector optimization problem \(\min _{K}f(x)\); see [14].
Remark 3.2
Although variational inequality theory provides us with a toll for formulating multiple equilibrium problems, Iusem and Sosa [16, Proposition 2.6] demonstrated that the generalization given by equilibrium problem (EP) formulation with respect to variational inequality (VI) is genuine, meaning there are EP formulations that do not fit the format of a VI. When compared with VIs, EP formulations may also guarantee genuineness by considering the important class of quasiconvex optimization problems, which appear, for instance, in many microeconomical models that are devoted to maximizing utility. Indeed, the absence of convexity allows us to obtain situations in which this important class of problems cannot be considered to be a VI because its possible representation given this format produces a problem whose solution set contains points that do not necessarily belong to the solution set of the original optimization problem. For example, let \(\varOmega \subseteq M\) be a nonempty, closed and convex set, and \(f: M \rightarrow {\mathbb {R}}\) be a differentiable and \(({\mathbb {R}}_{+}\))-quasiconvex-like function. Then consider the following optimization problem:
Note that, if \(F: \varOmega \times \varOmega \rightarrow {\mathbb {R}} \) is the bifunction given by \(F(x,y)= f(y)-f(x^{*})\), then the optimization problem in (6) is equivalent to the following equilibrium problem:
On the other hand, in the absence of convexity, the optimization problem in (6) is not equivalent to the associated variational inequality,
because, for instance, point \(x^{*}\in \varOmega \), in which \(\nabla f(x^{*})=0\), is a solution to this variational inequality, but it cannot be a solution to the equilibrium problem in (6).
The following result is closed related to [7, Theorem 2.1] and establishes an existence result of solution for GVEP as an application of Lemma 2.1.
Theorem 3.1
Let \(F:\varOmega \times \varOmega \rightrightarrows {\mathbb {Y}}\) be a set-valued mapping such that, for each \(x, y\in \varOmega \), we have:
- h1.:
-
\(F(x,x)\not \subset -int \,C(x)\);
- h2.:
-
\(F(\cdot ,y)\) is upper semicontinuous;
- h3.:
-
F is C(x)-quasiconvex-like;
- h4.:
-
there exist \(D\subset \varOmega \) compact and \( y_0 \in \varOmega \) such that \(x\in \varOmega \backslash D \Rightarrow F(x,y_0)\subset -int \,C(x)\).
Then, the solution set, \(S^{*}\), of the GVEP defined in (4) is a nonempty compact set.
Remark 3.3
In particular, when \(M={\mathbb {R}}^{n}\), our problem (4) retrieves a particular instance of the generalized vector equilibrium problem studied in [7]. In the case where \(C(x)={\mathbb {R}}_{+}\), for each \(x\in \varOmega \) fixed, \({\mathbb {Y}}={\mathbb {R}}\) and F is single-valued map from \(\varOmega \times \varOmega \) to \({\mathbb {R}}\), and then the problem in (4) reduces to the equilibrium problem on Hadamard manifold that was studied in [8]. Let us consider the following vector optimization problem on Hadamard manifolds:
in which \(f:M\rightarrow {\mathbb {R}}^{m}\) is a vector function and \(\text{ min }_{{\mathbb {R}}_{+}^m}\) represents the weak minimum. In the main result of [10], namely Theorem 3.2, the existence of a solution to the problem in (7) was achieved by demonstrating the equivalence of this and the variational inequality on Hadamard manifolds (studied by Németh in [17]):
in the particular case where f is a differentiable and convex vector function, and A is the Riemannian Jacobian of f. When we consider that \(x^{*}\in \varOmega \) is a weak minimum of (7), i.e., \( f(x)-f(x^{*})\notin -{\mathbb {R}}_{++}^{m}, \) for all \(x\in \varOmega \), then Theorem 3.1 increases the applicability of [10, Theorem 3.2] to genuine Hadamard manifolds and quasiconvex nondifferentiable vector functions.
Example 3.2
Let \(({\mathbb {H}}^2, g_{ij})\) be the two-dimensional hyperbolic space, as defined in Example 3.1. The bifunction \(F:{\mathbb {H}}^2\times {\mathbb {H}}^2\rightarrow {\mathbb {R}}\), which is given by \( F\left( (x_1, x_2),\right. \) \(\left. (y_1, y_2)\right) =\ln ^2\left( y_1^2+y_2^2\right) -\ln ^2\left( x_1^2+x_2^2\right) , \) satisfies all the assumptions in Theorem 3.1 if \( \varOmega =\left\{ x=(x_1, x_2)\in {\mathbb {H}}^2~: ~ x_2\ge 1/2\right\} , \) \( C(x)\equiv {\mathbb {R}}_+, \) \(y_0=(0,1)\), and
Indeed, it is clear that \(F((x_1, x_2),(x_1, x_2))=0\) for all \((x_1, x_2)\in \varOmega \), which implies that F satisfies h1. In addition, for fixed \((y_1, y_2)\in \varOmega \), we know that \( \varphi (x_1, x_2)= F((x_1, x_2), (y_1, y_2))\) is continuous, and F consequently satisfies h2. Moreover, for all \( c\in {\mathbb {R}}\), the sub-level set,
is convex in \({\mathbb {H}}^2\), where \( \psi (y_1, y_2)= F((x_1, x_2), (y_1, y_2))\), and \((x_1, x_2)\in \varOmega \) is a fixed point. Hence, F satisfies h3. Finally, because we have \(F((x_1, x_2), (0,1))>0\) for all \(x\in \varOmega \backslash D\), then we know that F satisfies h4. Moreover, according to Theorem 3.1, we can conclude that \(S^*=\{(x_1,x_2)\in {\mathbb {R}}^2: x_1^2+x_2^2=1, ~ x_2\ge 1/2\}\), and the set is compact.
Remark 3.4
One reason for the successful extension, to the Riemannian setting, is the possibility to transform nonconvex or quasiconvex problems in linear context into convex or quasiconvex problems by introducing a suitable metric; see Rapcsák [18]. For instance, in Example 3.2, for a fixed point \((x_1, x_2)\in \varOmega \), the function \(\psi (y_1, y_2)= \ln ^2\left( y_1^2+y_2^2\right) -\ln ^2\left( x_1^2+x_2^2\right) \) is not usual quasiconvex in \(\{(y_1,y_2) \in {\mathbb {R}}^{2}: y_{2}>0\}\), because its sub-level \(L_{\psi ,\varOmega }(0)=\{(y_1,y_2)\in {\mathbb {R}}^2: y_1^2+y_2^2=1, ~y_2>0\}\) is not convex. Therefore, [7, Theorem 2.1] cannot be applied to the GVEP. However, we can apply Theorem 3.1.
Henceforth, we assume that every assumption made in Theorem 3.1 holds. In order to prove this theorem, we must establish some preliminary concepts. First, we define the set-valued mapping, \(P:\varOmega \rightrightarrows \varOmega \), by
Lemma 3.1
If \(S^{*}=\varnothing \), then for each \(x, y\in \varOmega \), the set-valued mapping P satisfies the following conditions:
-
(i)
set P(x) is nonempty and convex;
-
(ii)
\(P^{-1}(y)\) is an open set, and \(\bigcup _{y\in \varOmega }^{}P^{-1}(y)=\varOmega \);
-
(iii)
there exists \(y_0\in \varOmega \) such that \(P^{-1}(y_0)^{c}\) is compact.
Proof
Because solution set \(S^{*}=\varnothing \), the definition in (9) lets us to conclude that \(P(x)\ne \varnothing \), for all \(x\in \varOmega \), which proves the first statement, (i). Assume \(x\in \varOmega \). To prove P(x) is convex, we consider \(y_1,y_2\in P(x)\) and a geodesic \(\gamma : [0, 1] \rightarrow \varOmega \) such that \(\gamma (0)=y_1\) and \(\gamma (1)=y_2\). Applying assumption h3 gives us
As \(y_1,y_2\in P(x)\), the definition of P(x) in (9) implies that \(F(x,y_1)\subset -\text{ int }\,C(x)\) and \(F(x,y_2)\subset -\text{ int }\,C(x)\). Therefore, given \(-\text{ int }\,C(x) - C(x) \subset -\text{ int }\,C(x)\), which is obtained using Proposition 1.3 and Proposition 1.4 of [19], it follows from (10) that \( F(x,\gamma (t))\subset -\text{ int }\,C(x), \) and this concludes the proof of (i).
In order to prove (ii), we must first note that the definition in (2) provides
where the second equality follows from the definition of the set, P(x), in (9). Given \(x_0\in P^{-1}(y)\), the second equality in (11), and the fact that \(-\text{ int }\,C(x)\) is an open set, if we apply h2, then we know there exists an open set, \( V_{x_0}\subset \varOmega \), such that \( F(x,y)\subset -\text{ int }\,C(x), \) for all \( x\in V_{x_0}.\) Hence, \(P^{-1}(y)\) is open, which proves the first statement in (ii). The definition in (11) implies that \(P^{-1}(y)\subseteq \varOmega \) for all \(y\in \varOmega \). In order to complete the proof of (ii), it is sufficient to prove that \(\varOmega \subseteq \bigcup _{y\in \varOmega }^{}P^{-1}(y)\). Therefore, suppose \(x\in \varOmega \). Item (i) ensures that \(P(x)\ne \varnothing \), which implies that there exists \(y\in P(x)\). Thus, \(x\in P^{-1}(y)\) for some \(y\in \varOmega \), which concludes the proof of item (ii).
To prove (iii), we note that h4 and (11) imply that \( P^{-1}(y_0)^{c}\!=\!\{x\!\in \!\varOmega ~:~F(x,y_0)\not \subset -\text{ int }\,C(x)\}\subset D,\) for some \(y_0\in \varOmega \), and \(D\subset \varOmega \) is a compact set. Given item i, we know \(P^{-1}(y_0)\) is an open set. Furthermore, because D is compact, we can conclude from the last inclusion that \(P^{-1}(y_0)^{c}\) is a compact set, and this completes the proof our proposition. \(\square \)
Now we are ready to prove our main result: Theorem 3.1.
Proof
In order to create a contradiction, let us suppose that solution set \(S^{*}=\varnothing \). Also, assume \( G : \varOmega \rightrightarrows \varOmega \) is the set-valued mapping defined by
Further define set \(D:=\bigcap _{y\in \varOmega }^{}G(y)\). Therefore, we have two possibilities for set D: \(D\ne \varnothing \) or \(D= \varnothing \). If \(D\ne \varnothing \), i.e., \(\bigcap _{y\in \varOmega }^{}P^{-1}(y)^{c}\ne \varnothing \), then we have \(\bigcup _{y\in \varOmega }^{}P^{-1}(y)\ne \varOmega ,\) which contradicts (ii) in Lemma 3.1. Hence, we can conclude that \(D= \varnothing \), i. e., \( \bigcap _{y\in \varOmega }^{}G(y)= \varnothing .\)
Thus, given our assumption that \(S^{*}=\varnothing \), combining the definition in (12) and statements (ii) and (iii) in Lemma 3.1, we can conclude that for each \(y\in \varOmega \), set G(y) is closed, and there exists \(y_0\in \varOmega \) such that \(G(y_0)\) is a compact set. Hence, because \(\bigcap _{y\in \varOmega }^{}G(y)= \varnothing \), Lemma 2.1 implies that there exist \( y_1,\ldots ,y_m\in \varOmega \) such that \( \text{ conv }\{y_1,\ldots ,y_m\}\not \subset \bigcup _{i=1}^{m}G(y_i). \) Therefore, there also exists \(x\in \text{ conv }\{y_1,\ldots ,y_m\}\) such that \(x\notin G(y_i)=P^{-1}(y_i)^{c} \) for all \(i=1, \ldots m\). Equivalently, there exists \(x\in \text{ conv }\{y_1,\ldots ,y_m\}\) such that \(x\in P^{-1}(y_i) \) for all \(i=1, \ldots m\). Hence, we can conclude that
Considering \(S^{*}=\varnothing \), items (i) in Lemma 3.1 implies that P(x) is convex. When combined with the relations in (13), this implies that there exists \(x \in \varOmega \) such that \(x\in P(x)\). These inclusions and the definition in (9) imply that there exists \(x \in \varOmega \) such that \(F(x,x)\subset -\text{ int }\,C(x)\). This contradicts assumption h1 in Theorem 3.1. Therefore, solution set \(S^{*}\ne \varnothing \), and this concludes the proof of Theorem 3.1. \(\square \)
4 Conclusions
In this paper, we examined the basic intrinsic properties of the generalized vector equilibrium problem on Hadamard manifolds, and we briefly discussed equilibrium problem theory in this context. Our results should provide the first step to a more general theory, which includes hyperbolic spaces and algorithms for solving problems on Hadamard manifolds.
References
Fu, J.Y.: Generalized vector quasi-equilibrium problems. Math. Methods Oper. Res. 52(1), 57–64 (2000)
Fu, J.Y., Wan, A.H.: Generalized vector equilibrium problems with set-valued mappings. Math. Methods Oper. Res. 56(2), 259–268 (2002)
Konnov, I.V., Yao, J.-C.: Existence of solutions for generalized vector equilibrium problems. J. Math. Anal. Appl. 233, 328–335 (1999)
Ansari, Q.H., Konnov, I.V., Yao, J.C.: On generalized vector equilibrium problems. Proceedings of the 3rd World congress of nonlinear analysts, Part 1 (Catania, 2000). Nonlinear Anal. 47(1), 543–554 (2001)
Farajzadeh, A.P., Amini-Harandi, A.: On the generalized vector equilibrium problems. J. Math. Anal. Appl. 344(2), 999–1004 (2008)
Fan, K.: A generalization of Tychonoff’s fixed point theorem. Math. Ann. 142, 305–310 (1960/1961)
Ansari, Q.H., Yao, J.C.: An existence result for generalized vector equilibrium problems. Appl. Math. Lett. 12(8), 53–56 (1999)
Colao, V., López, G., Marino, G., Martín-Márquez, V.: Equilibrium problems in Hadamard manifolds. J. Math. Anal. Appl. 388, 61–77 (2012)
Zhou, L.W., Huang, N.J.: Generalized KKM theorems on Hadamard manifolds with applications (2009). http://www.paper.edu.cn/index.php/default/releasepaper/content/200906-669
Zhou, Li-Wen(PRC-SUN), Huang, Nan-Jing(PRC-SUN): Existence of solutions for vector optimization on Hadamard manifolds. J. Optim. Theory Appl. 157(1), 44–53 (2013)
Li, X., Huang, N.: Generalized vector quasi-equilibrium problems on Hadamard manifolds. Optim. Lett. (2014). doi:10.1007/s11590-013-0703-9
Bento, G.C., Ferreira, O.P., Oliveira, P.R.: Proximal point method for a special class of nonconvex functions on hadamard manifolds. Optimization 64(2), 289–319 (2015)
Tarafdar, E.: A fixed point theorem equivalent to Fan–Knaster–Kuratowski–Mazurkiewicz’s theorem. J. Math. Anal. Appl. 128, 475–479 (1987)
Drummond, L.M.G., Svaiter, B.F.: A steepest descent method for vector optimization. J. Comput. Appl. Math. 175(2), 395–414 (2005)
Udriste, C.: Convex functions and optimization algorithms on Riemannian manifolds. In: Mathematics and Its Applications, vol. 297. Kluwer Academic, Norwell (1994)
Iusem, A.N., Sosa, W.: New existence results for equilibrium problems. Nonlinear Anal. 52, 621–635 (2003)
Németh, S.Z.: Variational inequalities on Hadamard manifolds. Nonlinear Anal. 52, 1491–1498 (2003)
Rapcsák, T.: Smooth Nonlinear Optimization in \({\mathbb{R}}^n\). Nonconvex Optimization Application, vol. 19. Kluwer Academic Publishers, Dordrecht (1997)
Luc, D.T.: Theory of Vector Optimization. Lecture Notes in Economics and Mathematical Systems, vol. 319. Springer, Berlin (1989)
Acknowledgments
The work was supported by CAPES, CAPES-MES-CUBA 226/2012, FAPEG 201210267000909-05/2012 and CNPq Grants 458479/2014-4, 471815/2012-8, 303732/2011-3.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Sándor Zoltán Németh.
Rights and permissions
About this article
Cite this article
Batista, E.E.A., Bento, G.C. & Ferreira, O.P. An Existence Result for the Generalized Vector Equilibrium Problem on Hadamard Manifolds. J Optim Theory Appl 167, 550–557 (2015). https://doi.org/10.1007/s10957-015-0761-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-015-0761-5