Implicit Methods for Equilibrium Problems on Hadamard Manifolds
Abstract
We use the auxiliary principle technique to suggest and analyze an implicit method for solving the equilibrium problems on Hadamard manifolds. The convergence of this new implicit method requires only the speudomonotonicity, which is a weaker condition than monotonicity. Some special cases are also considered.
1. Introduction
Recently, much attention has been given to study the variational inequalities, equilibrium and related optimization problems on the Riemannian manifold and Hadamard manifold. This framework is a useful for the developments of various fields. Several ideas and techniques form the Euclidean space have been extended and generalized to this nonlinear framework. Hadamard manifolds are examples of hyperbolic spaces and geodesics, see [1–8] and the references therein. Németh [9], Tang et al. [7], M. A. Noor and K. I. Noor [5], and Colao et al. [2] have considered the variational inequalities and equilibrium problems on Hadamard manifolds. They have studied the existence of a solution of the equilibrium problems under some suitable conditions. To the best of our knowledge, no one has considered the auxiliary principle technique for solving the equilibrium problems on Hadamard manifolds. In this paper, we use the auxiliary principle technique to suggest and analyze an implicit method for solving the equilibrium problems on Hadamard manifold. As a special case, our result includes the recent result of Noor and Oettli [10] for variational inequalities on Hadamard manifold. This shows that the results obtained in this paper continue to hold for variational inequalities on Hadamard manifold, which are due to M. A. Noor and K. I. Noor [5], Tang et al. [7], and Németh [9]. We hope that the technique and idea of this paper may stimulate further research in this area.
2. Preliminaries
We now recall some fundamental and basic concepts needed for reading of this paper. These results and concepts can be found in the books on Riemannian geometry [1–3, 6].
Let M be a simply connected m-dimensional manifold. Given x ∈ M, the tangent space of M at x is denoted by TxM and the tangent bundle of M by TM = ∪x∈MTxM, which is naturally a manifold. A vector field A on M is a mapping of M into TM which associates to each point x ∈ M, a vector A(x) ∈ TxM. We always assume that M can be endowed with a Riemannian metric to become a Riemannian manifold. We denote by 〈, ·, 〉 the scalar product on TxM with the associated norm ∥·∥x, where the subscript x will be omitted. Given a piecewise smooth curve γ : [a, b] → M joining x to y (i.e., γ(a) = x and γ(b) = y,) by using the metric, we can define the length of γ as . Then, for any x, y ∈ M, the Riemannian distance d(x, y), which includes the original topology on M, is defined by minimizing this length over the set of all such curves joining x to y.
Let Δ be the Levi-Civita connection with (M, 〈·, ·〉). Let γ be a smooth curve in M. A vector field A is said to be parallel along γ if . If γ′ itself is parallel along γ, we say that γ is a geodesic and in this case ∥γ′∥ is constant. When ∥γ′∥ = 1, γ is said to be normalized. A geodesic joining x to y in M is said to be minimal if its length equals d(x, y).
A Riemannian manifold is complete, if for any x ∈ M all geodesics emanating from x are defined for all t ∈ 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.
Let M be complete. Then the exponential map exp x : TxM → M at x is defined by exp xv = γv(1, x) for each v ∈ TxM, where γ(.) = γv(., x) is the geodesic starting at x with velocity v (i.e., γ(0) = x and γ′(0) = v). Then exp xtv = γv(t, x) for each real number t.
A complete simply-connected Riemannian manifold of nonpositive sectional curvature is called a Hadamard manifold. Throughout the remainder of this paper, we always assume that M is an m-manifold Hadamard manifold.
We also recall the following well-known results, which are essential for our work.
Lemma 2.1 (See [6]). Let x ∈ M. Then exp x : TxM → M is a diffeomorphism, and, for any two points x, y ∈ M, there exists a unique normalized geodesic joining x to y, γx,y, which is minimal.
So from now on, when referring to the geodesic joining two points, we mean the unique minimal normalized one. Lemma 2.1 says that M is diffeomorphic to the Euclidean space Rm. Thus M has the same topology and differential structure as Rm. It is also known that Hadamard manifolds and euclidean spaces have similar geometrical properties. Recall that a geodesic triangle ▵(x1, x2, x3) of a Riemannian manifold is a set consisting of three points x1, x2, x3 and three minimal geodesics joining these points.
Lemma 2.2 (See [2, 3, 6] (comparison theorem for triangles)). Let ▵(x1, x2, x3) be a geodesic triangle. Denote, for each i = 1,2, 3(mod 3), by γi : [0, li] → M, the geodesic joining xi to xi+1, and , the angle between the vectors and , and li; = L(γi). Then,
Lemma 2.3 (See [6]). Let ▵(x, y, z) be a geodesic triangle in a Hadamard manifold M. Then, there exist x′, y′, z′ ∈ R2 such that
Lemma 2.4 (See [6]). Let x0 ∈ M and {xn} ⊂ M such that xn → x0. Then the following assertions hold.
- (i)
For any y ∈ M,
(2.7) - (ii)
If {vn} is a sequence such that and vn → v0, then .
- (iii)
Given the sequences {un} and {vn} satisfying , if un → u0 and vn → v0, with , then
(2.8)
A subset K⊆M is said to be convex if for any two points x, y ∈ K, the geodesic joining x and y is contained in K, K that is, if γ : [a, b] → M is a geodesic such that x = γ(a) and y = γ(b), then γ((1 − t)a + tb) ∈ K, for all t ∈ [0,1]. From now on K⊆M will denote a nonempty, closed, and convex set, unless explicitly stated otherwise.
The existence of subgradients for convex functions is guaranteed by the following proposition, see [8].
Lemma 2.5 (See [6, 8]). Let M be a Hadamard manifold and let f : M → R be convex. Then, for any x ∈ M, the subdifferential ∂f(x) of f at x is nonempty. That is, D(∂f) = M.
Definition 2.6. A bifunction F(·, ·) is said to be speudomonotone, if and only if
3. Main Results
We now use the auxiliary principle technique of Glowinski et al. [23] to suggest and analyze an implicit iterative method for solving the equilibrium problems (2.12).
Algorithm 3.1. For a given u0, compute the approximate solution by the iterative scheme
Algorithm 3.2. For a given u0 ∈ K, find the approximate solution un+1 by the iterative scheme:
If K is a convex set in Rn, then Algorithm 3.1 collapses to the following.
Algorithm 3.3. For a given u0 ∈ K, find the approximate solution un+1 by the iterative scheme:
If , where T is a single valued vector filed T : K → TM, then Algorithm 3.1 reduces to the following implicit method for solving the variational inequalities.
Algorithm 3.4. For a given u0 ∈ K, compute the approximate solution un+1 by the iterative scheme
Algorithm 3.5. For a given u0 ∈ K, compute the approximate solution un+1 by the iterative scheme
In a similar way, one can obtain several iterative methods for solving the variational inequalities on the Hadamard manifold.
We now consider the convergence analysis of Algorithm 3.1 and this is the motivation of our next result.
Theorem 3.6. Let F(·, ·) be a speudomonotone bifunction. Let un be the approximate solution of the equilibrium problem (2.12) obtained from Algorithm 3.1, then
Proof. Let u ∈ K be a solution of the equilibrium problem (2.12). Then, by using the speudomonotonicity of the bifunction F(·, ·), we have
Theorem 3.7. Let u ∈ K be solution of (2.12) and let un+1 be the approximate solution obtained from Algorithm 3.1, then lim n→un+1 = u.
Proof. Let be a solution of (2.12). Then, from (3.8), it follows that the sequence {un} is bounded and
4. Conclusion
In this paper, we have suggested and analyzed an implicit iterative method for solving the equilibrium problems on Hadamard manifold. It is shown that the convergence analysis of this methods requires only the speudomonotonicity, which is a weaker condition than monotonicity. Some special cases are also discussed. Results proved in this paper may stimulate research in this area.
Acknowledgments
The authors would like to thank Dr. S. M. Junaid Zaidi, Rector, COMSATS Institute of Information Technology, Islamabad, Pakistan, for providing excellent research facilities. Professor Y. Yao was supported in part by Colleges and Universities Science and Technology Development Foundation (20091003) of Tianjin, NSFC 11071279, and NSFC 71161001-G0105.