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 be a simply connected -dimensional manifold. Given , the tangent space of at is denoted by and the tangent bundle of by , which is naturally a manifold. A vector field on is a mapping of into which associates to each point , a vector . We always assume that can be endowed with a Riemannian metric to become a Riemannian manifold. We denote by the scalar product on with the associated norm , where the subscript will be omitted. Given a piecewise smooth curve joining to (i.e., and ,) by using the metric, we can define the length of as . Then, for any , the Riemannian distance , which includes the original topology on , is defined by minimizing this length over the set of all such curves joining to .
Let be the Levi-Civita connection with . Let be a smooth curve in . A vector field 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 is said to be normalized. A geodesic joining to in is said to be minimal if its length equals .
A Riemannian manifold is complete, if for any all geodesics emanating from are defined for all . By the Hopf-Rinow Theorem, we know that if is complete, then any pair of points in can be joined by a minimal geodesic. Moreover, is a complete metric space and bounded closed subsets are compact.
Let be complete. Then the exponential map at is defined by for each , where is the geodesic starting at with velocity and . Then for each real number .
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 is an -manifold Hadamard manifold.
We also recall the following well-known results, which are essential for our work.
Lemma 2.1 (See [6]). Let . Then is a diffeomorphism, and, for any two points , there exists a unique normalized geodesic joining to , 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 is diffeomorphic to the Euclidean space . Thus has the same topology and differential structure as . It is also known that Hadamard manifolds and euclidean spaces have similar geometrical properties. Recall that a geodesic triangle of a Riemannian manifold is a set consisting of three points , , and three minimal geodesics joining these points.
Lemma 2.2 (See [2, 3, 6] (comparison theorem for triangles)). Let be a geodesic triangle. Denote, for each , by , the geodesic joining to , and , the angle between the vectors and , and . Then,
In terms of the distance and the exponential map, the inequality (2.2) can be rewritten as since
Lemma 2.3 (See [6]). Let be a geodesic triangle in a Hadamard manifold . Then, there exist such that The triangle is called the comparison triangle of the geodesic triangle , which is unique up to isometry of .
From the law of cosines in inequality (2.3), we have the following inequality, which is a general characteristic of the spaces with nonpositive curvature [6]: From the properties of the exponential map, we have the following known result.
Lemma 2.4 (See [6]). Let and such that . Then the following assertions hold.(i)For any , (ii)If is a sequence such that and , then .(iii)Given the sequences and satisfying , if and , with , then
A subset is said to be convex if for any two points , the geodesic joining and is contained in that is, ifββ is a geodesic such that and , then for all . From now on will denote a nonempty, closed, and convex set, unless explicitly stated otherwise.
A real-valued function defined on is said to be convex, if, for any geodesic of , the composition function is convex, that is,
The subdifferential of a function is the set-valued mapping defined as and its elements are called subgradients. The subdifferential at a point is a closed and convex (possibly empty) set. Let denote the domain of defined by
The existence of subgradients for convex functions is guaranteed by the following proposition, see [8].
Lemma 2.5 (See [6, 8]). Let be a Hadamard manifold and let be convex. Then, for any , the subdifferential of at is nonempty. That is, .
For a given bifunction , we consider the problem of finding such that which is called the equilibrium problem on Hadamard manifolds. This problem was considered by Colao et al. [2]. They proved the existence of a solution of the problem (2.12) using the KKM maps. Colao et al. [2] have given an example of the equilibrium problem defined in a Euclidean space whose set is not a convex set, so it cannot be solved using the technique of Blum and Oettli [11]. However, if one can reformulate the equilibrium problem on a Riemannian manifold, then it can be solved. This shows the importance of considering these problems on Hadamard manifolds. For the applications, formulation, and other aspects of the equilibrium problems in the linear setting, see [4, 9β22].
If , where is a single valued vector filed , then problem (2.12) is equivalent to finding such that which is called the variational inequality on Hadamard manifolds. NΓ©meth [9], Colao et al. [2], Noor and Oettli [10], and M. A. Noor and K. I. Noor [5] studied variational inequalities on Hadamard manifold from different point of views. In the linear setting, variational inequalities have been studied extensively, see [5, 10, 11, 13β28] and the references therein.
Definition 2.6. A bifunction 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).
For a given satisfying (2.12), consider the problem of finding such that which is called the auxiliary equilibrium problem on Hadamard manifolds. We note that, if , then is a solution of (2.12). This observation enables to suggest and analyze the following implicit method for solving the equilibrium problems (2.12). This is the main motivation of this paper.
Algorithm 3.1. For a given , compute the approximate solution by the iterative scheme Algorithm 3.1 is called the implicit (proximal point) iterative method for solving the equilibrium problem on the Hadamard manifold. Algorithm 3.1 can be written in the following equivalent form.
Algorithm 3.2. For a given , find the approximate solution by the iterative scheme: Algorithm 3.2 is a two-step iterative method for solving the equilibrium problems on Hadamard manifolds. This method can be viewed as the extragradient method for solving the equilibrium problems.
If is a convex set in , then Algorithm 3.1 collapses to the following.
Algorithm 3.3. For a given , find the approximate solution by the iterative scheme: which is known as the implicit method for solving the equilibrium problem. For the convergence analysis of Algorithm 3.2, see [16, 19, 20].
If , where is a single valued vector filed , then Algorithm 3.1 reduces to the following implicit method for solving the variational inequalities.
Algorithm 3.4. For a given , compute the approximate solution by the iterative scheme Algorithm 3.4 is due according to Tang et al. [7] and M. A. Noor and K. I. Noor [5]. We can also rewrite Algorithm 3.4 in the following equivalent form.
Algorithm 3.5. For a given , compute the approximate solution by the iterative scheme which is the extragradient method for solving the variational inequalities on Hadamard manifolds and appears to be a new one.
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 be a speudomonotone bifunction. Let be the approximate solution of the equilibrium problem (2.12) obtained from Algorithm 3.1, then where is a solution of the equilibrium problem (2.12).
Proof. Let be a solution of the equilibrium problem (2.12). Then, by using the speudomonotonicity of the bifunction , we have Taking in (3.9), we have Taking in (3.2), we have From (3.10) and (3.9), we have For the geodesic triangle , the inequality (2.3) can be written as Thus, from (3.12) and (3.11), we obtained the inequality (3.8), the required result.
Theorem 3.7. Let be solution of (2.12) and let be the approximate solution obtained from Algorithm 3.1, then .
Proof. Let be a solution of (2.12). Then, from (3.8), it follows that the sequence is bounded and then it follows that Let be a cluster point of . Then there exists a subsequence such that converges to . Replacing by in (3.2), taking the limit, and using (3.14), we have This shows that solves (2.12) and which implies that the sequence has unique cluster point and is a solution of (2.12), the required result.
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.