Abstract
In this paper we study the existence of solutions of mixed equilibrium problems on Hadamard manifolds. We also introduce the implicit and explicit algorithms to solve these problems. Under reasonable assumptions, we show that the sequence generated by both implicit and explicit algorithms converges to a solution of mixed equilibrium problems, whenever it exists. Moreover our results generalize some corresponding results, existing in the literature.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
The theory of equilibrium problems has many important applications in many fields of mathematics such as optimization problems, variational inequality problems, fixed point problems, Nash equilibria problems, complementarity problems etc. It has been studied extensively in finite and infinite dimensional linear spaces, see for example [2–4, 7] and the references therein.
Recently many researchers [5, 8, 16, 17] extended the concepts and techniques of the theory of equilibrium problems from Euclidean spaces to nonlinear spaces like Hadamard manifolds. One motivation is to study equilibrium problems in Hadamard manifolds is that some equilibrium problems on Euclidean spaces can not be solved by the classical technique but they can be solved on Hadamard manifolds [5].
Therefore, the extension of the concepts and techniques of the theory of equilibrium problems from Euclidean spaces to Riemannian manifolds is natural. Colao et al. [5] proved the existence of solutions of equilibrium problems on Hadamard manifolds. Nemeth [10] introduced geodesic monotone vector fields, Wang et al. [22] studied monotone and accretive vector fields on Riemannian manifolds. Nemeth [11] generalized some basic existence and uniqueness theorems of the classical theory of variational inequalities from Euclidean spaces to Hadamard manifolds. Zhou and Huang [23] introduced the notion of the (KKM) mapping and proved a generalized (KKM) theorem on the Hadamard manifold. Li and Huang [8], studied the generalized vector quasi-equilibrium problems.
Tang et al. [20] introduced the proximal point algorithm for pseudomonotone variational inequalities on Hadamard manifolds. Implicit methods for solving equilibrium problems on Hadamard manifolds were proposed by Noor et al. [17]. Also Noor et al. [16] introduced explicit iterative methods for solving equilibrium problems on Hadamard manifolds.
Motivated by the research work mentioned above, we prove the existence of solutions of mixed equilibrium problems on Hadamard manifolds. We also introduce the implicit and explicit methods for solving mixed equilibrium problems on Hadamard manifolds and observe that the results of [14–17] are particular cases of our work. Our results may stimulate further research in this area.
2 Preliminaries
In this section, we recall some fundamental definitions, basic properties and notations which will be needed in this paper. These materials can be found in any textbook on Riemannian geometry, for example [19, 21].
Let M be an n-dimensional connected manifold. We denote by \(T_{x}M\) the n-dimensional tangent space of M at x and by \(TM = \cup _{x \in M}T_{x}M,\) the tangent bundle of M. When M is endowed with a Riemannian metric \(<{\,\cdots \,}>\) on the tangent space \(T_{x}M\) with corresponding norm denoted by \(\Vert .\Vert ,\) then M is a Riemannian manifold. The length of a piecewise smooth curve \(\gamma : [a,b] \rightarrow M\) joining x to y such that \(\gamma (a) = x\) and \(\gamma (b) = y,\) is defined by
Then for any \(x, y \in M\) the Riemannian distance d(x, y) which induces the original topology on M is defined by minimizing this length over the set of all curves joining x to y.
On every Riemannian manifold there exists exactly one covariant derivation called Levi–Civita connection denoted by \(\nabla _{X}Y\) for any vector fields X, Y on M. Let \(\gamma \) be a smooth curve in M. A vector field X is said to be parallel along \(\gamma \) if \(\nabla _{\gamma '}X = 0.\) If \(\gamma '\) itself is parallel along \(\gamma \), we say that \(\gamma \) is a geodesic. A geodesic joining x to y in M is said to be a minimal geodesic if its length equals d(x, y).
A Riemannian manifold is complete if for any \(x \in M\) all geodesics emanating from x are defined for all \(t \in \mathbb {R}.\) By the Hopf–Rinow theorem, we know that if M is complete then any pair of points in M can be joined by a minimal geodesic. Moreover, (M, d) is a complete metric space and bounded closed subsets are compact.
Assuming that M is complete the exponential mapping \(\exp _{x} : T_{x}M \rightarrow M\) is defined by \(\exp _{x}v = \gamma _{v}(1),\) where \(\gamma _{v}\) is the geodesic defined by its position x and velocity v at x.
Recall that a Hadamard manifold is a simply connected complete Riemannian manifold with nonpositive sectional curvature.
Let us recall that a geodesic triangle \(\varDelta (x_{1}x_{2}x_{3})\) of a Hadamard manifold is the set consisting of three distinct points \(x_{1},\) \(x_{2}\), \(x_{3}\) called the vertices and three minimizing geodesic segments \(\gamma _{i+1}\) joining \(x_{i+1}\) to \(x_{i+2}\) called the sides, where \(i = 1, 2, 3(mod~3)\).
Theorem 1
[19] Let M be a Hadamard manifold, \(\varDelta (x_{1}x_{2}x_{3})\) a geodesic triangle and \(\gamma _{i+1} : [0,l_{i+1}] \rightarrow M\) geodesic segments joining \(x_{i+1}\) to \(x_{i+2}\) and set \(l_{i+1} = l(\gamma _{i+1}),\) \(\theta _{i+1} = \measuredangle (\gamma '_{i+1}(0), -\gamma '_{i}(l_{i})),\) for \(i = 1, 2, 3(mod~3).\) Then
Lemma 1
([9]) Let \(x_{0} \in M\) and \(\{x_{n}\} \in M\) such that \(x_{n} \rightarrow x_{0}.\) Then the following assertions hold.
-
(i)
For any \(y \in M\)
$$\begin{aligned} \exp _{x_{n}}^{-1} y \rightarrow \exp _{x_{0}}^{-1} y \quad and \quad \exp _{y}^{-1} x_{n} \rightarrow \exp _{y}^{-1} x_{0}. \end{aligned}$$ -
(ii)
If \(\{v_{n}\}\) is a sequence such that \(v_{n} \in T_{x_{n}}M\) and \(v_{n} \rightarrow v_{0},\) then \(v_{0} \in T_{x_{0}}M.\)
-
(iii)
Given the sequence \(\{u_{n}\}\) and \(\{v_{n}\}\) with \(u_{n}, v_{n} \in T_{x_{n}}M,\) if \(u_{n} \rightarrow u_{0}\) and \(v_{n} \rightarrow v_{0}\) with \(u_{0}, v_{0} \in T_{x_{0}}M,\) then \(\big <u_{n}, v_{n} \big > \rightarrow \big <u_{0}, v_{0} \big >.\)
Definition 1
([18]) A subset K of M is said to be geodesic convex if and only if for any two points \(x, y \in K,\) the geodesic joining x to y is contained in K. That is if \(\gamma : [0,1] \rightarrow M\) is a geodesic with \(x = \gamma (0)\) and \(y = \gamma (1),\) then \(\gamma (t) \in K, ~for~ 0\le t \le 1.\)
Definition 2
([18]) A real-valued function \(f : M \rightarrow \mathbb {R}\) defined on a geodesic convex set K is said to be geodesic convex if and only if for \(0 \le t \le 1,\)
Definition 3
([24]) Let \(K \subset M\) be a nonempty closed geodesic convex set and \(G : K \rightarrow 2^{K}\) be a set-valued mapping. We say that G is a (KKM) mapping if for any \(\{x_{1}, \ldots , x_{m}\} \subset K,\) we have
Lemma 2
([5]) Let K be a nonempty closed geodesic convex set and \(G : K \rightarrow 2^{K}\) be a set-valued mapping such that for each \(x \in K,\) G(x) is closed. Suppose that
-
(i)
there exists \(x_{0} \in K\) such that \(G(x_{0})\) is compact.
-
(ii)
\(\forall x_{1},\ldots , x_{m} \in K,\) \(co(\{ x_{1},\ldots , x_{m}\}) \subset \bigcup _{i=1}^{m}G(x_{i}).\)
Then \(\bigcap _{x\in K}G(x) \ne \emptyset .\)
Throughout the rest part of the paper we take M to be a finite dimensional Hadamard manifold and K denote a nonempty closed geodesic convex subset of M, unless explicitly stated otherwise.
3 Main results
Let \(F : K \times K \rightarrow \mathbb {R}\) be a bifunction satisfying the property \(F(x,x) = 0\) for all \(x \in K\). Then the equilibrium problem introduced by Colao et al. [5] is to find a point \(\bar{x} \in K,\) such that
We introduce the mixed equilibrium problems on the Hadamard manifold M. Let \(\psi : K \rightarrow \mathbb {R}\) be a mapping and \(F : K \times K \rightarrow \mathbb {R}\) be a bifunction satisfying the property \(F(x,x) = 0\) for all \(x \in K\). Then the problem is to find \(\bar{x} \in K\) such that
is called a mixed equilibrium problem on K. We denote by SOL(MEP), the solution set of the mixed equilibrium problem (3).
Some particular cases of mixed equilibrium problems are as follows.
-
(i)
Equilibrium problem: If \(\psi \equiv 0,\) then the mixed equilibrium problem (3) reduces to the equilibrium problem (2).
-
(ii)
Variational inequality problem: Let \(V : K \rightarrow TM \) be a vector field, that is, \(V_{x} \in T_{x}M\) for each \(x \in K\) and \(\exp ^{-1}\) denote the inverse of the exponential map. Then the problem introduced by Nemeth ([11]), is to find \(x \in K\) such that
$$\begin{aligned} \big <V_{x}, \exp _{x}^{-1} y\big > \ge 0, \quad \forall y \in K , \end{aligned}$$(4)is called a variational inequality problem on K. If we define
$$\begin{aligned} F(x,y) = \big <V_{x},\exp ^{-1}_{x}y \big >, \end{aligned}$$and \(\psi \equiv 0,\) then the mixed equilibrium problem (3) and the variational inequality problem (4) are equivalent.
-
(iii)
Mixed variational inequality problem: let \(\psi : K \rightarrow \mathbb {R}\) be a mapping. Then the mixed variational inequality problem ([5]) is to find \(x \in K\) such that
$$\begin{aligned} \big <V_{x}, \exp _{x}^{-1} y\big > + \psi (y) - \psi (x) \ge 0, \quad \forall y \in K. \end{aligned}$$(5)If we take
$$\begin{aligned} F(x,y) = \big <V_{x},\exp ^{-1}_{x}y \big >, \end{aligned}$$then the mixed equilibrium problem (3) and the mixed variational inequality problem (5) are equivalent.
-
(iv)
Optimization problem: Let \(f : K \rightarrow \mathbb {R}\) be a function and consider the minimization problem
$$\begin{aligned} (P)~~find~x\in K~such~that~f(x) = \min _{y \in K} f(y). \end{aligned}$$If we set \(F(x,y) = f(y) - f(x),\) for all \(x, y \in K.\) Then the problems (P) and (2) are equivalent.
3.1 Existence of solutions of mixed equilibrium problems
Colao et al. [5] studied existence of solutions of equilibrium problems under monotonicity assumptions on Hadamard manifolds.
Definition 4
([5]) We call a bifunction F to be monotone on K if for any \(x, y \in K\), we have
In this section we study the existence of solutions of mixed equilibrium problems under pseudomonotonicity assumptions.
Definition 5
A bifunction F is said to be pseudomonotone with respect to the function \(\psi \) if
We show by an example that pseudomonotonicity is a generalization of monotonicity.
Example 1
Let \(H^{1} = \{x = (x_{1},x_{2}) \in \mathbb {R}^{2}: x_{1}^{2} - x_{2}^{2} = -1,~ x_{2} > 0\}\) be the hyperbolic 1-space which forms a Hadamard manifold ([1]) endowed with the metric defined by
Let K be a subset of \(H^{1}\) defined by \(K = \{x = (x_{1},x_{2}) \in H^{1}: -1 \le x_{1} \le 1\}\).
Now we define the bifunction \(F : K \times K \rightarrow \mathbb {R}\) by
To show that F is pseudomonotone on K but not monotone.
We take \(\psi \equiv 0\).
\(F(x, y) \ge 0\) on K when \(x_{1} \ge y_{1}\) (as \(x_{2} > 0\)),
then \(F(y,x) = y_{2}(y_{1} - x_{1}) \le 0\) (as \(y_{2} > 0)\).
Therefore, F is pseudomonotone.
Particularly if we take \(x = (1, \sqrt{2}) \in K\) and \(y = (0, 1) \in K\),
then \(F(x,y) + F(y ,x) = \sqrt{2} - 1 > 0.\)
That is, F is not monotone.
Definition 6
A function \(F: K \rightarrow \mathbb {R}\) is said to be hemicontinuous if for every geodesic \(\gamma : [0,1] \rightarrow K,\) whenever \(t \rightarrow 0\), \(F(\gamma (t)) \rightarrow F(\gamma (0)).\)
Next we give the following lemma which will be needed in the sequel. Throughout the rest of the paper we denote F as a bifunction with \(F(x,x) = 0,\) unless otherwise stated.
Lemma 3
Let \(F : K \times K \rightarrow \mathbb {R}\) be hemicontinuous in the first argument and for fixed \(x \in K\) the mapping \(z \mapsto F(x,z)\) be geodesic convex. Also assume that the map \(\psi : K \rightarrow \mathbb {R}\) is geodesic convex and the bifunction F is pseudomonotone with respect to \(\psi \). Then \(\bar{x} \in K\) is a solution of the mixed equilibrium problem (3), if and only if
Proof
Let \(\bar{x} \in K\) is a solution of the equilibrium problem (3), then
Since F is pseudomonotone with respect to the function \(\psi ,\) we have
Conversely, let \(\bar{x} \in K\) be a solution of (9). Let \(\gamma (t)\) be a geodesic joining \(\bar{x}\) and y such that \(\gamma (0) = \bar{x}\).
As K is geodesic convex, we have
As \(\psi \) is geodesic convex then
Also as \(z \mapsto F(x,z)\) is geodesic convex,
[by (11)].
That is, \(F(\gamma (t), y) - F(\gamma (t), \bar{x}) + \psi (y) - \psi (\bar{x}) \ge 0, ~ as~ t \ge 0\).
Since F is hemicontinuous in the first argument taking \(t \rightarrow 0,\) we have \(F(\bar{x}, y) - F(\bar{x}, \bar{x}) + \psi (y) - \psi (\bar{x}) \ge 0 \Rightarrow F(\bar{x}, y) + \psi (y) - \psi (\bar{x}) \ge 0, ~for~all~ y \in K\). This completes the proof. \(\square \)
Next we prove the main existence theorem. First we consider the case when the set K is bounded.
Theorem 2
Let K be a bounded subset of M and \(F : K \times K \rightarrow \mathbb {R}\) be hemicontinuous in the first argument. Suppose for fixed \(x \in K\), the mappings \(z \mapsto F(x,z)\) and \(\psi : K \rightarrow \mathbb {R}\) are geodesic convex, lower semicontinuous. Also assume that the bifunction F is pseudomonotone with respect to \(\psi \). Then the mixed equilibrium problem (3) has a solution.
Proof
Consider the two set-valued mappings \(G_{1} : K \rightarrow 2^{K}\) and \(G_{2} : K \rightarrow 2^{K}\) such that
It is easy to see that \(\bar{x} \in K\) solves the mixed equilibrium problem (3) if and only if \(\bar{x} \in \cap _{y \in K}G_{1}(y).\) Thus it suffices to prove that \(\cap _{y \in K}G_{1}(y) \ne \emptyset .\) First we show \(G_{1}\) is a (KKM) mapping. So we have to prove that for any choice of \(x_{1}, \ldots , x_{m} \in K\)
Suppose on the contrary that there exists a point \(x_{0} ~in~ K,\) such that \(x_{0} \in co(\{x_{1}, \ldots , x_{m}\})\) but \(x_{0} \notin \bigcup _{i=1}^{m}G_{1}(x_{i}).\) That is
This implies that for any \(i \in \{1, \ldots , m\},\) \(x_{i} \in \{y \in K : F(x_{0},y) + \psi (y) - \psi (x_{0}) < 0\}.\) Now the function \(y \mapsto F(x_{0}, y)\) is geodesic convex, also \(\psi \) is geodesic convex. Being the sum of two geodesic convex function, \(y \mapsto F(x_{0}, y) + \psi (y)\) is geodesic convex. Hence the set \(\{y \in K : F(x_{0},y) + \psi (y) - \psi (x_{0}) < 0\}\) is a geodesic convex set. Then
Therefore \(F(x_{0},x_{0}) + \psi (x_{0}) - \psi (x_{0}) < 0.\) But we have \(F(x_{0},x_{0}) = 0,\) a contradiction. Hence \(G_{1}\) is a (KKM) mapping.
From Lemma 3, we have \( G_{1}(y)\subset G_{2}(y), ~ \forall y \in K.\) That is,
Hence \(G_{2}\) is also a (KKM) mapping.
Since F(y, .) and \(\psi \) are lower semicontinuous, \(G_{2}(y)\) is closed for all \(y \in K\).
Now \(G_{2}(y)\) is a closed subset of a compact set K. So \(G_{2}(y)\) is compact for all \(y \in K\).
Hence by Lemma 2, there exists a point \(\bar{x} \in K\) such that \(\bar{x} \in \bigcap _{y \in K} G_{2}(y)\).
By Lemma 3, we have \(\bigcap _{y \in K} G_{1}(y) = \bigcap _{y \in K} G_{2}(y).\) That is \(\bar{x} \in \bigcap _{y \in K} G_{1}(y)\).
So there exists a point \(\bar{x} \in K,\) such that
Therefore, \(\bar{x} \in K\) solves the equilibrium problem (3). \(\square \)
Suppose K is an unbounded subset of M. Given a point \(\mathbf 0 \in M,\) let \(\varSigma _{R} = \{x \in M : d(\mathbf 0 ,x) \le R \}\) be the closed geodesic ball of radius R and center \(\mathbf 0 \).
Theorem 3
Let K be an unbounded subset of M and \(F : K \times K \rightarrow \mathbb {R}\) be hemicontinuous in the first argument. Suppose for fixed \(x \in K\), the mappings \(z \mapsto F(x,z)\) and \(\psi : K \rightarrow \mathbb {R}\) are geodesic convex, lower semicontinuous. Also assume that the bifunction F is pseudomonotone with respect to \(\psi \). If there exists a point \(x_{0} \in K,\) such that
holds, then the mixed equilibrium problem (3) has a solution.
Proof
Let \(K_{R} = K \cap \varSigma _{R}.\) If \(K_{R} \ne \emptyset ,\) then there exists at least one \(x_{R} \in K_{R}\) such that
by Theorem 2.
We now take a point \(x_{0} \in K\) satisfying (14) with \(d(\mathbf 0 ,x_{0}) < R,\) so \(x_{0} \in K_{R}\).
Hence by (15), we have
If \(d(\mathbf 0 ,x_{R}) = R\) for all R, we may choose R large enough so that \(d(\mathbf 0 ,x_{R}) \rightarrow +\infty \).
Hence by (14), \(F(x_{R},x_{0}) + \psi (x_{0}) - \psi (x_{R}) < 0\) contradicts (16). So there exists an R such that \(d(\mathbf 0 ,x_{R}) < R\).
Given \(y \in K,\) let \(\gamma (t)\) be a geodesic joining \(x_{R}\) to y with \(\gamma (0) = x_{R}.\) Now since \(d(\mathbf 0 ,x_{R}) < R,\) we can choose \(0 < t <1,\) sufficiently small so that \(\gamma (t)\in K_{R}\).
Hence
That is \(x_{R}\) is a solution of the mixed equilibrium problem (3). \(\square \)
3.2 Implicit method for solving mixed equilibrium problem
In this section we introduce the implicit iterative method for solving mixed equilibrium problems on Hadamard manifolds. We now consider the following implicit iterative (proximal point) algorithm [17].
Algorithm 1
At stage n, given \(x_{n} \in K,\) \(\rho > 0,\) compute \(x_{n+1} \in K,\) as a solution of the following iterative scheme.
Next we deduce some special cases of Algorithm 1.
-
(i)
When \(\psi \equiv 0,\) the Algorithm 1 reduces to the following implicit iterative algorithm.
Algorithm 2
At stage n, given \(x_{n} \in K,\) \(\rho > 0,\) compute \(x_{n+1} \in K,\) such that
Algorithm 2 is the implicit algorithm solving for the equilibrium problems introduced by Noor et al. [17].
-
(ii)
If K is a convex set in \(\mathbb {R}^{n},\) then Algorithm 1 reduces into the following algorithm ([12, 13]).
Algorithm 3
At stage n, given \(x_{n} \in K,\) \(\rho > 0,\) compute \(x_{n+1} \in K,\) as a solution of the iterative scheme
-
(iii)
If we take \(F(x,y) = \big <V_{x},\exp ^{-1}_{x}y \big >,\) then Algorithm 1 reduces to the following.
Algorithm 4
At stage n, given \(x_{n} \in K,\) \(\rho > 0,\) compute \(x_{n+1} \in K,\) as a solution of the iterative scheme
which is an algorithm for solving mixed variational inequalities and is studied by Noor et al. [15].
-
(iv)
When \(\psi \equiv 0,\) the Algorithm 4 reduces to the following implicit iterative algorithm ([20]) for solving variational inequalities.
Algorithm 5
At stage n, given \(x_{n} \in K,\) \(\rho > 0,\) compute \(x_{n+1} \in K,\) as a solution of the iterative scheme
We now consider the convergence analysis of Algorithm 1. For which we recall the notion of Fejer convergence and the following related results which can be found in [6] and [9].
Definition 7
Let X be a complete metric space and \(A \subseteq X\) be a nonempty set. A sequence \(\{x_{n}\} \subset X\) is said to be Fejer convergent to A if
Lemma 4
Let X be a complete metric space and let A be a nonempty subset of X. Suppose \(\{x_{n}\} \subset X\) be Fejer convergent to K and any limit point of \(\{x_{n}\}\) belongs to A. Then \(\{x_{n}\}\) converges to a point of A.
Theorem 4
Let \(F: K \times K \rightarrow \mathbb {R}\) be pseudomonotone with respect to the function \(\psi \) and continuous in the first argument and SOL(MEP) \(\ne \emptyset .\) Suppose that the sequence \(\{x_{n}\}\) generated by (17) is well defined and \(\psi : K \rightarrow \mathbb {R}\) is continuous. Then \(\{x_{n}\}\) converges to a solution of the mixed equilibrium problem (3).
Proof
We first prove that \(\{x_{n}\}\) is Fejer convergent to SOL(MEP). Let \(x \in K\) be a solution of (3). Then
Taking \(y = x_{n+1}\) in (19), we get
Since F is pseudomonotone with respect to \(\psi ,\) then
From (17), taking \(y=x\) we have
So we finally get as \(\rho > 0,\)
Considering the geodesic triangle \(\varDelta (x_{n}x_{n+1}x),\) by using (1) we get
or
This clearly implies that \(d^{2}(x_{n+1},x) \le d^{2}(x_{n},x),\) so \(\{x_{n}\}\) is Fejer convergent to SOL(MEP). From (24) it follows that
Since the sequence \(\{d(x_{n},x)\}\) is monotone decreasing and bounded below by 0, it is also convergent. Hence by (25) \(\lim _{n\rightarrow \infty }d^{2}(x_{n+1},x_{n}) = 0.\) That is
Next we prove that any limit point of \(\{x_{n}\}\) belongs to SOL(MEP). Let x be a limit point of \(\{x_{n}\}\). Then there exists a subsequence \(\{n_{k}\}\) of \(\{n\}\) such that \(x_{n_{k}} \rightarrow x.\) Hence \(d(x_{n_{k}+1},x_{n_{k}}) \rightarrow 0,\) by the assertion just proved, and so \(x_{n_{k}+1} \rightarrow x.\) It follows from (17) with \(n = n_{k},\)
Passing to the limit as \(k \rightarrow \infty \) in (27) we get
That is \(x \in SOL(MEP)\). Hence by Lemma 4, \(\{x_{n}\}\) converges to point of SOL(MEP). This completes the proof. \(\square \)
3.3 Explicit method for solving mixed equilibrium problem
In this section we prove the convergence of explicit iterative methods ([14]) for solving mixed equilibrium problems on Hadamard manifolds.
Definition 8
The bifunction F is said to be partially relaxed pseudomonotone with respect to the function \(\psi \) if there exists \(\alpha > 0\) such that \(\forall x,y,z \in K\)
If we take \(z = y,\) then F reduces to a pseudomonotone function.
We now consider the following explicit iterative scheme for solving mixed equilibrium problems.
Algorithm 6
At stage n, given \(x_{n} \in K,\) \(\rho > 0,\) compute \(x_{n+1} \in K,\) as a solution of the iterative scheme
Some particular cases of Algorithm 6 are given as:
-
(i)
When \(\psi \equiv 0,\) the Algorithm 6 reduces to the following explicit iterative algorithm [16] for equilibrium problems.
Algorithm 7
At stage n, given \(x_{n} \in K,\) \(\rho > 0,\) compute \(x_{n+1} \in K,\) such that
-
(ii)
If K is a convex set in \(\mathbb {R}^{n},\) then Algorithm 6 reduces to the following ([12, 13]).
Algorithm 8
At stage n, given \(x_{n} \in K,\) \(\rho > 0,\) compute \(x_{n+1} \in K,\) as a solution of the iterative scheme
-
(iii)
If we take \(F(x,y) = \big <V_{x},\exp ^{-1}_{x}y \big >,\) then Algorithm 6 turns into the following algorithm for solving mixed variational inequalities .
Algorithm 9
At stage n, given \(x_{n} \in K,\) \(\rho > 0,\) compute \(x_{n+1} \in K,\) as a solution of the iterative scheme
-
(iv)
When \(\psi \equiv 0,\) the Algorithm 9 reduces to the following explicit iterative algorithm [14].
Algorithm 10
At stage n, given \(x_{n} \in K,\) \(\rho > 0,\) compute \(x_{n+1} \in K,\) as a solution of the iterative scheme
We now study the convergence analysis of Algorithm 6.
Theorem 5
Let \(F: K \times K \rightarrow \mathbb {R}\) be a partially relaxed pseudomonotone bifunction with respect to the function \(\psi \) with a constant \(\alpha > 0,\) and continuous in the first argument. Suppose that the sequence \(\{x_{n}\}\) generated by (30) is well defined, \(\psi : K \rightarrow \mathbb {R}\) is continuous and SOL(MEP)\(\ne \emptyset \). Then
If in addition \(\rho < \frac{1}{2\alpha },\) then \(\{x_{n}\}\) converges to a solution of the mixed equilibrium problem (3).
Proof
We first prove that \(\{x_{n}\}\) is Fejer convergent to SOL(MEP). Let \(x \in K\) be a solution of (3). Then
Taking \(y = x_{n+1}\) in (31), we get
Since F is partially relaxed pseudomonotone with a constant \(\alpha > 0,\) then
From (30), taking \(y=x\) we have
So we finally get
Considering the geodesic triangle \(\varDelta (x_{n}x_{n+1}x)\) we get
It follows from (35)
As \(\rho < \frac{1}{2\alpha },\) from (36) this clearly follows
So \(\{x_{n}\}\) is Fejer convergent to SOL(MEP). From (36) we get
Since the sequence \(\{d(x_{n},x)\}\) is monotone decreasing and bounded below by 0, it is also convergent. Hence by (36) it follows that \(\lim _{n\rightarrow \infty }d^{2}(x_{n+1},x_{n}) = 0.\) That is
Next we prove that any limit point of \(\{x_{n}\}\) belongs to SOL(MEP). Let x be a limit point of \(\{x_{n}\}\). Then there exists a subsequence \(\{n_{k}\}\) of \(\{n\}\) such that \(x_{n_{k}} \rightarrow x.\) Hence \(d(x_{n_{k}+1},x_{n_{k}}) \rightarrow 0,\) by the assertion just proved, and so \(x_{n_{k}+1} \rightarrow x.\) It follows from (25) with \(n = n_{k},\)
Passing to the limit as \(k \rightarrow \infty \) in (39), we get
That is \(x \in SOL(MEP).\) Hence by Lemma 4, \(\{x_{n}\}\) converges to point of SOL(MEP). This completes the proof. \(\square \)
4 Conclusions
This paper is devoted to the study of existence of solutions of mixed equilibrium problems on Hadamard manifolds. We also prove the convergence of the implicit and explicit iterative methods for solving mixed equilibrium problems under generalized monotonicity assumptions. The results presented in this paper are completely new and some existing results followed as a special case of our results.
References
Bridson, M., Haefliger, A.: Metric Spaces of Non-positive Curvature. Springer, Berlin (1999)
Bianchi, M., Schaible, S.: Generalized monotone bifunctions and equilibrium problems. J. Optim. Theory Appl. 90, 31–43 (1996)
Bianchi, M., Schaible, S.: Equilibrium problem under generalized convexity and generalized monotonicity. J. Glob. Optim. 30, 121–134 (2004)
Blum, E., Oettli, W.: From optimization and variational inequilities to equilibrium problems. Math. Stud. IMS 63, 123–145 (1994)
Colao, V., Lopez, G., Marino, G., Martin-Marquez, V.: Equilibrium problems in Hadamard manifolds. J. Math. Anal. Appl. 388, 61–77 (2012)
Ferreira, O.P., Oliveira, P.R.: Proximal point algorithm on Riemannian manifolds. Optimization 51, 257–270 (2002)
Hadjisavvas, N., Schaible, S.: Quasimonotone variational inequalities in Banach spaces. J. Optim. Theory Appl. 90, 95–111 (1996)
Li, X.B., Huang, N.J.: Generalized vector quasi-equilibrium problems on Hadamard manifolds. Optim. Lett. (2013). doi:10.1007/s11590-013-0703-9
Li, C., Lopez, G., Martin-Marquez, V.: Monotone vector fields and the proximal point algorithm on Hadamard manifolds. J. Lond. Math. Soc. 79(2), 663–683 (2009)
Nemeth, S.Z.: Geodesic monotone vector fields, Lobachevskii. J. Math. 5, 13–28 (1999)
Nemeth, S.Z.: Variational inequalities on Hadamard manifolds. Nonlinear Anal. 52(5), 1491–1498 (2003)
Noor, M.A.: Extended general variational inequalities. Appl. Math. Lett. 22, 182–185 (2009)
Noor, M.A.: On an implicit method for nonconvex variational inequalities. J. Optim. Theory Appl. 147, 411–417 (2010)
Noor, M.A., Noor, K.I.: Explicit iterative method for variational inequalities on Hadamard manifolds. J. Appl. Math. (2012). doi:10.1155/2012/691806
Noor, M.A., Noor, K.I.: Proximal Point Methods for solving mixed variational inequalities on the Hadamard manifolds. J. Appl. Math. (2012). doi:10.1155/2012/657278
Noor, M.A., Noor, K.I.: Some algorithms for equilibrium problems on Hadamard manifolds. J. Inequal. Appl. 2012, 230 (2012)
Noor, M.A., Zainab, S., Yao, Y.: Implicit Methods for equilibrium problems on Hadamard manifolds. J. Appl. Math. (2012). doi:10.1155/2012/437391
Rapcsak, T.: Geodesic convexity in nonlinear optimization. J. Optim. Theory Appl. 69, 169–183 (1991)
Sakai, T.: Riemannian Geometry, Translations of Mathematical Monographs, vol. 149. American Mathematical Society, Providence (1996)
Tang, G.J., Zhou, L.W., Huang, N.J.: The proximal point algorithm for pseudomonotone variational inequalities on Hadamard manifolds. Optim. Lett. doi:10.1007/s11590-012-0459-7
Udriste, C.: Convex Functions and Optimization Methods on Riemannian Manifolds, Math. Appl., Vol. 297. Kluwer Academic Publisher, Dordrecht, Boston, London (1994)
Wang, J.H., Lopez, G., Martin-Marquez, V., Li, C.: Monotone and accretive vector fields on Riemannian manifolds. J. Optim. Theory Appl. 146(3), 691–708 (2010)
Zhou, L.W., Huang, N.J.: Generalized KKM theorems on Hadamard manifolds with applications. http://www.paper.edu.cn/index.php/default/releasepaper/content/200906-669 (2009). Accessed 27 Mar 2015
Zhou, L.W., Huang, N.J.: Existence of solutions for vector optimization on Hadamard manifolds. J. Optim. Theory Appl. 157, 44–53 (2013)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Jana, S., Nahak, C. Mixed equilibrium problems on Hadamard manifolds. Rend. Circ. Mat. Palermo 65, 97–109 (2016). https://doi.org/10.1007/s12215-015-0221-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12215-015-0221-y