Abstract
The goal of this paper is to propose and investigate new iterative methods for examining an approximate solution of a fixed-point problem, an equilibrium problem, and a finite collection of variational inclusions in the Hadamard manifold’s structure. Operating under some assumptions, we extend the proximal point algorithm to estimate the common solution of stated problems and obtain a strong convergence theorem for the common solution. We also present several consequences of the proposed iterative methods and their convergence results.
Keywords:
proximal point method; equilibrium problem; fixed-point problem; variational inclusion problem; Hadamard manifold MSC:
47J20; 47H10; 49J40
1. Introduction
Many nonlinear problems, such as equilibrium, optimization, variational inequality, and fixed-point problems, have recently been transformed from linear spaces to Hadamard manifolds; see [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15]. Fan [16] initiated the equilibrium problem (EP), which was later developed by Blum and Oettli [17] in real Hilbert space. It was Colao [5] who studied the equilibrium problem for the first time on the Hadamard manifold. For a bi-function , such that , K is a nonempty subset of the Hadamard manifold . The equilibrium problem is to locate a point , such that
They studied the existence of equilibrium point of equilibrium problem (1), and utilized their results to find the solution of mixed variational inequality problems, fixed-point problems and Nash equilibrium problems in Hadamard manifolds. They also introduced the Picard iterative method to approximate a solution of the equilibrium problem (1). Recently, Khammahawong et al. [10,18] studied the splitting type algorithms for equilibrium and inclusion problems on Hadamard manifolds. We denote by the set of equilibrium points of the equilibrium problem (1).
The variational inclusion problem in Hilbert space is to locate a point , such that
where and are single valued and set-valued mappings, respectively, defined on a nonempty subset D of Hilbert space . The solution set of the problem (2) is denoted by .
Due to its application-oriented nature, the problem (2) has been investigated extensively by a number of researchers in diverse directions.The proximal point method due to Martinet [19] is a fundamental approach for solving the inclusion problem , and Rockafellar [15] generalized this strategy to solve the variational inclusion problem (2). Li et al. [11] introduced the proximal point method for the inclusion problem in Hadamard manifold. Ansari et al. [2] examined Korpelevich’s method to find the solution of the variational inclusion problem (2) in the structure of the Hadamard manifold .
Recently, Ansari and Babu [3] investigated the variational inclusion problem (2) using the proximal point method in the Hadamard manifold, as follows:
Let and , define , such that
where is the parallel transport of to on the tangent bundle of , is the exponential mapping, V and G are single valued and set-valued monotone vector fields, respectively defined on .
Several practical problems can be formulated as a fixed-point problem:
where S is a nonlinear mapping. The solutions of this equation are called fixed points of S, which is denoted by . Li et al. [13] extended the Mann and Halpern iteration scheme to find the fixed point of nonexpansive mappings from Hilbert spaces to Hadamard manifolds. Recently, Al-Homidan et al. [1] proposed and analyzed the Halpern and Mann-type iterative methods to find the solution of a variational inclusion problem (2) and fixed-point problem (4) of self nonexpansive mapping S in the Hadamard manifold, which is to locate , such that
Most of the problems originating in nonlinear science, such as signal processing, image recovery, signal processing, optimization, machine learning, etc., are switchable to either variational inclusion, an equilibrium problem or a fixed-point problem. Therefore, many mathematicians have recently transformed and studied the inclusion problems, equilibrium problems and fixed-point problems in different directions from linear to nonlinear spaces; for examples, see [1,2,3,6,7,9,11,12,13,20,21,22] and references cited therein.
As zero of the sum of monotone mapping is the fixed point of resolvent , , following the work of Ansari et al. [2], and Al-Homidan et al. [1], Chang et al. [4] investigated the problem:
where and represent the set of fixed points of the mapping S and equilibrium points of equilibrium function F, respectively, and is the set of common singularities of N variational inclusion problems, defined as:
If , for all , we have
Inspired by the works of Ansari and Babu [3], Al-Homidan et al. [1] and following contemporary research work, our motive in this article is to propose new iterative algorithms to solve problems (5)–(7) in the setting of Hadamard manifold. We also bring out some consequences of proposed iterative algorithms. The following section contains some definitions, symbols, and useful results on Riemannian manifolds. Section 3 contains the main results describing the iterative algorithms for the problems (5)–(7). In the last section, we discuss some of the consequences of the suggested algorithms and their convergence results for solving variational inequality problems with equilibrium and fixed-point problems.
2. Preliminaries
We consider to be a differentiable manifold of finite dimension. Let indicate the tangent space of at u, and the tangent bundle of is indicated by , which is obviously a manifold. An inner product on is termed as Riemannian metric on . A tensor is said to be the Riemannian metric on , if is a Riemannian metric on for each . We denote the Riemannian metric on by and corresponding norm by , which is given by , for all . We assume that is equipped with the Riemannian metric and its corresponding norm is . For simplicity, we omit the subscript.
The length of a piecewise smooth curve joining u to v (i.e., and ) is defined as The Riemannian distance yields the original topology on , which minimizes the length over the set of all such curves which connect u and v.
We denote the Levi-Civita connection associated to by ∇. We know that if , the vector field F is parallel along a smooth curve . If is parallel along , then is said to be geodesic and in this case is constant. is called a normalized geodesic, if . A minimal geodesic is a geodesic connecting u to v in with the length equal to . A complete Riemannian manifold is one in which for any . All geodesics that originate from u are defined for all real numbers . Due to Hopf–Rinow Theorem [23], it is known to us that in a complete Riemannian manifold , any can be attached through a minimal geodesic.
Moreover, the exponential map at u is defined by for each , where is the geodesic starting from u with velocity w (that is, We know that for each real number t and . It is known to us that for any , the exponential map is differentiable on and the derivative of is the identity vector of . Hence, using inverse mapping theorem, there is an inverse exponential map . Moreover, for any , we have , where . In particular, if the Euclidian space, then for all .
A Hadamard manifold is a Riemannian manifold with nonpositive sectional curvature which is complete and simply connected.
Lemma 1
([23]). Let be a finite dimensional manifold and be a geodesic joining u to v. Then,
Proposition 1
([23]). Let be a Hadamard manifold. Then
- (i)
- The exponential map is a diffeomorphism for all .
- (ii)
- For any pair of point , there exists a unique normalized geodesic joining to , which is in fact a minimal geodesic defined by
A subset K of Hadamard manifold is called a convex set if, for any , any geodesic joining u and v must be in K. In other words, if is a geodesic, such that and , then , for all .
A function is called a geodesic convex function, if for any geodesic , the composition function is convex; that is,
Proposition 2
([23]). The Riemannian distance is a convex function with respect to the product Riemannian metric, i.e., given any pair of geodesics and , the following inequality holds for all
In particular, for each , the function is a convex function.
For n-dimensional manifold , we conclude by Proposition 1 that is diffeomorphic to the Euclidean space ; hence, and have the same differential structure and topology. Moreover, Euclidean spaces and Hadamard manifold have certain identical geometric prospects. Some of these are stated in the following results.
In a Riemannian manifold , geodesic triangle is a collection of three points and and the three minimal geodesics joining to , where
Lemma 2
([13]). Let be a geodesic triangle in Hadamard manifold . Then, , such that
The points are called the comparison points to , respectively. The triangle is called the comparison triangle of the geodesic triangle , which is unique to the isometry of .
Lemma 3
([13]). Let be a geodesic triangle in Hadamard manifold and be its comparison triangle.
- (i)
- Let (respectively, ) be the angles of (respectively, ) at the vertices (respectively, ). Then, the following inequalities hold:
- (ii)
- Let v be a point on the geodesic joining to and be its comparison point in the interval . Suppose that and . Then,
Proposition 3
([23]). (Comparison Theorem for Triangle) Let be a geodesic triangle. Denote, for each , by geodesic joining to and set . Then,
The parallel transport on the tangent bundle along , with respect to ∇, is defined by
such that , for all and , where V is the unique vector field. If is the minimal geodesic from u to v, then we write in place of . Moreover, is an isometry from to , which means that parallel transport preserves the inner product, , .
Lemma 4
([11]). Let and with . Then, the following assertions hold:
- (i)
- For any , we have and .
- (ii)
- If and , then
- (iii)
- Let and , if and then .
- (iv)
- For any , the function , defined by for all , is continuous on .
We denote by , the set of all single-valued vector fields , such that for all and by the set of all set-valued vector fields, , such that for all , where is the domain of G defined as
Definition 1
([24]). A single-valued vector field is said to be
- (i)
- Monotone if
- (ii)
- Strongly monotone if there exists a constant such that
- (iii)
- φ-Lipschitz continuous if there exists a constant , such that
Definition 2
([25]). A set-valued vector field is said to be
- (i)
- Monotone if for all ,
- (ii)
- Maximal monotone if G is monotone and for and , the conditionimplies .
Definition 3
([25]). A set-valued vector field is called upper Kuratowski semicontinuous at if, for any sequence and with , the relation and imply . Moreover, G is called upper Kuratowski semicontinuous on if it is Kuratowski semicontinuous at each .
Definition 4.
Let be a complete metric space and be a nonempty set. A sequence in X is called Fejr convergent to K if, for all and ,
Lemma 5
([8]). Let be a complete metric space. If is a Fejr convergent to a nonempty set , then is bounded. Moreover, if cluster point u of belongs to K, then converges to u.
Let and be a bifunction satisfying the following conditions:
- (A)
- ;
- (B)
- F is monotone; that is, for all ;
- (C)
- For every , is upper semicontinuous;
- (D)
- For all , is geodesic convex and lower semicontinuous;
- (E)
- There exists a compact set and a point , such that
The resolvent of a bifunction F, a set-valued operator introduced by Colao [5] in the setting of the Hadamard manifold, is defined by
Lemma 6
([5]). Let and be a bifunction satisfying (A)–(E). Then, for ,
- (a)
- The resolvent of F is nonempty and single valued;
- (b)
- The resolvent of F is firmly nonexpansive;
- (c)
- The fixed point of is the equilibrium point set of F;
- (d)
- The equilibrium point set is closed and geodesic convex.
3. Main Results
The solution to problem (6) is assumed to be consistent, and it is denoted by . We propose the following iterative procedure to solve the problem (6) in , based on the proximal point method (3).
Algorithm 1.
Suppose that, , andare the same as described above. Choose arbitraryto define the sequences, , and as follows:
where such that , and .
If for all , we have the following iterative algorithm to solve the problem (7).
Algorithm 2.
For arbitraryobtain the sequences, andas follows:
where, and.
If for all and , then we have the following iterative algorithm to solve the problem (5).
Algorithm 3.
For arbitraryobtain the sequences and as follows:
where , and .
Theorem 1.
Let K be the nonempty, closed and geodesic convex subset of . Suppose that for every , vector field is -strongly monotone and -Lipschitz continuous and is maximally monotone. Let be a bifunction enjoying the conditions and be the resolvent of F, as a nonexpansive mapping. If and , , , and satisfy the following conditions:
- (H1)
- , and
- (H2)
- .
- (H3)
Then, the sequence obtained from Algorithm 1 converges to an element in Γ.
Proof.
The proof is divided into the following three steps:
Step I. First, we justify that the sequence is Fejr monotone with respect to .
Let , then for each . For any arbitrary , from Algorithm 1, we have
with monotonicity of G, which implies that
Since is -strongly monotone vector field for each , then
Since is -Lipschitz continuous monotone vector field for each and , using Cauchy–Schwartz inequality, we get
Thus, inequality (16) becomes
For fixed and , let . Then, using (12), we get
Since, and , we have
or
Since and , implies that , we get
From Algorithm 1, (21) and using the nonexpansiveness of S, we get
that is, is Fejr monotone and hence bounded by Lemma 5, and therefore the sequence all are bounded and exists.
Step II. Next, we show that , and as . Since , then applying geodesic convexity of d, we get
For fixed , let and be the geodesic triangle and be the comparison triangle. Then, we have
or,
Further, using condition (H3), we have
Since is Fejr monotone with respect to , exists; hence, we get
Since , , are bounded, there exists with , and for each , we have
For any integer , we can write
Using condition (H2), we have
Thus, using (27), we get
Furthermore, for each
and
Step III. Finally, we show that the limit of a sequence belongs in .
From step I, we know that the sequence is bounded, so there is a subsequence of converging to a cluster point of . From (26), we have , and (32) implies as ; thus, due to the nonexpansiveness of S, we get
Thus, we obtain .
Since is also nonexpansive, using (31), we get
which amounts to .
From Algorithm 1, we have
G is upper Kuratowski semicontinuous, as it is maximally monotone; then, we have , for every , that is . Hence, . This completes the proof by appealing to Lemma 5. □
If , then we have the following convergence result for Algorithm 2.
Corollary 1.
Let K be nonempty, closed and geodesic convex subset of . Let vector field be a η-strongly monotone and φ-Lipschitz continuous; is maximally monotone. Let be a bifunction enjoying the conditions , and be the resolvent of F, be a nonexpansive mapping. If and , and satisfy the following conditions (H1)–(H3), then the sequence obtained by Algorithm 2 converges to the solution of problem (7).
For Algorithm 3, we have the following result to solve .
Corollary 2.
Let K be a nonempty, closed and geodesic convex subset of and vector field be η-strongly monotone and φ-Lipschitz continuous. is maximally monotone and is a nonexpansive mapping. If and , and satisfy the following conditions (H1)–(H3), then the sequence obtained by Algorithm 3 converges to the solution of problem (5).
4. Consequences
Németh [14], introduced and studied the following variational inequality problem Find , such that
where is a single-valued vector field defined on .
We know that is a solution of if and only if u satisfies
where is the normal cone to K at , defined by
The indicator function of K is defined by
Since is proper, lower semicontinuous, then the differential of is maximally monotone, which is defined by
Thus, we have
For , the resolvent of , defined by
Thus, for and for all , we have
Let , be a finite collection of monotone mappings, then the variational inequality problem for is defined as
and the solution set is denoted by .
Algorithm 4.
For an arbitrarycompute the sequences, andas follows:
where such that , and .
If for all , then we give the following algorithm to solve
Algorithm 5.
For arbitrarycompute the sequences, andas follows:
where, and.
If for all and , then we propose the following algorithm to solve
Algorithm 6.
For arbitrarycompute the sequences and as follows:
where , and .
Corollary 3.
Let be -strongly monotone and -Lipschitz continuous monotone vector fields for each . Let be a bifunction satisfying the conditions (A)–(E) and be the resolvent of F, , which is a nonexpansive mapping. If and , , , and satisfy the conditions given in Theorem 1. Then, the sequence obtained by Algorithm 4 converges to an element in .
Corollary 4.
Let be η-strongly monotone and φ-Lipschitz continuous monotone vector field. Let be a bifunction satisfying the conditions (A)–(E) and be the resolvent of F, be a nonexpansive mapping. If , , and satisfy the conditions given in Theorem 1, then the sequence obtained by Algorithm 5 converges to an element in .
Corollary 5.
Let be η-strongly monotone and φ-Lipschitz continuous monotone vector field. Let be a nonexpansive mapping. If , , and satisfy the conditions given in Theorem 1. Then the sequence obtained by Algorithm 6 converges to an element in .
5. Conclusions
This work is concerned with the investigation of the common solution of a fixed-point problem, an equilibrium problem and a finite collection of variational inclusion problems. Our proposed algorithms are advanced and can be considered improvements to the methods discussed in the paper [3]. Several consequences of the suggested algorithms are discussed for variational inequalities, equilibrium and fixed-point problems. We anticipate that the methods presented in this paper can be extended to more general settings; for example, hyperbolic spaces, geodesic spaces and a CAT(0) space.
Author Contributions
Conceptualization, M.D.; methodology, D.F.; validation, M.A.; formal analysis, D.F.; investigation, S.C.; writing, original draft preparation, M.D.; funding acquisition, D.F.; writing, review and editing, M.A. All authors have read and agreed to the published version of the manuscript.
Funding
This research was funded by the Deanship of Scientific Research at Princess Nourah bint Abdulrahman University through the Fast-track Research Funding Program.
Institutional Review Board Statement
Not applicable.
Informed Consent Statement
Not applicable.
Data Availability Statement
Not applicable.
Acknowledgments
This research was funded by the Deanship of Scientific Research at Princess Nourah bint Abdulrahman University through the Fast-track Research Funding Program. The authors sincerely thank the unknown reviewers for their worthy suggestions and helpful comments that have led to the present form of the original manuscript.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Al-Homidan, S.; Ansari, Q.H.; Babu, F. Halpern and Mann type algorithms for fixed points and inclusion problems on Hadamard manifolds. Numer. Funct. Anal. Optim. 2019, 40, 621–653. [Google Scholar] [CrossRef]
- Ansari, Q.H.; Babu, F.; Li, X.-B. Variational inclusion problems on Hadamard manifolds. J. Nonlinear Convex Anal. 2018, 19, 219–237. [Google Scholar]
- Ansari, Q.H.; Babu, F. Proximal point algorithm for inclusion problems in Hadamard manifolds with applications. Optim. Lett. 2021, 15, 901–921. [Google Scholar] [CrossRef]
- Chang, S.S.; Yao, J.C.; Yang, L.; Wen, C.F.; Wu, D.P. Convergence analysis for variational inclusion problems equilibrium problems and fixed point in Hadamard manifolds. Numer. Funct. Anal. Appl. 2021, 42, 567–582. [Google Scholar] [CrossRef]
- Colao, V.; López, G.; Marino, G.; Martín-Márquez, V. Equilibrium problems in Hadamard manifolds. J. Math. Anal. Appl. 2012, 388, 61–71. [Google Scholar] [CrossRef] [Green Version]
- Dilshad, M. Solving Yosida inclusion problem in Hadamard manifold. Arab. J. Math. 2020, 9, 357–366. [Google Scholar] [CrossRef] [Green Version]
- Dilshad, M.; Khan, A.; Akram, M. Splitting type viscosity methods for inclusion and fixed point problems on Hadamard manifolds. AIMS Math. 2021, 6, 5205–5221. [Google Scholar] [CrossRef]
- Ferreira, O.P.; Oliveira, P.R. Proximal point algorithm on Riemannian manifold. Optimization 2002, 51, 257–270. [Google Scholar] [CrossRef]
- Filali, D.; Dilshad, M.; Akram, M.; Babu, F.; Ahmad, I. Viscosity method for hierarchical variational inequalities and variational inclusions on Hadamard manifolds. J. Inequalities Appl. 2021, 2021, 66. [Google Scholar] [CrossRef]
- Khammahawong, K.; Kumam, P.; Chaipunya, P. Splitting algorithms of common solutions between equilibrium and inclusion problems on Hadamard manifold. Linear Nonlinear Anal. 2020, 6, 227–243. [Google Scholar]
- Li, C.; Lopez, G.; Márquez, V.M. Monotone vector fields and the proximal point algorithm on Hadamard manifolds. J. Lond. Math. Soc. 2009, 79, 663–683. [Google Scholar] [CrossRef]
- Li, C.; López, G.; Márquez, V.M.; Wang, J.H. Resolvent of set-valued monotone vector fields in Hadamard manifolds. J. Set-Valued Anal. 2011, 19, 361–383. [Google Scholar] [CrossRef]
- Li, C.; López, G.; Martín-Márquez, V. Iterative algorithms for nonexpansive mappings on Hadamard manifolds. Taiwan. J. Math. 2010, 14, 541–559. [Google Scholar]
- Németh, S.Z. Variational inequalities on Hadamard manifolds. Nonlinear Anal. 2003, 52, 1491–1498. [Google Scholar] [CrossRef]
- Rockafellar, R.T. Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 1976, 14, 877–898. [Google Scholar] [CrossRef] [Green Version]
- Fan, K. A Minimax Inequality and Applications; Academic Press: New York, NY, USA, 1972; pp. 103–113. [Google Scholar]
- Blum, E.; Oetteli, W. From optomization and variational inequalities to equilibrium problems. Math. Stud. 1994, 63, 123–145. [Google Scholar]
- Khammahawong, K.; Kumam, P.; Chaipunya, P. Splitting Algorithms for Equilibrium Problems and Inclusion Problems on Hadamard Manifolds. Numer. Funct. Anal. Optim. 2021, 42, 1645–1682. [Google Scholar] [CrossRef]
- Martinet, B. Régularisation d’inequations variationnelles par approximations successives. Rev. Fr. Inform. Oper. 1970, 4, 154–158. [Google Scholar]
- Walter, R. On the metric projections onto convex sets in Riemannian spaces. Arch. Math. 1974, 25, 91–98. [Google Scholar] [CrossRef]
- Khammahawong, K.; Kumam, P.; Chaipunya, P.; Martinez-Marino, J. Tseng’s method for inclusion problem on Hadamard manifolds. Optimization 2021. [Google Scholar] [CrossRef]
- Rapcsák, T. Smooth Nonlinear Optimization in ; Kluwer Academic Publishers: Dordrecht, The Netherlands, 1997. [Google Scholar]
- Sakai, T. Riemannian Geomety, Translations of Mathematical Monograph; American Mathematical Society: Providence, RI, USA, 1996. [Google Scholar]
- Németh, S.Z. Monotone vector fields. Publ. Math. Debrecen 1999, 54, 437–449. [Google Scholar]
- Da Cruz Neto, J.X.; Ferreira, O.P.; Lucambio Pérez, L.R. Monotone point-to-set vector fields. Balk. J. Geom. Appl. 2000, 5, 69–79. [Google Scholar]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).