Abstract
The aim of this article is to study two efficient parallel algorithms for obtaining a solution to a system of monotone variational inequalities (SVI) on Hadamard manifolds. The parallel algorithms are inspired by Tseng’s extragradient techniques with new step sizes, which are established without the knowledge of the Lipschitz constants of the operators and line-search. Under the monotonicity assumptions regarding the underlying vector fields, one proves that the sequences generated by the methods converge to a solution of the monotone SVI whenever it exists.
1. Introduction
Given an operator and a convex and closed subset C in a real Hilbert space H, the well known variational inequality problem (VIP) indicates the one of finding a point such that
It is well known that the variational inequality theory has been playing a big role in the study of signal processing, image reconstruction, mathematical programming, differential equations, and others; see, e.g., [,,,,]. A large number of numerical methods has been designed for solving the VIPs and related optimization problems; see, e.g., [,,,,]. With the help of an additional projection operator, Korpelevich [] first introduced
where stands for the identity, is a real number in , where L is the Lipschitz module of A, and stands for the nearest point projection operator onto subset C. Recently, the gradient (reduced) type iterative schemes are under the spotlight of engineers and mathematicians working in the communities of control theory and optimization. Based on the approach, a number of investigators have conducted various approaches on algorithms; see e.g., [,,,,,,] and the references cited therein.
Let both and be single-valued self-operators on space H. Recently, Ceng et al. [] considered and studied the following system problem of finding such that
with two positive constants and , which is called a system of variational inequalities (SVI). In [], system problem (3) was transformed into a fixed-point problem (FPP). Utilizing the equivalence relation between system problem (3) and the FPP of some operator, Ceng et al. [] proposed and investigated a relaxed type method for solving system problem (3); see also [,,,,,] for recent investigations.
On the other hand, in 2003, Németh [] introduced the VIP on Hadamard manifolds, that is, find such that
where C is a nonempty, convex and closed set in Hadamard manifold , is a vector field, that is, , and is the inverse of an exponential map. We denote by S the solution set of problem (4). Recently, some methods and techniques have been generalized from Euclidean spaces to Riemannian manifolds because the generalization has some important advantages; see, e.g., [,,]. It is well known that the research progress on the problem (4) is limited by the nonlinearity of manifolds, and hence is slow. Moreover, the research on its algorithms is mainly focused on the proximal point algorithm and Korpelevich’s method. Very recently, using Tseng’s extragradient methods, Chen et al. [] constructed two effective algorithms to solve the problem (4) on Hadamard manifolds. Moreover, their results gave a further answer to the open question put forth in Ferreira et al. [].
Inspired by problems (3) and (4), this paper introduces and considers the SVI on Hadamard manifolds, that is, find such that
with constants , If and , then SVI (5) reduces to VIP (4).
Inspired by the extragradient algorithms in Chen et al. [], we propose and analyze two parallel effective algorithms for solving SVI (5), by virtue of Tseng’s extragradient method. The first algorithm’s step sizes are obtained by using line-search, and the second one only by using two previous iterates. In both algorithms, the Lipschitz constants are not required to be known. Moreover, our results improve and extend the corresponding results announced by some others, e.g., Ceng et al. [] and Chen et al. [].
The outline of the work is organized as follows. Some basic concepts, notations and important lemmas in Riemannian geometry are presented in Section 2. In Section 3, we present two algorithms based on the Tseng’s extragradient method for SVI (5) on Hadamard manifolds and obtain the desired convergence theorems.
2. Preliminaries
This paper assumes that the Riemannian manifold indicates a connected m-dimensional manifold endowed with a Riemannian metric. We use the same notations in []. For more details about these notations and relevant definitions, please consult relevant textbook on Riemannian geometry (see, e.g., []).
Definition 1.
(see []). Let be contain all univalued vector fields such that and the domain of V be defined by . Let . Then V is said to be pseudomonotone if, for any ,
Proposition 1.
(see []). (Comparison theorem for triangles). Let be a geodesic triangle. Denote, for each , by the geodesic joining to , and set , and . Then
- (i)
- ;
- (ii)
- ;
- (iii)
- .
In terms of the distance and the exponential map, the above inequality can be rewritten as
since
Lemma 1.
(see []). Let and with . Then the following assertions hold.
- (i)
- For any , we have and ;
- (ii)
- If and , then ;
- (iii)
- Given and , if and , then ;
- (iv)
- For any , the function , defined by is continuous on .
Lemma 2.
(see []). Given , there exists a unique projection . Furthermore, the following inequality holds:
Proposition 2.
(see []). The following statements are equivalent:
- (i)
- is a solution of problem (4);
- (ii)
- for some ;
- (iii)
- for all ;
- (iv)
- , where .
Lemma 3.
(see []). Let be a geodesic triangle in Hadamard manifold. Then, there exists such that
Lemma 4.
(see []). Let be a geodesic triangle in a Hadamard manifold and be its comparison triangle.
- (i)
- If (resp., ) be the angles of (resp., ) at the vertices (resp., ). Then, the following inequalities hold:
- (ii)
- If z is a point in the geodesic joining p to q and is its comparison point in the interval such that and , then the following inequality holds:
Definition 2.
A vector field f defined on a complete Riemannian manifold is said to be Lipschitz continuous if there exists a constant such that
Besides this global concept, if for each , there exist and such that inequality (7) occurs, with , for all , then f is said to be locally Lipschitz continuous.
Finally, utilizing a similar technique to that of transforming SVI (3) into the FPP in [], we derive the following result.
Lemma 5.
A pair , with , is a solution of SVI (5) if and only if , i.e., where is the fixed-point set of the mapping and .
Proof.
In terms of Lemma 2, we obtain that
That is, . □
3. Main Results
In this section, inspired by the extragradient algorithms in Chen et al. [], we propose the following Algorithms 1 and 2 for solving the system (5) of monotone variational inequalities on Hadamard manifolds, which are based on Tseng’s extragradient method. The Algorithm 1 presents a simple and convenient way with the line-search for defining the step sizes. Meantime, in the Algorithm 3, the step sizes are computed by current information for the iterates, instead of requiring the knowledge of the Lipchitz constants of operators and additional projections. In particular, if we set in Algorithms 1 and 3, these algorithms are reduced to the following Algorithms 2 and 4, respectively, for solving the monotone VIP (4) on Hadamard manifolds. Let assume the following:
(H1) , where is the set of solutions of SVI (5).
(H2) For , is a vector field, that is, , and is the inverse of exponential map.
(H3) For , the mapping is monotone, i.e.,
(H4) For , the mapping is Lipschitz-continuous with constant , i.e., there exists such that
We first recall the concept of Fejér convergence and its related result.
Definition 3.
(see []). Let X be a complete metric space and be a nonempty set. A sequence is called Fejér convergent to C, if .
Proposition 3.
(see []). Let X be a complete metric space and let be a nonempty set. Let be Fejér convergent to C and suppose that any cluster point of lies in C. Then converges to a point of C.
3.1. Parallel Tseng’s Extragradient Method with Line-Search
From the Lemma 5, we can obtain the following Algorithm 1. In particular, putting in the Algorithm 1, we can solve VIP (4).
| Algorithm 1: Parallel Tseng’s extragradient method with line-search. |
| Initialization: Given for . Let . Iterative Steps: Step 1. Calculate |
Algorithm 1 is well defined in the following lemma.
Lemma 6.
The Armijo-like search rule (ALSR) is well defined and for .
Proof.
Since is -Lipschitz continuous on for , we have
which is equivalent to
Thus, (ALSR) holds for all . So is well defined for .
Obviously, for . If then this lemma is valid; otherwise, if by the search rule (ALSR), we know that must violate inequality (ALSR), i.e.,
Again from -Lipschitz continuity of on , we obtain . □
Corollary 1.
The Armijo-like search rule (ALSR) with is well defined and for .
Now, we analyze the convergence of Algorithm 1.
Lemma 7.
Let and be the iterative sequences constructed via Algorithm 1. Then both and are bounded iterative sequences, provided for all and ,
Proof.
Take a fixed arbitrarily. Then, noticing
we deduce from Lemma 2 that
and hence
Also, from the monotonicity of on it follows that
We now fix . Consider the geodesic triangle and its comparison triangle . Then by Lemma 3, we have , and . Recall that . The comparison point of is . By Lemma 4, we have
In the geodesic triangle and its comparison triangle . Using Lemma 3 again, we have . From (11), we obtain
Consider the geodesic triangle and its comparison triangle . Then set and , ( resp., and ). Let and denote the angles at c and , respectively. Then by Lemma 4 (i), we have and so . Then by Proposition 1 and Lemma 3, we have
It is easy to see that
Due to (12) and (13), it follows that
From (9), (10) and (14), we have
According to (ALSR) and (15), we obtain
In a similar way,
Next, we restrict . Then, substituting (16) for (17) with sends us to
This together with the hypotheses, implies that . So the sequence is bounded. In the same way, substituting (17) for (16) with and implies
This together with the hypotheses, implies that . So the sequence is bounded. □
Corollary 2.
Let and be the iterative sequences constructed via Algorithm 1 with . Then both and are bounded.
Proof.
Take a fixed arbitrarily. Noticing , we obtain from (16) and (17)
i.e., and . So the sequences and are bounded. Also, noticing in Algorithm 2, we have
and so and . So the sequences and are bounded. Note that
Since is -Lipschitz continuous for , we conclude that and . □
| Algorithm 2: Parallel Tseng’s extragradient method with line-search. |
| Initialization: Given for . Let . Iterative Steps: Step 1. Calculate |
Theorem 1.
Let and be the iterative sequences constructed via Algorithm 1. Assume that the hypotheses in Lemma 7 hold. Then is convergent to a solution of SVI (5) provided and as .
Proof.
First of all, by Lemma 7, we know that and are bounded, and
Utilizing the assumption that and as , we obtain that and are bounded. We define the sets as follows:
From Definition 2, we know that and are Fejér convergent to and , respectively. Let be an accumulation point of . Then ∃ such that . Since and all are bounded, we may assume, without loss of generality, that and as . Since and as , we deduce that and . Note that
Hence by Lemma 2, we get
and
By Lemma 6 we have for . Passing to the limit, and combining (6) with (18) and (19), respectively, we get
Consequently,
This means that , and hance . So it follows from Proposition 3 that as .
On the other hand, suppose that is an accumulation point of . Then ∃ such that . Since and all are bounded, we may assume, without loss of generality, that and as . Since and as , we deduce that and . Note that
Similar ideas to (20) give
This means that , and hance . By Proposition 3, we get as . Therefore, in terms of the uniqueness of the limit, we have converges to to the SVI (5). This completes the proof. □
Theorem 2.
Let and be the iterative sequences constructed via Algorithm 2. Then and both are convergent to a solution of VIP (4).
Proof.
By Corollary 2 and Definition 2, we know that and both are Fejér convergent to the same S. Let be an accumulation point of . Then ∃ such that . Hence, from we get . Since is bounded, we may assume, without loss of generality, that . So it follows from that . In terms of Proposition 2, we get . Thus, by Proposition 3 we infer that as . In a similar way, we can show that as for some . Since and , we derive the desired result. □
3.2. Parallel Tseng’s Extragradient Method
To solve problem (5), we give the following Algorithm 3, that is, a parallel Tseng’s extragradient algorithm. The step sizes in this algorithm are obtained by simple updating, rather than using the line-search, which results in a lower computational cost.
| Algorithm 3: Parallel Tseng’s extragradient method. |
| Initialization. Given for , and an arbitrary starting point. Iterative Steps: Step 1. Compute |
In particular, putting in Algorithm 3, we obtain the following Algorithm 4, that is, a parallel Tseng’s extragradient method for solving VIP (4).
| Algorithm 4: Parallel Tseng’s extragradient method. |
| Initialization. Given for , and an arbitrary starting point. Iterative Steps: Step 1. Compute |
Lemma 8.
For , the sequence constructed via Algorithm 3 is monotonically decreasing with lower bound .
Proof.
Obviously, the sequence is monotonically decreasing for . Note that is a Lipschitz continuous mapping with constant for . Then, in the case of , we have
Thus, the sequence has the lower bound . In a similar way, we can show that has the lower bound . □
Corollary 3.
For , the sequence constructed via Algorithm 4 is monotonically decreasing with lower bound .
Lemma 9.
Let and be the iterative sequences constructed via Algorithm 3. Then both and are bounded, provided for all and ,
Proof.
Similar to the proof of Lemma 7, we get
Then from (23), we have
Since , by Lemma 2, we have
that is,
Combining (24), (25) and (22) yields
Also, from the monotonicity of on it follows that
From (26) and (27), we obtain
In a similar way, we get
Next, we restrict . Then, substituting (28) for (29) with , we have
This together with the hypotheses, implies that . So the sequence is bounded. In the same way, substituting (29) for (28) with and , we have
This together with the hypotheses, implies that . So the sequence is bounded. □
Corollary 4.
Let and be constructed via Algorithm 4. Then and are bounded.
Proof.
Take a fixed arbitrarily. Noticing , we deduce from (28) and (29) that
Since for , we know that there exists such that for . This implies that and . So the sequences and are bounded. It can be seen that and . Hence and are bounded. Note that
Since is -Lipschitz continuous for , we conclude that and . □
Theorem 3.
Let and be constructed via Algorithm 3. Assume that the hypotheses in Lemma 9 hold. Then is convergent to a solution of SVI (5) provided and as .
Proof.
First of all, by Lemma 8, the limit of exists for . We denote , then for . By Lemma 9 and are bounded, and
By assumption that and as , we obtain that and are bounded. Define the sets as follows:
From Definition 2, we know that and are Fejér convergent to and , respectively. Then ∃ such that . Since is bounded, we may assume, without loss of generality, that . Meantime, it is clear that and as . Since and as , we deduce that and . Note that
Letting and using Lemma 1 and Lipschitz continuity of , we obtain
Thus, . By Lemma 5 we get , and hence . By Proposition 3, as .
On the other hand, suppose that is an accumulation point of . Then , where is some subsequence. Since is a bounded iterative sequence, we may suppose . Meantime, it is clear that and as . Since and as , we deduce that and . Note that
Letting and using Lemma 1 and Lipschitz continuity of reaches
Thus, . By Lemma 5 we get , and hance . By Proposition 3, as . Therefore, in terms of the uniqueness of the limit, we infer that to the SVI (5). □
Theorem 4.
Assume that and are constructed via Algorithm 4. Then and both are convergent to a solution of VIP (4).
Proof.
By Corollary 4 and Definition 2, one knows that and both are Fejér convergent to the same S. Let be an accumulation point of . Thus, ∃ such that . Hence, from we get . Since , we have . So it follows from that . In terms of Proposition 2, we get . Thus, by Proposition 3 we infer that as . Similarly, one can obtain as for some . Since and , we derive the desired result. □
4. Concluding Remark
In this paper, we focused to systems of variational inequalities on Hadamard manifolds and present two algorithms to deal with it under the monotonicity assumption on the underlying vector fields. We considered two strategies for obtaining step sizes. The second has many advantages; simple structure, low computational cost and no requiring extra projection. To design more effective methods for the problem (5) on Hadamard manifolds, we will consider the geometric structure of manifolds and some numerical implementations in the future. Since every complete and connected Riemannian manifold is a geodesic metric space (see, e.g., []), our results can be obtained in geodesic spaces.
Author Contributions
All the authors contributed equally to this work. All authors have read and agreed to the published version of the manuscript.
Funding
This research was partially supported by the National Natural Science Foundation of China(11671365), Innovation Program of Shanghai Municipal Education Commission (15ZZ068), Ph.D. Program Foundation of Ministry of Education of China (20123127110002), and Program for Outstanding Academic Leaders in Shanghai City (15XD1503100).
Conflicts of Interest
The authors declare no conflict of interest.
References
- Zhao, X. Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems. Appl. Math. Optim. 2018, 78, 613–641. [Google Scholar] [CrossRef]
- An, N.T. Solving k-center problems involving sets based on optimization techniques. J. Glob. Optim. 2019. [Google Scholar] [CrossRef]
- Kobis, E.; Kobis, M.A.; Qin, X. Nonlinear separation approach to inverse variational inequalities in real linear spaces. J. Optim. Theory Appl. 2019, 183, 105–121. [Google Scholar] [CrossRef]
- Ceng, L.C.; Yuan, Q. Composite inertial subgradient extragradient methods for variational inequalities and fixed point problems. J. Inequal. Appl. 2019, 2019, 374. [Google Scholar] [CrossRef]
- Ceng, L.C.; Shang, M. Generalized Mann viscosity implicit rules for solving systems of variational inequalities with constraints of variational inclusions and fixed point problems. Mathematics 2019, 7, 933. [Google Scholar] [CrossRef]
- Cho, S.Y. Generalized mixed equilibrium and fixed point problems in a Banach space. J. Nonlinear Sci. Appl. 2016, 9, 1083–1092. [Google Scholar] [CrossRef]
- Qin, X.; An, N.T. Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets. Comput. Optim. Appl. 2019, 74, 821–850. [Google Scholar] [CrossRef]
- Ceng, L.C.; Petrusel, A.; Yao, J.C.; Yao, Y. Hybrid viscosity extragradient method for systems of variational inequalities, fixed points of nonexpansive mappings, zero points of accretive operators in Banach spaces. Fixed Point Theory 2018, 19, 487–502. [Google Scholar] [CrossRef]
- Ceng, L.C.; Petrusel, A.; Yao, J.C.; Yao, Y. Systems of variational inequalities with hierarchical variational inequality constraints for Lipschitzian pseudocontractions. Fixed Point Theory 2019, 20, 113–134. [Google Scholar] [CrossRef]
- Reich, S.; Sabach, S. Three strong convergence theorems regarding iterative methods for solving equilibrium problems in reflexive Banach spaces. Contemp. Math. 2012, 568, 225–240. [Google Scholar]
- Korpelevich, G.M. The extragradient method for finding saddle points and other problems. Matecon 1976, 12, 747–756. [Google Scholar]
- Qin, X.; Petrusel, A.; Yao, J.C. CQ iterative algorithms for fixed points of nonexpansive mappings and split feasibility problems in Hilbert spaces. J. Nonlinear Convex Anal. 2018, 19, 157–165. [Google Scholar]
- Cho, S.Y. Strong convergence analysis of a hybrid algorithm for nonlinear operators in a Banach space. J. Appl. Anal. Comput. 2018, 8, 19–31. [Google Scholar]
- Dehaish, B.A.B. Weak and strong convergence of algorithms for the sum of two accretive operators with applications. J. Nonlinear Convex Anal. 2015, 16, 1321–1336. [Google Scholar]
- Qin, X.; Yao, J.C. A viscosity iterative method for a split feasibility problem. J. Nonlinear Convex Anal. 2019, 20, 1497–1506. [Google Scholar]
- Takahahsi, W.; Yao, J.C. The split common fixed point problem for two finite families of nonlinear mappings in Hilbert spaces. J. Nonlinear Convex Anal. 2019, 20, 173–195. [Google Scholar]
- Takahashi, W.; Wen, C.F. The shrinking projection method for a finite family of demimetric mappings with variational inequality problems in a Hilbert space. Fixed Point Theory 2018, 19, 407–419. [Google Scholar] [CrossRef]
- Censor, Y.; Gibali, A.; Reich, S. The subgradient extragradient method for solving variational inequalities in Hilbert space. J. Optim. Theory Appl. 2011, 148, 318–335. [Google Scholar] [CrossRef]
- Ceng, L.C.; Wang, C.Y.; Yao, J.C. Strong convergence theorems by a relaxed extragradient method for a general system of variational inequalities. Math. Methods Oper. Res. 2008, 67, 375–390. [Google Scholar] [CrossRef]
- Qin, X.; Cho, S.Y.; Yao, J.C. Weak and strong convergence of splitting algorithms in Banach spaces. Optimization 2019, 1–25. [Google Scholar] [CrossRef]
- Cho, S.Y.; Kang, S.M. Approximation of common solutions of variational inequalities via strict pseudocontractions. Acta Math. Sci. 2012, 32, 1607–1618. [Google Scholar] [CrossRef]
- Shehu, Y. Hybrid iterative scheme for fixed point problem, infinite systems of equilibrium and variational inequality problems. Comput. Math. Appl. 2012, 63, 1089–1103. [Google Scholar] [CrossRef][Green Version]
- Chang, S.S.; Wen, C.F.; Yao, J.C. Zero point problem of accretive operators in Banach spaces. Bull. Malays. Math. Sci. Soc. 2019, 42, 105–118. [Google Scholar] [CrossRef]
- Censor, Y.; Gibali, A.; Reich, S.; Sabach, S. Common solutions to variational inequalities. Set-Valued Var. Anal. 2012, 20, 229–247. [Google Scholar] [CrossRef]
- Németh, S.Z. Variational inequalities on Hadamard manifolds. Nonlinear Anal. 2003, 52, 1491–1498. [Google Scholar] [CrossRef]
- Ceng, L.C.; Shang, M. Hybrid inertial subgradient extragradient methods for variational inequalities and fixed point problems involving asymptotically nonexpansive mappings. Optimization 2019. [Google Scholar] [CrossRef]
- Ansari, Q.H.; Babu, F. Regularization of proximal point algorithms in Hadamard manifolds. J. Fixed Point Theory Appl. 2019, 21, 25. [Google Scholar] [CrossRef]
- Li, X.; Huang, N.; Ansari, Q.H.; Yao, J.C. Convergence rate of descent method with new inexact line-search on Riemannian manifolds. J. Optim. Theory Appl. 2019, 180, 830–854. [Google Scholar] [CrossRef]
- Chen, J.F.; Liu, S.Y.; Chang, X.K. Modified Tseng’s extragradient methods for variational inequality on Hadamard manifolds. Appl. Anal. 2019. [Google Scholar] [CrossRef]
- Ferreira, O.P.; Lucambio Pérez, L.R.; Németh, S.Z. Singularities of monotone vector fields and an extragradient-type algorithm. J. Glob. Optim. 2005, 31, 133–151. [Google Scholar] [CrossRef]
- Sakai, T. Riemannian Geometry, Vol. 149 in Translations of Mathematical Monographs; American Mathematical Society: Providence, RI, USA, 1996. [Google Scholar]
- Tang, G.J.; Huang, N.J. Korpelevich’s method for variational inequality problems on Hadamard manifolds. J. Glob. Optim. 2012, 54, 493–509. [Google Scholar] [CrossRef]
- Li, C.; López, L.; Martín-Márquez, V. Monotone vector fields and the proximal point algorithm on Hadamard manifolds. J. Lond. Math. Soc. 2009, 79, 663–683. [Google Scholar] [CrossRef]
- Wang, J.; López, G.; Martín-Márquez, V.; Li, C. Monotone and accretive vector fields on Riemannian manifolds. J. Optim. Theory Appl. 2010, 146, 691–708. [Google Scholar] [CrossRef]
- Reich, S. Strong convergence theorems for resolvents of accretive operators in Banach spaces. J. Math. Anal. Appl. 1980, 75, 287–292. [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]
- Ferreira, O.P.; Oliveira, P.R. Proximal point algorithm on Riemannian manifolds. Optimization 2002, 51, 257–270. [Google Scholar] [CrossRef]
- Bridson, M.R.; Haeiger, A. Metric Spaces of Non-positive Curvature; Springer: Berlin/Heidelberg, Germany, 2013; Volume 319. [Google Scholar]
© 2019 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 (http://creativecommons.org/licenses/by/4.0/).