1. Introduction
It is well known that the theory of variational inequalities, introduced by Hartman and Stampacchia [1] in the early 1960s, has played an important role in the study of physics, engineering, and economics, and it encompasses as special cases complementarity problems, optimization problems, the problem of finding zeros of operators, etc. Within the period of the past 20 years, a great deal of effort has gone into the existence and algorithms for variational inequality problems, related optimization problems, and related fixed-point problems; see, e.g., [2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18] and the references therein.
Let be a Hadamard manifold and C be a nonempty subset of . In 2012, Calao et al. [19] first studied the following equilibrium problem of finding such that
(1)
for all , in which the function is of equilibrium. It was proven in [19] that there holds the existence of solutions to the issue (1) for . Moreover, the outcomes were employed to settle mixed variational inequalities, fixed point issues, and Nash equilibrium issues in . Using Picard’s iterative method, the authors introduced an iterative algorithm for finding a solution of issue (1). Subsequently, it was pointed out in [20] that there hold certain gaps involving the existence argument for mixed variational inequality problems and the domain for the resolvent implicating the equilibrium issue of [19].Recently, the authors [21,22] investigated the problem of finding an element , with T being the nonexpansive operator, B being the maximal monotone vector field, and A being the continuous monotone vector field in a Hadamard manifold . They proposed some Halpern-type and Mann-type iterative methods. Under some mild conditions, they proved that the iterative sequences fabricated in the suggested methods are strongly convergent to an element in the set of common solutions of the fixed-point problem of T and the variational inclusion problem for A and B.
Assume , where the bounded C is of both closedness and geodesic convexity in ; let be the resolvent of equilibrium function for , and let be the inverse of the exponential map at . Very recently, Chang et al. [23] considered the problem of finding an element
(2)
in which is the fixed point set of the quasi-nonexpansive operator , is the equilibrium point set of , and is the maximal monotone vector field; for , each continuous is a monotone vector field, and is the common singularity set of a quasivariational inclusion system. They proposed the following splitting iterative algorithm, that is, for any initial , the sequence is defined as follows:(3)
where , and is the mapping defined by and for . Under some mild assumptions, it was proven that the constructed in (3) is strongly convergent to an element of .Inspired and aroused by the works above, this article considers the issue of seeking an element
(4)
in Hadamard manifold , where is the set of common fixed points of finitely many quasi-nonexpansive mappings , and are the same as above. We propose a triple Mann iteration method and show that the sequence fabricated in suggested algorithm is convergent to an element in the set of common solutions for issue (4). Finally, making use of the main result, we deal with the minimizing issue with a CFPP constraint and saddle-point issue with a CFPP constraint on Hadamard manifolds, respectively. Our main result improves, extends, and develops Chang et al. [23], Theorem 3.1, in some aspects.2. Basic Notions and Tools
To address the problem (4), one first releases certain preliminaries on geometric theory of manifolds, including some concepts and basic tools. It is worth mentioning that these can be found in many introductory books on Riemannian and differential geometry (see, e.g., [24]).
Assume is a differentiable manifold of finite dimension. Then, the tangent space of at is denoted as . The tangent bundle of is formulated as . Naturally, it is a manifold. The inner product in is termed as a Riemannian metric in . The tensor field is termed as a Riemannian metric on if and only if, for each , the tensor is a Riemannian metric on . The associated norm with on is written as . The differentiable manifold equipped with Riemannian metric is termed as Riemannian manifold. Let the curve joining u to v (i.e., and ) be piecewise smooth. Then, the length of is defined as . Moreover, the Riemannian distance , inducing the original topology on , is formulated as minimizing this length over the set of all such curves joining v to y.
The Riemannian manifold is of completeness if and only if, for each , any geodesic emanating from y is definable with respect to (w.r.t.) t in . The geodesic joining v to y in is termed as the minimal geodesic if and only if the length of it equals to . Riemannian manifold endowed by Riemannian distance d is the metric space . From the Hopf–Rinow result [24], it is easily known that, in case is of completeness, each pair of elements in is joined with the minimal geodesic. Meanwhile, the metric space is of completeness, and each closed bounded subset is of compactness.
Suppose that Riemannian manifold is of completeness. The map at y is the exponential one formulated as for all , in which denotes the geodesic initiating from y with velocity v, that is, and . Then, for any . It is clear to check , in which 0 denotes the zero tangent vector. It is noteworthy that map is the differentiable exponential one on w.r.t. .
A complete simply connected Riemannian manifold of nonpositive sectional curvature is called a Hadamard Manifold. In the rest of this paper, we always assume that is a Hadamard Manifold of finite dimension without causing confusion.
(see [24]). For any two points , there exists a unique normalized geodesic joining to , which is actually a minimal geodesic denoted by
(5)
Moreover, for each in satisfying in , there hold the following:(6)
It is easy to check that the following lemma is valid.
(i) If is a geodesic joining x to y, then we have
(7)
(From now on, indicates the Riemannian distance).(ii) For each and , there hold the inequalities below:
(8)
(9)
(10)
The set C in is of geodesic convexity if and only if, for each , the geodesic joining y to v belongs to C. The geodesic convex hull of set is the smallest geodesic convex set containing D in , and it is written as .
In what follows, unless otherwise specified, we always assume that , where C is of both closedness and geodesic convexity in Hadamard manifold , and denotes the set of fixed points of an operator S.
The function is termed as being of geodesic convexity if and only if, for each geodesic () joining , the is of convexity, that is,
Assume the metric space X is complete, and let . The sequence in X is of Fejér monotonicity w.r.t. D if and only if, for each and each non-negative n, one has .
(see [25,26]). Assume the metric space X is complete, and let . In the case that is of Fejér monotonicity w.r.t. D, is of boundedness. In addition, in the case that has a cluster point y lying in D, is convergent to y.
An operator S from C to itself is termed as being the following:
(a) Contractive if and only if such that
(in particular, in the case of , S is termed as being nonexpansive);(b) Quasi-nonexpansive if and only if is not equal to ∅, and
(c) Firmly nonexpansive [27] if and only if, for each in C, the map formulated by
(11)
is nonincreasing.(see [27]). Let be a mapping. Then, the following statements are equivalent:
(i) S is firmly nonexpansive;
(ii) For all and ,
(12)
(iii) for all ,
(13)
(see [23]). Let be firmly nonexpansive, and assume is not equal to ∅. Then, for each and , there holds the inequality below:
(14)
It is remarkable that, when , by Lemma 3, one obtains the relations below:
The firm nonexpansivity of the nonexpansivity of the quasinonexpansivity of S.
However, the converse relations do not hold.
An operator S from C to itself is termed as being demiclosed at zero if and only if, for each satisfying and , one has .
In what follows, one uses to denote the collection of all single-valued vector fields such that , and the domain of A defined by
Also, one uses to indicate the collection of all set-valued vector fields such that , and is the domain of B formulated by .Next, one furnishes some vital notions (see [28]) that will be helpful to demonstrate the major outcome:
(i) A single-valued vector field is termed as being monotone if and only if
(ii) A set-valued vector field is termed as being the following:
(a) Monotone if and only if, for each
(b) Maximal monotone if and only if it is monotone and, for the given and , the relation
implies .(iii) For given , the resolvent of B for is a set-valued mapping formulated by
(15)
(see [21]). Given a single-valued vector field of monotonicity and a set-valued vector field of maximal monotonicity, one then has that for each , there holds the equivalence of the assertions below:
(i) ;
(ii) .
In addition, we recall the resolvent of a bifunction on Hadamard manifold introduced in Calao et al. [19], as outlined below:
Assume , where C is of both closedness and geodesic convexity in . Given a bifunction , the resolvent of is set-valued mapping such that
(16)
(see [19,20]). Let be a bifunction satisfying the following conditions:
(A1) ;
(A2) , i.e., Φ is monotone;
(A3) is upper semicontinuous for each ;
(A4) is geodesic convex and lower semicontinuous for each ;
(A5) ∃ (compact set) D in such that
One then has that for each , the assertions listed below hold:(i) The resolvent is nonempty and single-valued;
(ii) The resolvent is firmly nonexpansive;
(iii) , i.e., the fixed point set of is the equilibrium point set of Φ;
(iv) is of both closedness and geodesic convexity.
3. Major Outcomes
Let be a Hadamard manifold of finite dimension and the nonempty be of both closedness and geodesic convexity in . Assume throughout that the following conditions hold:
is a multi-valued vector field of maximal monotonicity, is a single-valued vector field of both continuity and monotonicity for , and is the mapping defined by and for ;
is the bifunction fulfilling the hypotheses (A1)–(A5) of Lemma 5 and is the resolvent of for and is of both closedness and geodesic convexity;
is a finite family of L-Lipschitzian and demiclosed at zero quasi-nonexpansive self-mappings on C, where ;
;
For given and , the inequality holds
(17)
and such that the following are true:
(i). , and ;
(ii). , and .
In terms of Xu and Kim [18], we write for integer with the mod function taking values in the set , that is, if for some integers and , then if and if .
Let , and be chosen as in the above conditions. Given a starting arbitrarily. Let and be the sequences defined as follows:
(18)
Then, we have the following: (i) The sequence converges to a solution of problem (4);(ii) In addition, if , and , then the sequence defined by
converges to a solution of problem (2);
(iii) In addition, if , and (the null operator), , then the sequence defined by
converges to an element ;
(iv) In addition, if for , , and , is the sequence constructed as
then converges to an element ;
(v) In addition, if for , , and , is the sequence constructed as
then converges to a common fixed point of ;
(vi) In addition, if , and , then the sequence defined by
converges to an element ;
(vii) In addition, if , and , then the sequence defined by
converges to an element .
First of all, using the conditions in Theorem 1 and Lemmas 4 and 5, one knows the following:
(i) The resolvent of function is the single-valued mapping of firm nonexpansivity such that ;
(ii) If , then one has that and ,
(19)
We now divide the rest of the proof into several steps.
Step 1. We claim that the sequences and all are bounded in C.
Indeed, by condition (17), for each and , is a mapping of quasi-nonexpansivity. Take a fixed arbitrarily. Then, for , by (17) and Lemma 1 (ii), we have
(20)
Since is quasi-nonexpansive for , from Lemma 1 (ii), (18), and (20) we obtain(21)
Thus, from Lemma 1 (ii), Lemma 5, (18), and (21), we have(22)
This implies that, for all and ,(23)
that is, is of Fejér monotonicity w.r.t. . Via Lemma 2, is of boundedness and so are the sequences . As a result, the limit exists for each .Step 2. We claim that for ,
(24)
Indeed, from (20), (21), and (23) we obtain that
(25)
Taking and setting , by Lemma 1 (ii), we deduce that, for each , By induction, one deduces that, for ,(26)
Taking the limit in (26) as , we obtain Since and , we obtain that Consequently, In a similar way, from (25), we can also show that Thus, the assertions in (24) are valid.Step 3. We claim that, for ,
Indeed, by (18) and Lemma 1 (ii), we obatain
which hence yields Noticing , from (24) we have(27)
Since each is L-Lipschitzian, using Lemma 1 (ii), one has which hence leads to Noticing , from (24), we have(28)
Also, since is firmly nonexpansive, by Lemma 1 (ii), we obatain which immediately implies that Noticing , from (24), we obtain(29)
Step 4. We claim that converges to some point .
Indeed, since C is closed and geodesic convex in finite dimensional , and is of boundedness in C, one has that such that is convergent to an element in C. We first claim . Without loss of generality, we may assume for all k. Since combining (due to (24)) and guarantees for all , we deduce from (28) that . Then, the demiclosedness assumption of implies that for all j. This ensures that . Again, note that and are all nonexpansive mappings, which are also demiclosed at zero. So, it follows from (27) and (29) that . Since for and , we have . Consequently, . Since is Fejér monotone with respect to , in terms of Lemma 2, we obtain . The conclusion (i) of Theorem 1 is proved.
Step 5. We claim that there hold the conclusions (ii), (iii), (iv), (v), (vi), and (vii) in Theorem 1:
(1) Indeed, (a) if , then we obtain that, for and ,
(b) If and , then we obtain Therefore, (18) reduces to the following iterative algorithm: which converges to as a solution of problem (2). The conclusion (ii) of Theorem 1 is proved.(2) Indeed, (a) if and , then we obtain that, for and ,
(b) If , we obtain Therefore, (18) reduces to the following iterative algorithm: which converges to an element . The conclusion (iii) is proved.(3) Indeed, (a) if and , then we obtain that, for and ,
and hence (b) If , then we have , and hence Therefore, (18) reduces to the following iterative algorithm: which converges to an element . The conclusion (iv) is proved.(4) Indeed, if and , then we obtain that, for and ,
and hence (b) If , then we have , and hence Therefore, (18) reduces to the following iterative algorithm: which converges to a common fixed point of . The conclusion (v) is proved.(5) Indeed, (a) if , and , then we obtain that, for and ,
(b) If , then we obtain Therefore, (18) reduces to the following iterative algorithm: which converges to an element . The conclusion (vi) is proved.(6) Indeed, (a) if , and , then we obtain that, for and ,
(b) If , then we obtain Therefore, (18) reduces to the following iterative algorithm: which converges to an element . The conclusion (vii) is proved. □Compared with Theorem 3.1 in Chang et al. [23], our Theorem 1 improves, extends, and develops it in the following aspects:
(i) The problem of finding an element of in [23] is extended to develop our problem of finding an element of , where is a finite family of L-Lipschitzian () demiclosed at zero and which features quasi-nonexpansive self-mappings on C.
(ii) The boundedness assumption of the nonempty closed and geodesic convex subset in [23], Theorem 3.1, is dropped by our Theorem 1, and there is only the assumption of the nonempty closed and geodesic convex subset in our Theorem 1.
(iii) Because is diffeomorphic to an Euclidean space , has the same topology and differential structure as . Moreover, Hadamard manifolds and Euclidean spaces have some similar geometrical properties. Therefore, the convergence statement of the sequence in our Theorem 1 is more general.
(iv) The splitting iterative algorithm of Theorem 3.1 in [23] is developed into the triple Mann-type iteration method of this paper, i.e., the iteration steps , , and in [23], Theorem 3.1, are extended to develop the ones , , and in our Theorem 1, respectively.
4. Applicable Examples
Assume throughout that is a Hadamard manifold of finite dimension, and the nonempty is of both closedness and geodesic convexity in .
4.1. The Minimizing Problem with CFPP Constraint
Suppose that are two proper functions of both lower semicontinuity and geodesic convexity. One first considers the minimizing problem of seeking an element such that
(30)
where denotes the set of solutions of the minimization issue (30), i.e.,(31)
This matter possesses a specific scenario for linear inverse issues, and some authors have furnished its applications in compressed sensing, image reconstruction, data retrieve and machine learning; refer to [29,30,31,32].
Next, one writes
in which . It is easily known that function satisfies the conditions below:(A1) ;
(A2) , i.e., is monotone;
(A3) is upper semicontinuous for each ;
(A4) is geodesic convex and lower semicontinuous for each ;
Assume that is a finite family of L-Lipschitzian () demiclosed at zero and with quasi-nonexpansive self-mappings on C. In Theorem 1, we put , and . Then, using Theorem 1 (iii), we derive the following result.
Assume and are chosen as in the above conditions, and is the resolvent of Φ formulated in (16), where is of both closedness and geodesic convexity. Suppose there hold the relations below:
(i) ∃ (compact set) such that
(ii) , and .
Then the sequence defined by
(32)
converges to an element .4.2. The Saddle Point Problem (SPP) with CFPP Constraint
Given Hadamard manifolds , we consider geodesic convex subsets of , respectively. The mapping is termed as a saddle function iff the following hold:
(i) is of geodesic convexity on w.r.t. ;
(ii) is of geodesic concavity, that is, is of geodesic convexity on w.r.t. .
An element is termed as a saddle point of H if and only if
(33)
where denotes the saddle point set of problem (33).Let be an associated multi-valued vector field with saddle function H formulated below
(34)
Let denote a product space. Then, it is a Hadamard manifold, and the tangent space of it at is (for more information, refer to Page 239 of [24]). The relevant metric is specified below
The product of two geodesics in and denotes a geodesic in the product manifold . So, for arbitrary two elements and in , one hasThe vector field is termed as being monotone if and only if, for each and , one has
(see [33]). Suppose that H is a saddle function on , and is the multi-valued vector field formulated in (34). Then, is of maximal monotonicity.
It can be readily seen that an element is a saddle point of H if and only if is a singularity of . Next, for , let the mapping be L-Lipschitzian (), demiclosed at zero, and quasi-nonexpansive.
In Theorem 1, we put , and . By Theorem 1 (vi), we immediately obtain the assertion below.
Suppose that is a saddle function, and is the corresponding vector field of maximal monotonicity. Assume is a finite family of L-Lipschitzian (), demiclosed at zero, and with quasi-nonexpansive self-mappings on C such that . Choose the initial point , and define as follows:
for , with satisfying and . Then, converges to an element .
5. Conclusions
In this study, we have devised and analyzed a triple Mann iteration method for approximating a common solution of a system of quasi-variational inclusion problems, an equilibrium problem and a common fixed point problem (CFPP) of finitely many quasi-nonexpansive mappings on Hadamard manifolds. With the help of some suitable assumptions, we have shown that the iterative sequence constructed by the proposed algorithm converges to a common solution. In addition, we have furnished the applications of the major outcomes in some specific matters such as the minimization problem with CFPP constraint and saddle point problem with CFPP constraint on Hadamard manifolds. Our major outcomes are the improvement and development of those in Chang et al. [23]. Finally, it is worth mentioning that a section of our subsequent investigation is focused on presenting the new convergence outcome for the modification of our devised method with countably many quasi-nonexpansive mappings on Hadamard manifolds.
Methodology, L.-C.C. and Y.-Y.H. Validation, S.-Y.L.; Writing—review & editing, J.-C.Y. All authors have read and agreed to the published version of the manuscript.
Data are contained within the article.
The authors declare no conflicts of interest.
Footnotes
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
References
1. Hartman, P.; Stampacchia, G. On some nonlinear elliptic differential functional equations. Acta Math.; 1966; 115, pp. 153-188. [DOI: https://dx.doi.org/10.1007/BF02392210]
2. Eskandani, G.Z.; Raeisi, M.; Lotfikar, R.H. New algorithms for solving pseudo-monotone variational inequalities in Banach spaces. J. Math. Stat.; 2024; 53, pp. 981-1000. [DOI: https://dx.doi.org/10.15672/hujms.1228124]
3. Chang, S.S.; Wen, C.F.; Yao, J.C. Forward-backward splitting method for solving a system of quasi-variational inclusions. Bull. Malays. Math. Sci. Soc.; 2019; 42, pp. 2169-2189. [DOI: https://dx.doi.org/10.1007/s40840-017-0599-0]
4. Raeisi, M.; Chalack, M.; Eskandani, G.Z. Gradient projection-type algorithms for solving ϕ-strongly pseudomonotone equilibrium problems in Banach Spaces. Optimization; 2022; 71, pp. 2749-2767. [DOI: https://dx.doi.org/10.1080/02331934.2021.1884860]
5. Ceng, L.C.; Wen, C.F. Systems of variational inequalities with hierarchical variational inequality constraints for asymptotically nonexpansive and pseudocontractive mappings. Rev. R. Acad. Cienc. Exactas Fís. Nat. Ser. A Mat. RACSAM; 2019; 113, pp. 2431-2447. [DOI: https://dx.doi.org/10.1007/s13398-019-00631-6]
6. Eskandani, G.Z.; Kim, J.K.; Moharami, R.; Lim, W.H. An extragradient method for equilibrium problems and fixed point problems of an asymptotically nonexpansive mapping in CAT(0) spaces. J. Nonlinear Convex Anal.; 2022; 23, pp. 1509-1523.
7. Khammahawong, K.; Kumam, P.; Chaipunya, P. Splitting algorithms of common solutions between equilibrium and inclusion problems on Hadamard manifolds. Linear Nonlinear Anal.; 2020; 6, pp. 227-243.
8. Zhao, T.Y.; Wang, D.Q.; Ceng, L.C.; He, L.; Wang, C.Y.; Fan, H.L. Quasi-inertial Tseng’s extragradient algorithms for pseudomonotone variational inequalities and fixed point problems of quasi-nonexpansive operators. Numer. Funct. Anal. Optim.; 2020; 42, pp. 69-90. [DOI: https://dx.doi.org/10.1080/01630563.2020.1867866]
9. Ceng, L.C.; Postolache, M.; Yao, Y. Iterative algorithms for a system of variational inclusions in Banach spaces. Symmetry; 2019; 11, 811. [DOI: https://dx.doi.org/10.3390/sym11060811]
10. Chang, S.S.; Lee, H.W.J.; Chan, C.K. A new method for solving equilibrium problem fixed point problem and variational inequality problem with application to optimization. Nonlinear Anal.; 2009; 70, pp. 3307-3319. [DOI: https://dx.doi.org/10.1016/j.na.2008.04.035]
11. Mohammadi, M.; Eskandani, G.Z. A strong convergence theorem for quasi-equilibrium problems in Banach spaces. Acta Math. Sci. Ser. B (Engl. Ed.); 2022; 42, pp. 221-232. [DOI: https://dx.doi.org/10.1007/s10473-022-0112-1]
12. Eskandani, G.Z.; Raeisi, M. An iterative explicit algorithm for solving equilibrium problems in Banach spaces. Bull. Malays. Math. Sci. Soc.; 2021; 44, pp. 4299-4321. [DOI: https://dx.doi.org/10.1007/s40840-021-01168-x]
13. Ceng, L.C.; Postolache, M.; Wen, C.F.; Yao, Y. Variational inequalities approaches to minimization problems with constraints of generalized mixed equilibria and variational inclusions. Mathematics; 2019; 7, 270. [DOI: https://dx.doi.org/10.3390/math7030270]
14. Ceng, L.C.; Köbis, E.; Zhao, X. On general implicit hybrid iteration method for triple hierarchical variational inequalities with hierarchical variational inequality constraints. Optimization; 2020; 69, pp. 1961-1986. [DOI: https://dx.doi.org/10.1080/02331934.2019.1703978]
15. Mohammadi, M.; Eskandani, G.Z. Approximation solutions of quasi-equilibrium problems in Banach spaces. Miskolc Math. Notes; 2020; 21, pp. 261-272. [DOI: https://dx.doi.org/10.18514/MMN.2020.3077]
16. Li, C.; López, G.; Martín-Márquez, V. Iterative algorithms for nonexpansive mappings on Hadamard manifolds. Taiwan. J. Math.; 2010; 14, pp. 541-559.
17. Moharami, R.; Eskandani, G.Z. An extragradient algorithm for solving equilibrium problem and zero point problem in Hadamard spaces. Rev. R. Acad. Cienc. Exactas Fís. Nat. Ser. A Mat. RACSAM; 2020; 114, 152. [DOI: https://dx.doi.org/10.1007/s13398-020-00885-5]
18. Xu, H.K.; Kim, T.H. Convergence of hybrid steepest-descent methods for variational inequalities. J. Optim. Theory Appl.; 2003; 119, pp. 185-201. [DOI: https://dx.doi.org/10.1023/B:JOTA.0000005048.79379.b6]
19. Colao, V.; López, G.; Marino, G.; Martín-Márquez, V. Equilibrium problems in Hadamard manifolds. J. Math. Anal. Appl.; 2012; 388, pp. 61-71. [DOI: https://dx.doi.org/10.1016/j.jmaa.2011.11.001]
20. Wang, X.; López, G.; Li, C.; Yao, J.C. Equilibrium problems on Riemannian manifolds with applications. J. Math. Anal. Appl.; 2019; 473, pp. 866-891. [DOI: https://dx.doi.org/10.1016/j.jmaa.2018.12.073]
21. Ansari, Q.H.; Babu, F.; Li, X. Variational inclusion problems in Hadamard manifolds. J. Nonlinear Convex Anal.; 2018; 19, pp. 219-237.
22. 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, pp. 621-653. [DOI: https://dx.doi.org/10.1080/01630563.2018.1553887]
23. 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. Optim.; 2021; 42, pp. 567-582. [DOI: https://dx.doi.org/10.1080/01630563.2021.1895835]
24. Sakai, T. Riemannian Geometry (Translations of Mathematical Monographs); American Mathematical Society: Providence, RI, USA, 1996; Volume 149.
25. Ceng, L.C.; Li, X.; Qin, X. Parallel proximal point methods for systems of vector optimization problems on Hadamard manifolds without convexity. Optimization; 2020; 69, pp. 357-383. [DOI: https://dx.doi.org/10.1080/02331934.2019.1625354]
26. Ferreira, O.P.; Oliveira, P.R. Proximal point algorithm on Riemannian manifolds. Optimization; 2002; 51, pp. 257-270. [DOI: https://dx.doi.org/10.1080/02331930290019413]
27. Li, C.; López, G.; Martín-Márquez, V.; Wang, J.H. Resolvents of set-valued monotone vector fields in Hadamard manifolds. Set-Valued Anal.; 2011; 19, pp. 361-383. [DOI: https://dx.doi.org/10.1007/s11228-010-0169-1]
28. Neto, J.X.d.; Ferreira, O.P.; Pérez, L.R.L. Monotone point-to-set vector fields. Balk. J. Geom. Appl.; 2000; 5, pp. 69-79.
29. Beck, A.; Teboulle, M. A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci.; 2009; 2, pp. 183-202. [DOI: https://dx.doi.org/10.1137/080716542]
30. Chang, S.S.; Wen, C.F.; Yao, J.C. Common zero point for a finite family of inclusion problems of accretive mappings in Banach spaces. Optimization; 2018; 67, pp. 1183-1196. [DOI: https://dx.doi.org/10.1080/02331934.2018.1470176]
31. Cruz, J.Y.B. On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions. Set-Valued Var. Anal.; 2017; 25, pp. 245-263. [DOI: https://dx.doi.org/10.1007/s11228-016-0376-5]
32. Zhao, X.; Ng, K.F.; Li, C.; Yao, J.C. Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems. Appl. Math. Optim.; 2018; 78, pp. 613-641. [DOI: https://dx.doi.org/10.1007/s00245-017-9417-1]
33. Li, C.; López, G.; Martín-Márquez, V. Monotone vector fields and the proximal point algorithm on Hadamard manifolds. J. Lond. Math. Soc.; 2009; 79, pp. 663-683. [DOI: https://dx.doi.org/10.1112/jlms/jdn087]
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer
© 2025 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/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Abstract
In this paper, we introduce a triple Mann iteration method for approximating an element in the set of common solutions of a system of quasivariational inclusion issues, which is an equilibrium problem and a common fixed point problem (CFPP) of finitely many quasi-nonexpansive operators on a Hadamard manifold. Through some suitable assumptions, we prove that the sequence constructed in the suggested algorithm is convergent to an element in the set of common solutions. Finally, making use of the main result, we deal with the minimizing problem with a CFPP constraint and saddle point problem with a CFPP constraint on a Hadamard manifold, respectively.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer
Details

1 Department of Mathematics, Shanghai Normal University, Shanghai 200234, China;
2 Research Center for Interneural Computing, China Medical University Hospital, China Medical University, Taichung 404327, Taiwan; Academy of Romanian Scientists, 50044 Bucharest, Romania