Next Article in Journal
Relationship between Body Composition Asymmetry and Specific Performance in Taekwondo Athletes: A Cross-Sectional Study
Previous Article in Journal
Dynamics of Particles with Electric Charge and Magnetic Dipole Moment near Schwarzschild-MOG Black Hole
Previous Article in Special Issue
Two Forms for Maclaurin Power Series Expansion of Logarithmic Expression Involving Tangent Function
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

New Convergence Theorems for Pseudomonotone Variational Inequality on Hadamard Manifolds

1
College of Statistics and Mathematics, Yunnan University of Finance and Economics, Kunming 650221, China
2
College of Public Foundation, Yunnan Open University, Kunming 650500, China
3
Yunnan Key Laboratory of Service Computing, Yunnan University of Finance and Economics, Kunming 650221, China
4
Institute of Intelligence Applications, Yunnan University of Finance and Economics, Kunming 650221, China
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Symmetry 2023, 15(11), 2085; https://doi.org/10.3390/sym15112085
Submission received: 10 October 2023 / Revised: 7 November 2023 / Accepted: 16 November 2023 / Published: 19 November 2023

Abstract

:
In this paper, we propose an efficient viscosity type subgradient extragradient algorithm for solving pseudomonotone variational inequality on Hadamard manifolds which is of symmetrical characteristic. Under suitable conditions, we obtain the convergence of the iteration sequence generated by the proposed algorithm to a solution of a pseudomonotone variational inequality on Hadamard manifolds. We also employ our main result to solve a constrained convex minimization problem and present a numerical experiment to illustrate the asymptotic behavior of the algorithm. Our results develop and improve some recent results.

1. Introduction

Let C be a non-empty closed and convex subset of a real Hilbert space H with inner product · , · and A be an operator from C to H . The variational inequality problem (in short, VIP) is to find a point x C such that
A ( x ) , x y 0 , y C .
VIP is an important problem of nonlinear analysis fields since many problems appear in these fields, such as the optimization problem, equilibrium and complementarity problem, and so on [1,2,3,4,5,6,7,8,9,10,11]. These may be translated into variational inequality problems. So, some researchers have focused on how to obtain the approximate solutions of the VIP (1) in the spaces with linear constructure and symmetrical characteristic, and have also proposed various iterative methods; see, for example, ref. [12,13,14,15,16,17,18] and the reference therein.
In the last decade, many problems occurring in the field of nonlinear analysis have been extended from the spaces with linear structure and symmetry to the symmetric Hadamard manifolds without linear structure. The main advantages of these extensions are that non- convex problems and constrained problems in spaces with linear structure and symmetry may be transformed into convex problems and unconstrained problems on Hadamard manifolds without linear structure, respectively. So, many nonlinear problems on symmetric Hadamard manifolds have been attracted and studied by some authors, see for example [19,20,21,22,23,24,25,26,27,28,29] and the reference therein.
The following VIP on Hadamard manifolds was first considered by Németh [30] in 2003:
find x C s . t . A ( x ) , exp x 1 y 0 ,   y C .
The author studied the existence of the solution for VIP (2) and provided a necessary and sufficient condition for a solution of an optimization problem in terms of VIP (2) on Hadamard manifolds; here, C is a non-empty, closed, and geodesic convex subset of Hadamard manifold M , A is a vector field from C to TM , i.e., A ( x ) T x M for each x C , and exp 1 is the inverse of exponential map. The solution set of the VIP (2) is denoted by  Ω .
VIP (2) is an extension of VIP (1). In fact, the vector field A reduces to the operator A from C into R n and VIP (2) reduces to VIP (1) when M = R n .
In 2005, Ferreira et al. [31] proposed an extragradient-type algorithm to solve single-valued monotone variational inequality on Hadamard manifolds. In 2012, in order to weaken the monotone assumption, Tang et al. [32,33] introduced Korpelevich’s method and the projection-type method to solve a pseudomonotone VIP (2). Furthermore, for solving non-monotone VIP (2), Ye and He [34] proposed a double projection algorithm to solve a quasi-monotone variational inequality problem in R n . Recently, Ansaril and Babu [35] proposed an Armijos type extragradient algorithm method to solve VIP (2), which does not require the monotonicity of the objective vector field on Hadamard manifolds.
Motivated and inspired by the works of Shehu et al. [16], Thong et al. [18], Ansaril et al. [35], Chen et al. [36] and the research in this direction, we propose a viscosity type subgradient-like method to solve the pseudomonotone VIP (2) on Hadamard manifolds. Here, the vector field A is a Lipschitz continuous pseudomonotone operator, but the Lipschitz constant need not be known in advance. Under suitable conditions, we prove that the sequence generated by the proposed algorithm converges to a solution of pseudomonotone VIP (2) on Hadamard manifolds. We also give an application of our main result to a constrained convex minimization problem and a numerical experiment to illustrate the effectiveness and the asymptotical behavior of the algorithm proposed. It is worth noting that our results can be viewed as a generalization of the corresponding results in [16].

2. Preliminaries

Let M be a finite dimensional differentiable manifold and T p M be a tangent space of M at p M , TM = p M T p M be the tangent bundle of M . An inner product R p · , · on T p M is said to be a Riemannian metric on T p M . The norm induced by the inner product R p · , · on T p M is denoted by · p ; the subscript p is omitted. A differentiable manifold M with a Riemannian metric R · , · is called a Riemannian manifold. Let p , q M and γ : [ 0 , 1 ] M be a piecewise smooth curve connecting p with q (i.e., γ ( 0 ) = p and γ ( 1 ) = q ). The length of the curve γ is defined by L ( γ ) = 0 1 γ ( t ) d t , the Riemannian distance d ( p , q ) is the minimum length of all such curves connecting p with q . A Riemannian manifold M equipped with Riemannian distance d is a metric space ( M , d ) .
A Riemannian manifold M is complete if for every p M , all geodesics starting from p are defined for all t R . It has been shown in [37] that there exists only one minimal geodesic for any two points in M and ( M , d ) is complete metric space when M is complete. A complete simply connected Riemannian manifold of nonpositive sectional curvature is called a Hadamard manifold.
Suppose that M is a complete Riemannian manifold; then, the exponential map exp p : T p M M at p M is defined by
exp p v = γ v ( 1 , p ) ,   for   any   v T p M ,
where γ v ( · , p ) is the unique geodesic starting from p with velocity v. It is well known that the mapping exp p is diffeomorphism on T p M for any p M . The exponential mapping exp p owns the inverse exp p 1 : M T p M . Furthermore, for any p , q M , the equalities exp p 1 q = exp q 1 p = d ( p , q ) hold. See [37].
The parallel transport P γ , γ ( b ) , γ ( a ) : T γ ( a ) M T γ ( b ) M on the tangent bundle T M along γ : [ a , b ] M with respect to Riemannian connection ∇ is defined as:
P γ , γ ( b ) , γ ( a ) ( v ) = A ( γ ( b ) ) ,   a , b R   and   v T γ ( a ) M ,
where A is the unique vector field such that γ ( t ) A = 0 for all t [ a , b ] and A ( γ ( a ) ) = v . When γ is the minimal geodesic joining x to y , we write P y , x instead of P γ , y , x . Moreover, P y , x exp x 1 y = exp y 1 x . For further details, refer to [38]. Note that P y , x is an isometry from T x M to T y M . That is, the parallel transport preserves the inner product
P y , x ( u ) , P y , x ( v ) y = u , v x ,   u , v T x M .
Definition 1 
([33,39]). Let X ( M ) be a set of all single-valued vector fields A from M into T M satisfying A ( x ) T x M for each x M and D ( A ) be the domain of A , which is defined by D ( A ) = { x M : A ( x ) T x M } . A single-valued vector field A X ( M ) is said to be
(i)
Monotone if
A ( x ) , e x p x 1 y A ( y ) , e x p y 1 x ,   x , y M ;
(ii)
Pseudomonotone if
A ( x ) , exp x 1 y 0 A ( y ) , exp y 1 x 0 ,   x ,   y M ;
(iii)
Lipschitz continuous if there exists a constant L > 0 such that
P v , u A ( x ) A ( v ) L d ( u , v ) ,   u , v M .
Lemma 1 
([40]). If ( u , v , w ) is a geodesic triangle in a Hadamard manifold M , then there exist u ¯ , v ¯ , w ¯ R 2 such that
d ( u , v ) = u ¯ v ¯ , d ( v , w ) = v ¯ w ¯ , d ( w , u ) = w ¯ u ¯ .
The triangle Δ ( u ¯ , v ¯ , w ¯ ) is called a comparison triangle of geodesic-triangle ( u , v , w ) , which is unique up to the isometry of M .
Lemma 2 
([41]). Let ( u , v , w ) be a geodesic triangle in a Hadamard manifold M , ( u ¯ , v ¯ , r ¯ ) be a its comparison triangle.
(i)
Suppose that α , θ , β (resp., α ¯ , θ ¯ , β ¯ ) are the angles of Δ ( u , v , r ) (resp., Δ ( u ¯ , v ¯ , r ¯ ) at the vertices u , v , r (resp., u ¯ , v ¯ , r ¯ ) ; then, the following inequalities hold:
α α ¯ ,   θ θ ¯ ,   β β ¯ ;
(ii)
Suppose that z is a point on the geodesic connecting u with v and z ¯ is its comparison point in the interval [ u ¯ ,   v ¯ ] , if d ( z , u ) = z ¯ u ¯ and d ( z , v ) = z ¯ v ¯ ; then,
d ( z , w ) z ¯ w ¯ .
Lemma 3 
([37]). Let u 1 , u 2 , u 3 be a geodesic triangle in a Hadamard manifold. For each i = 1 , 2 , 3 ( mod 3 ) , γ i : 0 , l i M denotes the geodesic joining u i to u i + 1 , and set l i = L γ i , and θ i = γ i ( 0 ) , γ i 1 l i 1 . Then,
(i)
π θ 1 + θ 2 + θ 3 ;
(ii)
l i 1 2 l i 2 + l i + 1 2 2 l i l i + 1 cos θ i + 1 ;
(iii)
l i + 2 l i + 1 cos θ i + 2 + l i cos θ i .
As in [25], the above inequalities (i), (ii), (iii) can be rewritten in the form of the Riemann distance and the exponential map as follows:
d 2 u i , u i + 1 + d 2 u i + 1 , u i + 2 2 exp u i + 1 1 u i , exp u i + 1 1 u i + 2 d 2 u i 1 , u i ,
and
d 2 u i , u i + 1 exp u i 1 u i + 2 , exp u i 1 u i + 1 + exp u i + 1 1 u i + 2 , exp u i + 1 1 u i .
Since
exp u i + 1 1 u i , exp u i + 1 1 u i + 2 = d u i , u i + 1 d u i + 1 , u i + 2 cos θ i + 1 ,
in (5), let u i = u i + 2 ; we have
exp u i + 1 1 u i 2 = exp u i + 1 1 u i , exp u i + 1 1 u i = d 2 u i + 1 , u i .
Lemma 4 
([42]). Let M be a finite dimensional Hadamard manifold.
(i)
If γ : [ 0 , 1 ] M is a geodesic joining x to y , then,
d γ t 1 , γ t 2 = t 1 t 2 d ( x , y ) , t 1 , t 2 [ 0 , 1 ] ;
(ii)
For any x , y , z , u , w M and t [ 0 , 1 ] , the following inequalities hold:
d exp x ( 1 t ) exp x 1 y , z t d ( x , z ) + ( 1 t ) d ( y , z ) , d 2 exp x ( 1 t ) exp x 1 y , z t d 2 ( x , z ) + ( 1 t ) d 2 ( y , z ) t ( 1 t ) d 2 ( x , y ) , d exp x ( 1 t ) exp x 1 y , exp u ( 1 t ) exp u 1 w t d ( x , u ) + ( 1 t ) d ( y , w ) .
Lemma 5 
([41]). Suppose that x 0 , y 0 M and x n , y n M satisfying x n x 0 , y n y 0 ; then, the following results hold.
(i)
exp x n 1 y exp x 0 1 y ,   exp y 1 x n exp y 1 x 0   a n d   e x p x n 1 y n exp x 0 1 y 0 , for any y M , respectively;
(ii)
If v n is a sequence in T x n M and v n v 0 , then v 0 T x 0 M ;
(iii)
If the sequences u n and v n satisfy u n , v n T x n M , u n u 0 T x 0 M and v n v 0 T x 0 M , then
u n , v n u 0 , v 0 .
Let M be a Hadamard manifold. A subset C M is said to be geodesic convex if for any two points x and y in C , the geodesic joining x to y is contained in C , which means that γ ( x , y ; ( 1 t ) a + t b ) C for all t [ 0 , 1 ] , where γ ( x , y ; · ) : [ a , b ] M is a geodesic satisfing γ ( x , y , a ) = x and γ ( x , y , b ) = y .
Lemma 6 
([43]). Let M be a Riemannian manifold with constant curvature. For given x M and u T x M , the set
C x , u : = z M : exp x 1 z , u 0 ,
is geodesic convex.
A function f : C ( , ] is said to be geodesic convex if, for any geodesic γ ( x , y , λ ) ( 0 λ 1 ) joining x , y C , the function f γ is convex, that is,
f ( γ ( x , y , λ ) ) λ f ( γ ( x , y , 0 ) ) + ( 1 λ ) f ( γ ( x , y , 1 ) ) = λ f ( x ) + ( 1 λ ) f ( y ) .
Let C be a non-empty, closed, and geodesic convex subset of a Hadamard manifold M . The metric projection onto C , denoted by P C , is defined as
P C ( x ) = { p C : d ( x , p ) d ( x , q ) , q C } ,   x M .
Lemma 7 
([39]). Let C be a non-empty, closed geodesic convex subset of a Hadamard manifold M . Then, for any x M , P C ( x ) is a singleton, and the following inequality holds:
exp P C ( x ) 1 x , exp P C ( x ) 1 q 0 , q C .
Lemma 8 
([32]). Let C be a non-empty, closed, and geodesic convex subset of a Hadamard manifold M and A : C T M be a single-valued vector field. For each x C , the following statements are equivalent:
(i)
x is a solution of VIP (2);
(ii)
x = P C exp x ( λ A ( x ) ) for all λ > 0 ;
(iii)
r ( x , λ ) = 0 , where r ( x , λ ) is defined by r ( x , λ ) : = exp x 1 P C exp x ( λ A ( x ) ) .
Lemma 9 
([44]). Let a n be a sequence of nonnegative real numbers such that there exists a subsequence a n j of a n such that a n j < a n j + 1  for all j N . Then, there exists a nondecreasing sequence m k N such that lim k m k = and the following properties are satisfied by all (sufficiently large) number k N : a m k a m k + 1 and a k a m k + 1 . In fact, m k is the largest number n in the set { 1 , 2 , , k } such that a n < a n + 1 .
Lemma 10 
([45]). Let a n be a sequence of nonnegative real numbers satisfying the following inequality:
a n + 1 1 θ n a n + θ n σ n + γ n , n 1 .
If (i) θ n [ 0 , 1 ] ,   n = 1 θ n = ; (ii) lim sup n σ n 0 ; (iii) γ n 0 ,   n 0 ,   n = 1 γ n < , then a n 0 as n .

3. Main Results

In this section, we need to make the following assumptions before we propose our algorithm:
(C1) C is a non-empty closed geodesic convex subset of a finite dimensional Hadamard manifold M ;
(C2) Mapping A : C T M is a single valued vector field, that is, A ( x ) T x M for each x C ;
(C3) Vector field A is pseudomonotone and L-Lipschitz continuous on M ;
(C4) The solution set Ω of the VIP (2) is non-empty;
(C5) Mapping f : M M is a contraction mapping with constant ρ [ 0 , 1 ) .
Remark 1. 
It is worth noting that conditions (C1)–(C5) are popular assumptions both in Hadamard manifold and in Hilbert space. These conditions are applicable to problems from practical scenarios such as the linear equations due to image restorations and the Kojima–Shindo nonlinear complementary problem. For further real-world applications, refer to the complementary problems discussed in [46,47,48].
Lemma 11. 
The Armijo-like search rule (9) is well defined and
min γ , μ ξ L λ n γ ,   n 2
Proof. 
Since A is L-Lipschitz continuous on M , we obtain
P y n , x n A x n A y n L d x n , y n .
Due to L > 0 and μ ( 0 , 1 ) , we have μ L P y n , x n A x n A y n μ d x n , y n . Therefore, (9) holds for all λ μ / L , so λ n is well defined.
If λ n = γ , then this Lemma is proved; otherwise, if λ n < γ , we know by the search rule (9) that λ n / ξ does not satisfy the inequality (9), that is
P y n , x n A x n A y n = P y n , x n A x n A P C exp x n λ n ξ A x n > μ λ n / ξ d x n , P C exp x n λ n ξ A x n = μ λ n / ξ d x n , y n .
Consider that A is L-Lipschitz continuous on M , we have λ n > μ ξ / L . The proof is completed.    □
Theorem 1. 
Assume that the assumptions ( C 1 ) ( C 5 ) hold. If { α n } satisfies l i m n α n = 0 and n = 1 α n = , then the sequence { x n } generated by Algorithm 1 converges to a solution of pseudomonotone VIP (2).
Algorithm 1: Viscosity type subgradient extragradient algorithm on Hadamard manifolds
  • Initialization: Give 0 < γ < 1 ,   ξ ( 0 , 1 ) ,   μ ( 0 , 1 ) ; λ 1 > 0 , { α n } is a real sequence in ( 0 , 1 ) and x 1 M is arbitrarily chosen.
  •       Iterative Steps: Calculate x n + 1 as follows:
          Step 1. Compute
    y n = P C [ e x p x n ( λ n A x n ) ] ,
  •       If x n = y n , then stop and y n is a solution of pseudomontone VIP (2). Otherwise, go to Step   2 .
          Step 2. Compute λ n , which is chosen to be the largest λ { γ , γ ξ , γ ξ 2 , } satisfying
    λ P y n , x n A x n A y n μ d ( x n , y n ) .
  •       Step 3. Compute
    z n = P T n e x p x n ( λ n P x n , y n A y n ) ,
    where
    T n : = x C e x p y n 1 e x p x n ( λ n A x n ) , e x p y n 1 x 0 .
  •       Step 4. Compute
    x n + 1 = e x p z n α n e x p z n 1 f x n , n 1 .
    Set n : = n + 1 and go to Step 1.
Proof. 
Step 1. Now, we show that the sequences { x n } , { f ( x n ) } , { y n } and { z n } are bounded.
It follows from Lemma 5, Lemma 6, and the definition of T n that T n is closed and geodesic convex and T n C . Furthermore, by the pseudomonotonicity of A , we have Ω T n C .
Let p Ω T n C , u n = e x p x n ( λ n A y n ) ,   Δ x n , y n , p be a geodesic triangle, and Δ x n , y n , p be its comparison triangle. By Lemma 1, we obtain
d x n , p = x n p ,   d y n , p = y n p ,   d x n , y n = x n y n .
By (ii) of Lemma 2 and Lemma 7, we obtain
d 2 ( z n , p ) = d 2 ( P T n u n , p ) = P T n u n p 2 = P T n u n u n + u n p , P T n u n u n + u n p = u n p 2 + u n P T n u n 2 + 2 P T n u n u n , u n p ,
where
2 u n P T n u n 2 + 2 P T n u n u n , u n p = 2 u n P T n u n , p P T n u n 0 .
This implies that
u n P T n u n 2 + 2 P T n u n u n , u n p u n P T n u n 2 .
Substituting (15) into (13), from (6), we have
d 2 ( z n , p ) u n p 2 u n P T n u n 2   = x n λ n A y n p 2 x n λ n A y n z n 2   = x n p 2 + λ n A y n 2 2 x n p , λ n A y n λ n A y n 2 x n z n 2     2 x n z n , λ n A y n   = x n p 2 x n z n 2 + 2 λ n p z n , A y n   = x n p 2 x n y n + y n z n 2 + 2 λ n p z n , A y n   = x n p 2 x n y n 2 y n z n 2 2 x n y n , y n z n     + 2 λ n p z n , A y n   = x n p 2 x n y n 2 y n z n 2 + 2 x n y n , z n y n     + 2 λ n p z n , A y n   d 2 ( x n , p ) d 2 ( x n , y n ) d 2 ( y n , z n ) + 2 d ( x n , y n ) d ( z n , y n ) c o s θ     + 2 λ n A y n , e x p z n 1 p   d 2 ( x n , p ) d 2 ( x n , y n ) d 2 ( y n , z n ) + 2 e x p y n 1 x n , e x p y n 1 z n     + 2 λ n A y n , e x p z n 1 p .
Since p Ω and y n C , we have e x p p 1 y n , A p 0 . By the pseudomonotonicity of vector field A , from Definition 1, we obtain that A y n , e x p y n 1 p 0 . So,
A y n , e x p z n 1 p = A y n , e x p y n 1 p + A y n , e x p z n 1 y n   A y n , e x p z n 1 y n .
From (16) and (17), we obtain
d 2 ( z n , p )   d 2 ( x n , p ) d 2 ( x n , y n ) d 2 ( y n , z n ) + 2 e x p y n 1 x n , e x p y n 1 z n + 2 λ n A y n , e x p z n 1 y n   = d 2 ( x n , p ) d 2 ( x n , y n ) d 2 ( y n , z n ) + 2 e x p y n 1 e x p x n ( λ n A y n ) , e x p y n 1 z n .
By the definition of T n , we know
e x p y n 1 e x p x n ( λ n A y n ) , e x p y n 1 z n e x p y n 1 e x p x n ( λ n A x n ) , e x p y n 1 z n   + e x p λ n A y n 1 ( λ n A x n ) , e x p y n 1 z n   e x p λ n A y n 1 ( λ n A x n ) , e x p y n 1 z n .
It follows from Lemma 11, (6), (18), and (19) that
d 2 ( z n , p )   d 2 ( x n , p ) d 2 ( x n , y n ) d 2 ( y n , z n ) + 2 e x p λ n A y n 1 ( λ n A x n ) , e x p y n 1 z n   d 2 ( x n , p ) d 2 ( x n , y n ) d 2 ( y n , z n ) + 2 d ( λ n A x n , λ n A y n ) d ( y n , z n )   d 2 ( x n , p ) d 2 ( x n , y n ) d 2 ( y n , z n ) + λ n 2 ( d 2 ( A x n , A y n ) + d 2 ( y n , z n ) )   d 2 ( x n , p ) ( 1 γ 2 ) d 2 ( x n , y n ) ( 1 γ 2 ) d 2 ( z n , y n ) .
This implies that
d ( z n , p ) d ( x n , p ) .
So,
d ( x n + 1 , p ) = d ( e x p z n α n e x p z n 1 f x n , p )   α n d ( f x n , p ) + 1 α n d ( z n p )   α n d ( f x n , f p ) + α n d ( f p , p ) + 1 α n d ( z n , p )   α n ρ d ( x n , p ) + 1 α n d ( x n , p ) + α n d f p , p )   = 1 α n ( 1 ρ ) d ( x n , p ) + α n d ( f p , p )   = 1 α n ( 1 ρ ) d ( x n , p ) + α n ( 1 ρ ) d ( f p , p ) 1 ρ   max d ( x n , p ) , ( f p , p ) 1 ρ     max d ( x 1 , p ) , d ( f p , p ) 1 ρ ,
which means that { x n } is bounded. So, { y n } , { z n } { f ( x n ) } are also bounded.
Step 2. Next, we prove that for any p Ω , the following inequality holds.
1 α n ( 1 γ 2 ) d 2 ( x n , y n ) d 2 ( x n , p ) d 2 ( x n + 1 , p ) + α n d 2 f ( x n , p ) .
It follows from Lemma 4 and (20) that
d 2 ( x n + 1 , p ) = d 2 ( e x p z n α n e x p z n 1 f x n , p ) α n d 2 ( f x n , p ) + 1 α n d 2 ( z n , p ) α n 1 α n d 2 ( f x n , z n ) α n d 2 ( f x n , p ) + 1 α n [ d 2 ( x n , p ) ( 1 γ 2 ) d 2 ( x n , y n ) ( 1 γ 2 ) d 2 ( z n , y n ) ] α n 1 α n d 2 ( f x n , z n ) 1 α n d 2 ( x n , p ) + α n d 2 f ( x n , p ) 1 α n ( 1 γ 2 ) d 2 ( x n , y n ) 1 α n ( 1 γ 2 ) d 2 ( y n , z n ) .
This implies that
1 α n ( 1 γ 2 ) d 2 ( x n , y n ) d 2 ( x n , p ) d 2 ( x n + 1 , p ) + α n d 2 f ( x n , p ) .
Step 3. Finally, we show that { x n } converges to some point q Ω , where q = P Ω f ( q ) .
Let p Ω , Δ x n , y n , p be a geodesic triangle and Δ x n , y n , p be its comparison triangle. From (10), we know that the comparison point of x n + 1 is x n + 1 = ( 1 α n ) z n + α n f x n . It follows from Lemma 1 that
d 2 ( x n + 1 , p ) = x n + 1 p 2 = 1 α n z n p + α n f x n p 2 1 α n 2 z n p 2 + 2 α n f x n p , x n + 1 p 1 α n 2 x n p 2 + 2 α n f x n p , x n + 1 p = 1 α n 2 x n p 2 + 2 α n f x n f ( p ) , x n + 1 p   + 2 α n f ( p ) p , x n + 1 p 1 α n 2 x n p 2 + 2 α n ρ x n p x n + 1 p   + 2 α n f ( p ) p , x n + 1 p 1 α n 2 x n p 2 + α n ρ x n p 2 + x n + 1 p 2   + 2 α n f ( p ) p , x n + 1 p = 1 2 α n + α n ρ x n p 2 + α n 2 x n p 2 + α n ρ x n + 1 p 2   + 2 α n f ( p ) p , x n + 1 p 1 2 ( 1 ρ ) α n 1 α n ρ x n p 2 + 2 ( 1 ρ ) α n 1 α n ρ   × α n 2 ( 1 ρ ) x n p 2 + 1 1 ρ f ( p ) p , x n + 1 p ,
which implies that
d 2 ( x n + 1 , p ) 1 2 ( 1 ρ ) α n 1 α n ρ d 2 ( x n , p ) + 2 ( 1 ρ ) α n 1 α n ρ   × α n 2 ( 1 ρ ) d 2 ( x n , p ) + 1 1 ρ e x p p 1 f ( p ) , e x p p 1 x n + 1 .
The rest of the proof will be divided into two cases.
Case 1. Suppose that there exists n 0 N such that d ( x n , q ) n = n 0 is nonincreasing. Then, d ( x n , q ) n = 1 is convergent. It follows from (24) that
lim n d ( x n , y n ) = 0 .
Similarly, from (20), (21), and (27), we have
( 1 γ 2 ) d ( y n , z n ) d 2 ( x n , p ) d 2 ( z n , p ) ( 1 γ 2 ) d 2 ( x n , y n ) .
Hence,
lim n d ( y n , z n ) = 0 .
From Lemma 4 and (10), we have
d ( x n + 1 , z n ) α n d ( f x n , z n ) 0 , n .
So,
d ( x n + 1 , x n ) d ( x n + 1 , z n ) + d ( z n , y n ) + d ( y n , x n ) .
It follows from (27), (29), (30), and (31) that
lim n d ( x n + 1 , x n ) = 0 .
Since x n is bounded, there exists a subsequence x n j of { x n } such that x n j converges to some x * M . From Lemma 5, we have
lim   sup n e x p p 1 f ( p ) , e x p p 1 x n = lim j e x p p 1 f ( p ) , e x p p 1 x n j = e x p p 1 f ( p ) , e x p p 1 x * .
Now, we show that x * Ω . In fact, by (27) we know that { y n j } converges to x * C .
Since y n j = P C [ e x p x n j ( λ n A x n j ) ] , by Lemma 7, for all x C , we have
e x p y n j 1 e x p x n j ( λ n j A x n j ) , e x p y n j 1 x 0 .
By Lemma 3, the inequality above becomes
0 e x p y n j 1 e x p x n j ( λ n j A x n j ) , e x p y n j 1 x = e x p y n j 1 x n j , e x p y n j 1 x λ n j A x n j , e x p y n j 1 x e x p y n j 1 x n j , e x p y n j 1 x λ n j A x n j , e x p y n j 1 x n j λ n j A x n j , e x p x n j 1 x .
By Lemma 11, we know that λ n > 0 . It follows from Lemma 5 that
A x * , e x p x * 1 x 0 , x C .
So, we have x * Ω . Since q = P Ω f ( q ) Ω , from (33), we obtain
lim   sup n e x p q 1 f ( q ) , e x p q 1 x n   = lim j e x p q 1 f ( q ) , e x p q 1 x n j   = e x p q 1 f ( q ) , e x p q 1 x *   0 .
It follows from (32) that
lim   sup n e x p q 1 f ( q ) , e x p q 1 x n + 1 0 .
Since l i m n α n = 0 , n = 1 α n = , 0 ρ < 1 , and { x n } is bounded, it is obvious that l i m n 2 ( 1 ρ ) α n 1 α n ρ = 0 , n = 1 2 ( 1 ρ ) α n 1 α n ρ = , and lim   sup n [ α n 2 ( 1 ρ ) d 2 ( x n , q ) + 1 1 ρ e x p q 1 f ( q ) , e x p q 1 x n + 1 ] 0 . Due to the inequality (26) holding for any p Ω , it follows from Lemma 10, (26), and (35) that l i m n d ( x n , q ) = 0 , which implies that the sequence { x n } converges to q .
Case 2. Assume that { d ( x n , q ) } is not a monotonically decreasing sequence.
It follows from Lemma 9 that there exists a nondecreasing sequence { m k } of N such that l i m n m k = and the following inequalities hold for all k N :
d 2 ( x m k , q ) d 2 ( x m k + 1 , q ) and d 2 ( x k , q ) d 2 ( x m k , q ) .
From (24), we have
1 α m k ( 1 μ 2 ) d 2 ( x m k , y m k ) d 2 ( x m k , q ) d 2 ( x m k + 1 , q ) + α n d 2 f ( x m k , q ) .
So, we have
lim k d ( x m k , y m k ) = 0 .
Using the same arguments as in the proof of Case 1, we obtain
lim k d ( y m k , z m k ) = 0 ,
lim k d ( x m k + 1 , z m k ) = 0 ,
lim k d ( x m k + 1 , x m k ) = 0 ,
and
lim   sup n e x p q 1 f ( q ) , e x p q 1 x m k + 1 0 .
Since lim k α m k = 0 , there exists k 0 N such that 1 2 α n ( 1 ρ ) > 0 for all k k 0 . By Equation (25) we obtain
d 2 ( x m k + 1 , q ) 1 2 ( 1 ρ ) α m k 1 α m k ρ d 2 ( x m k , q ) + 2 ( 1 ρ ) α m k 1 α m k ρ     × α m k 2 ( 1 ρ ) d 2 ( x m k , q ) + 1 1 ρ e x p q 1 f ( q ) , e x p q 1 x m k + 1 .
Put β m k = 2 ( 1 ρ ) α m k 1 α m k ρ , from (37) and (44); we have
β m k d 2 ( x m k , q ) d 2 ( x m k , q ) d 2 ( x m k + 1 , q )     + β m k × α m k 2 ( 1 ρ ) d 2 ( x m k , q ) + 1 1 ρ e x p q 1 f ( q ) , e x p q 1 x m k + 1   β m k × α m k 2 ( 1 ρ ) d 2 ( x m k , q ) + 1 1 ρ e x p q 1 f ( q ) , e x p q 1 x m k + 1 .
Further,
d 2 ( x m k , q ) α m k 2 ( 1 ρ ) d 2 ( x m k , q ) + 1 1 ρ e x p q 1 f ( q ) , e x p q 1 x m k + 1 ,
which means that
lim   sup k   d 2 ( x m k , q ) lim   sup k [ α m k 2 ( 1 ρ ) d 2 ( x m k , q ) + 1 1 ρ e x p q 1 f ( q ) , e x p q 1 x m k + 1 ] .
Therefore,
lim k d ( x m k , q ) = 0 .
Meanwhile, it follows from (43), (45) and (47) that lim   sup k d ( x m k + 1 , q ) 0 . Hence,
lim k d ( x m k + 1 , q ) = 0 .
Further, from (37) we obtain
lim k d ( x k , q ) = 0 .
Hence, { x k } converges to q . The proof is completed.    □
If f ( x ) = u , for any x M , and u is a fixed vector in M , then Theorem 1 reduces to the following corollary.
Corollary 1. 
Assume that the assumptions ( C 1 ) ( C 4 ) hold, and { α n } ( 0 , 1 ) , l i m n α n = 0 , n = 1 α n = . Then, the sequence { x n } generated by Algorithm 1 with f : = u converges to a solution of VIP (2).
Remark 2. 
1.
The main results obtained in this paper extend the main results in [16] from monotone VIP (1) on Hilbert spaces to more general pseudomonotone VIP (2) on Hadamard manifolds.
2.
In the algorithms proposed in [49,50], they are needed to compute two projections on the closed convex set C at each iteration step, which may affect the efficiency of the algorithm. To avoid this shortcoming, we use an easy calculated projection to replace the second projection in the algorithms in [49,50].
3.
In Algorithm 1, it works without prior knowledge of the Lipschitzian constant of the mapping involved.
4.
The generalization was made from the Hilbert spaces with linear structure to the Hadamard manifolds with nonlinear structure. See [16,49,50].

4. Application to Constrained Convex Minimization Problem

The so-called constrained convex minimization problem is to find x C such that
g ( x ) = min y C g ( y ) ,
where C is a non-empty, closed, and geodesic convex subset of a Hadamard manifold M and g is a real-valued function from C to R ; the solution set of the convex minimization problem (51) is denoted by C M P ( g , C ) , that is,
C M P ( g , C ) = { x M : g ( x ) g ( y ) , y C } .
The gradient g of a differentiable real-valued function g : M R at x is defined by g ( x ) , u = g ( x , u ) , where M is a Hadamard manifold; g ( x , u ) is the directional derivative of g at x in the direction u T x M , which is defined as follows:
g ( x ; u ) : = lim   inf t 0 + g exp x t u g ( x ) t .
It is well known that g is a continuous vector field on M (see [37]).
Lemma 12 
([30]). Let C be a non-empty, closed, and geodesic convex subset of a Hadamard manifold M and g be a differentiable convex function from M to R . Then, p C M P ( g , C ) , if and only if p solves the VIP ( 2 ) with A = g .
When the vector field A g in Algorithm 1, the sequence generated by Algorithm 1 converges to a solution of the minimization problem (51). So, we obtain the following result.
Theorem 2. 
Assume that the assumptions C 1 C 5 hold, where A is the gradient g of a convex differentiable function g from C into R. If l i m n α n = 0 , n = 1 α n = , error ( g , C ) , and g is pseudomonotone and L-Lipschitz continuous, then the sequence x n generated by Algorithm 1 converges to a point p error ( g , C ) .
Next, we will give a simple practical optimization case.

Electronics Supply Chain Inventory Optimization

An electronics retailer anticipates the launch of a new smartphone. Based on market analysis and pre-order data, the anticipated retail demand for the first month is 10,000 units. The current inventory level in the warehouse is 5000 units. The warehouse has a maximum capacity of 20,000 units. Given these parameters, the retailer aims to determine the optimal inventory level to stock up for the product launch.
Based on this problem, Algorithm 1 reduces to the following.
Based on the Algorithm 2, the new inventory level should be x n + 1 units. We choose the residual error E n = | x n + 1 x n | . If the residual error E n 10 3 is met, we stop the iteration. Otherwise, we continue with the next step.
Algorithm 2: Iterative Inventory Optimization Algorithm
  • Initialization: Given initial inventory level, x 0 = 5000 units;
  • Anticipated retail demand, y 0 = 10 , 000 units.
  • Warehouse maximum capacity, = 20 , 000 units.
  • Decay factor, γ = 0.7 .
  • Adjustment factor, ξ = 0.8 .
  • Weight, α = 0.5 .
  •       Step 1.  d n to denote demand function, that is, d n = y 0 x n . Determine the desired inventory level:
    y n = x n + γ × d n .
  • Here, if x n = y n , then stop and take y n as the optimal inventory level. Otherwise, proceed to the next step.
  •       Step 2. Compute Adjustment Factor: λ n = γ .
  •       Step 3. Compute New Inventory Level:
    z n = x n + λ n × ( y 0 y n ) .
  •       Step 4. Update Inventory Level: x n + 1 = ( 1 α ) x n + α z n .
    Repeat: Set n : = n + 1 and return to Step 1.
In a word, the inventory levels at each iteration step are shown in Table 1. So, we can see that the residual error becomes smaller and smaller when the number of iterations increases, which indicates that the iteration scheme is convergent.

5. A Numerical Example

In this part, we provide a numerical example to illustrate the effectiveness and the convergence behavior of Algorithm 1. All codes were written with MATLAB 2020b computed on a Personal Computer (PC) Core i7.
Let R + + = { x R : x > 0 } and M : = R + + the set of positive real numbers and R + + , · , · the Riemannian manifold, and let T p M be the tangent space at p M , then
(i) the Riemannian metric · , · is defined by
x , y : = 1 p 2 x y , x , y T p M ,
(ii) (see [51]) The Riemann distance d : M × M R + is defined by
d ( x , y ) = ln x y ,   x , y M .
Furthermore, the unique geodesic c : R M with c ( 0 ) = x , u = c ( 0 ) T x M is defined by c ( t ) : = x e u t x . Thus
exp x t u = x e u t x .
(iii) The inverse exponential map is defined by
exp x 1 y = c ( 0 ) = x ln y x .
Example 1. 
Let C = [ 1 , + ) be a geodesic convex subset of R + and A : C R be a single-valued vector field defined by
A x = x ln x ,   x C .
Then, it is easy to see that A is pseudomonotone. Indeed, let x , y C and assume A ( x ) , exp x 1 y 0 , from (53), (56) and (57); we easily see that
A ( x ) , exp x 1 y = x ln x , x ln ( y / x ) = 1 / x 2 × x ln x × x ln ( y / x ) 0 ,
which implies that ln ( y / x ) 0 . Since
A y , exp y 1 x A y , exp y 1 x + A x , exp x 1 y = 1 y 2 × y ln y × y ln x y + 1 x 2 × x ln x × x ln y x = ( ln y ln x ) 2 0 .
So, A is pseudomonotone. Now, we prove that Ω . Assume that p Ω and q C , then
A p , exp p 1 q 1 p 2 ( p ln p ) · p · ln q p = ln p ln q p 0 ,   q C p = 1 ,
which implies that the solution of VIP (2) is 1.
Here, we choose f ( x ) = x 2 , A x = x ln x , γ = l = μ = 0.5 , and take two randomly initial points x 1 = 0.5 ,   x 1 = 8 . To show the effectiveness of Algorithm 1, we compare Algorithm 1 with the algorithm introduced in [36], which we named Algo*. In example 1, as x 1 = 0.5, the numbers of iteration of Algorithm 1 and Algo* are 23 and 28, respectively. As x 1 =8, the numbers of iteration of Algorithm 1 and Algo* are 297 and 350, respectively. We summarize the numerical experimental data in the Figure 1a–d, where Figure 1a,b illustrates the asymptotic behaviors of Algorithm 1 and Algo*. It can be seen that Algorithm 1 converges faster and owns better asymptotic behavior than Algo*. On the other hand, from Figure 1c,d, we may find that the residual error E n = x n + 1 x n of Algorithm 1 is less than the residual error E n of Algo*.

6. Conclusions

In this paper, we proposed an efficient viscosity type subgradient extragradient algorithm to solve pseudomonotone variational inequality on Hadamard manifolds which is of symmetrical characteristic. Notably, the vector field A is characterized as a Lipschitz continuous pseudomonotone operator, with the advantage that its Lipschitz constant need not be predetermined. Under appropriate conditions, we prove that the sequence generated by the Algorithm 1 converges to a solution of the pseudomonotone VIP on Hadamard manifolds. Furthermore, we utilize our main result to solve a constrained convex minimization problem and give a practical example for an inventory optimization problem in an electronic supply chain. In addition, we also provide a numerical experiment to demonstrate the asymptotic behavior of the algorithm. It is noteworthy that our results presented in this paper extend the main results of [16] from monotone VIP on Hilbert spaces to the more general pseudomonotone VIP on Hadamard manifolds. In our Algorithm 1, although it is necessary to compute two projections at each iteration step, one of the projections is easily computed since it is a projection on a half-plane, which replaces the second projection in the algorithms in [49,50]. In summary, our new results in this paper are original. It is worth mentioning that part of our future research will focus on achieving the convergence results for the modifications of our proposed algorithms with low computational cost and fast convergence speed.

Author Contributions

Conceptualization, Z.M. and L.W.; methodology, Z.M. and L.W.; software, Z.M.; writing—original draft preparation, Z.M. and L.W.; writing—review and editing, Z.M. and L.W.; funding acquisition, Z.M. and L.W. All authors have read and agreed to the published version of the manuscript.

Funding

This work was funded by the National Natural Science Foundation of China grant number 12161088, and the Science Foundation of Education Department of Yunnan Province grant number 2022Y490.

Data Availability Statement

The data sets used and/or analysed during the current study are available from the corresponding author on reasonable request.

Acknowledgments

The authors would like to thank the editors and the anonymous referee for his/her comments which helped us improve this article.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Aubin, J.P.; Ekeland, I. Applied Nonlinear Analysis; Wiley: New York, NY, USA, 1984. [Google Scholar]
  2. Baiocchi, C.; Capelo, A. Variational and Quasivariational Inequalities: Applications to free Boundary Problems; Wiley: New York, NY, USA, 1984. [Google Scholar]
  3. Kinderlehrer, D.; Stampacchia, G. An Introduction to Variational Inequalities and Their Applications; Academic Press: New York, NY, USA, 1980. [Google Scholar]
  4. Hartman, P.; Stampacchia, G. On some non-linear elliptic diferential-functional equations. Acta Math. 1966, 115, 271–310. [Google Scholar] [CrossRef]
  5. Hieu, D.V. Parallel extragradient-proximal methods for split equilibrium problems. Math. Model. Anal. 2016, 21, 478–501. [Google Scholar] [CrossRef]
  6. Gibali, A.; Reich, S.; Zalas, R. Outer approximation methods for solving variational inequalities in Hilbert space. Optimization 2017, 66, 417–437. [Google Scholar] [CrossRef]
  7. Ullah, R.; Mdallal, Q.A.; Khan, T.; Ullah, R.; AlAlwan, B.; Faiz, F.; Zhu, Q.X. The dynamics of novel corona virus disease via stochastic epidemiological model with vaccination. Sci. Rep. 2023, 13, 3805. [Google Scholar] [CrossRef] [PubMed]
  8. Cholamjiak, W.; Suparatulatorn, R. Strong convergence of a modified extragradient algorithm to solve pseudomonotone equilibrium and application to classification of diabetes mellitus. Chaos Solitons Fractals 2023, 168, 113108. [Google Scholar] [CrossRef]
  9. Suantai, S.; Yajai, W.; Peeyada, P.; Cholamjiak, W.; Chachvarat, P. A modified inertial viscosity extragradient type method for equilibrium problems application to classification of diabetes mellitus:Machine learning methods. AIMS Math. 2022, 8, 1102–1126. [Google Scholar] [CrossRef]
  10. Suparatulatorna, R.; Cholamjiakb, W.; Jun-on, N. A modified subgradient extragradient method for equilibrium problems to predictprospective mathematics teachers’digital proficiency level. Res. Nonlinear Anal. 2023, 6, 1–18. [Google Scholar]
  11. Cholamjiak, W.; Dutta, H.; Yambangwai, D. Image restorations using an inertial parallel hybrid algorithm with Armijo linesearch-for nonmonotone equilibrium problems. Chaos Solitons Fractals 2021, 153, 111462. [Google Scholar] [CrossRef]
  12. Chang, X.K.; Liu, S.Y.; Zhao, P.J.; Song, D.J. A generalization of linearized alternating direction method of multipliers for solving two-block separable convex programming. J. Comput. Appl. Math. 2019, 357, 251–272. [Google Scholar] [CrossRef]
  13. Facchinei, F.; Pang, J.S. Finite-Dimensional Variational Inequalities and Complementarity Problems; Springer Series in Operations Research; Springer: New York, NY, USA, 2003; Volume II. [Google Scholar]
  14. Kinderlehrer, D.; Stampacchia, G. An Introduction to Variational Inequalities and Their Applications; Classics in applied mathematics; Society for Industrial and Applied Mathematics (SIAM): Philadelphia, PA, USA, 2000; Volume 31. [Google Scholar]
  15. Ahmad, R.; Ali, I.; Hussain, S.; Latif, A.; Wen, C.F. Generalized Implicit Set-Valued Variational Inclusion Problem with Operation. Mathematics 2019, 7, 421. [Google Scholar] [CrossRef]
  16. Shehu, Y.; Iyiola, O.S. Strong convergence result for monotone variational inequalities. Numer. Algor. 2017, 76, 259–282. [Google Scholar] [CrossRef]
  17. Shehu, Y.; Iyiola, O.S. Projection methods with alternating inertial steps for variational inequalities: Weak and linear convergence. Appl. Numer. Math. 2020, 157, 315–337. [Google Scholar] [CrossRef]
  18. Thong, D.V.; Hieu, D.V. Weak and strong convergence theorems for variational inequality problems. Numer. Algor. 2018, 78, 1045–1060. [Google Scholar] [CrossRef]
  19. Tian, M.; Xu, G. Improved inertial projection and contraction method for solving pseudomonotone variational inequality problems. J. Inequal. Appl. 2021, 2021, 107. [Google Scholar] [CrossRef]
  20. Farid, M.; Ali, R.; Cholamjiak, W. An inertial iterative algorithm to find common solution of a split generalized equilibrium and a variational inequality problem in hilbert spaces. J. Math. 2021, 2021, 3653807. [Google Scholar] [CrossRef]
  21. Ponkamon, K.; Watcharaporn, C.; Damrongsak, Y. An inertial parallel CQ subgradient extragradient method for variational inequalities application to signal-image recovery. Res. Nonlinear Anal. 2021, 4, 217–234. [Google Scholar]
  22. Suantaia, S.; Peeyadab, P.; Cholamjiakb, W.; Duttac, H. Image deblurring using a projective inertial parallel subgradient extragradient-line algorithm of variational inequality problems. Filomat 2022, 36, 423–437. [Google Scholar] [CrossRef]
  23. Olona, M.A.; Narain, O.K. Iterative method for solving finite families of variational inequality and Fixed Point Problems of certain multi-valued mappings. Nonlinear Funct. Anal. Appl. 2022, 27, 149–167. [Google Scholar]
  24. Abass, H.A.; Narain, O.K.; Onifade, O.M. Inertial extrapolation method for solving systems of monotone variational inclusion and fixed point problems using Bregman distance approach. Nonlinear Funct. Anal. Appl. 2023, 28, 497–520. [Google Scholar]
  25. 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, 663–683. [Google Scholar] [CrossRef]
  26. Ansari, Q.H.; Babu, F.; Li, X. Variational inclusion problems in Hadamard manifolds. J. Nonlinear Convex Anal. 2018, 19, 219–237. [Google Scholar]
  27. 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]
  28. Chang, S.S.; Tang, J.F.; Wen, C.F. A new algorithm for monotone inclusion problems and fixed points on Hadamard manifolds with applications. Acta Math. Sci. 2021, 41, 1250–1262. [Google Scholar] [CrossRef]
  29. Liu, M.; Chang, S.S.; Zhu, J.H.; Tang, J.F.; Liu, X.D.; Xiao, Y.; Zhao, L.C. An iterative algorithm for finding a common solution of equilibrium problem, quasi-variational inclusion problem and fixed point on Hadamard manifolds. J. Nonlinear Convex Anal. 2021, 22, 69–86. [Google Scholar]
  30. Németh, S.Z. Variational inequalities on Hadamard manifolds. Nonlinear Anal. 2003, 52, 1491–1498. [Google Scholar] [CrossRef]
  31. Ferreira, O.P.; Pérez, L.R.L.; Németh, S.Z. Singularities of monotone vector fields and an extragradient-type algorithm. J. Glob. Optim. 2005, 31, 133–151. [Google Scholar] [CrossRef]
  32. 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]
  33. Tang, G.J.; Wang, X.; Liu, H.W. A projection-type methodfor variational inequalities on Hadamard manifolds and verification of solution existence. Optimization 2015, 64, 1081–1096. [Google Scholar] [CrossRef]
  34. Ye, M.; He, Y. A double projection method for solving variational inequalities without monotonicity. Comput. Optim. Appl. 2015, 60, 141–150. [Google Scholar] [CrossRef]
  35. Ansaril, Q.H.; Babu, F. Extragradient-type Algorithm for Non-monotone Variational Inequalities on Hadamard Manifolds. Indian J. Ind. Appl. Math. 2020, 11, 118–137. [Google Scholar] [CrossRef]
  36. Chen, J.F.; Liu, S.Y.; Chang, X.K. Modified Tseng’s extragradient methods for variational inequality on Hadamard manifolds. Appl. Anal. 2021, 100, 2627–2640. [Google Scholar] [CrossRef]
  37. Sakai, T. Riemannian Geometry, Translations of Mathematical Monographs; American Mathematical Society: Providence, RI, USA, 1996. [Google Scholar]
  38. Carmo, M.P.D. Riemannian Geometry; Birkhauser: Boston, MA, USA; Basel, Switzerland; Berlin, Germany, 1992. [Google Scholar]
  39. Wang, J.H.; 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]
  40. Reich, S. Strong convergence theorems for resolvents of accretive operators in Banach spaces. J. Math. Anal. Appl. 1980, 75, 287–292. [Google Scholar] [CrossRef]
  41. Li, C.; Lopez, G.; Martín-Márquez, V. Iterative algorithms for nonexpansive mappings on Hadamard manifolds. Taiwan J. Math. 2010, 14, 541–559. [Google Scholar]
  42. 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, 567–582. [Google Scholar] [CrossRef]
  43. Ferreira, O.P.; Oliveira, P.R. Proximal point algorithm on Riemannian manifolds. Optimization 2002, 51, 257–270. [Google Scholar] [CrossRef]
  44. Maingé, P.E. A hybrid extragradient-viscosity method for monotone operators and fixed point problems. SIAM J. Control Optim. 2008, 47, 1499–1515. [Google Scholar] [CrossRef]
  45. Xu, H.K. Iterative algorithm for nonlinear operators. J. Lond. Math. Soc. 2002, 66, 1–17. [Google Scholar] [CrossRef]
  46. Harker, P.T.; Pang, J.-S. A damped-newton method for the linear complementarity problem. Lect. Appl. Math. 1990, 66, 265–284. [Google Scholar]
  47. Kanzow, C. Some equation-based methods for the nonlinear complemantarity problem. Optim. Methods Softw. 1994, 3, 327–340. [Google Scholar] [CrossRef]
  48. Pang, J.-S.; Gabriel, S.A. NE/SQP: A robust algorithm for the nonlinear complementarity problem. Math. Program. 1993, 60, 295–337. [Google Scholar] [CrossRef]
  49. Korpelevich, G.M. The extragradient method for finding saddle points and other problems. Ekonom. Mat. Metody. 1976, 12, 747–756. [Google Scholar]
  50. Tseng, P. A modified forward-backward splitting method for maximal monotone mappings. SIAM J. Control Optim. 2000, 38, 431–446. [Google Scholar] [CrossRef]
  51. Bento, G.C.; Ferreira, O.P.; Oliveira, P.R. Proximal point method for a special class of nonconvex functions on Hadamard manifolds. Optimization 2012, 64, 289–319. [Google Scholar] [CrossRef]
Figure 1. Comparison of Algorithms for Example 1. (a) The number of iterations; (b) The number of iterations; (c) Comparison of the residual error with x 1 = 0.5 ; (d) Comparison of the residual error with x 1 = 8 .
Figure 1. Comparison of Algorithms for Example 1. (a) The number of iterations; (b) The number of iterations; (c) Comparison of the residual error with x 1 = 0.5 ; (d) Comparison of the residual error with x 1 = 8 .
Symmetry 15 02085 g001
Table 1. Result of iterations.
Table 1. Result of iterations.
Iteration x n z n x n + 1 E n
15000850067501750
2675090257887.51137.5
37887.59366.258626.875739.38
48626.8759588.0639107.469480.59
59107.468759732.2419419.855312.39
69419.8546889825.9569622.906203.05
79622.9055479886.8729754.889131.98
89754.8886059926.4679840.67885.789
99840.6775949952.2039896.4455.763
109896.4404369968.9329932.68636.246
319999.98789999.9969999.9920.0042701
329999.992079999.9989999.9950.0027756
339999.9948459999.9989999.9970.0018041
349999.9966499999.9999999.9980.0011727
359999.9978229999.9999999.9990.00076224
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.

Share and Cite

MDPI and ACS Style

Ma, Z.; Wang, L. New Convergence Theorems for Pseudomonotone Variational Inequality on Hadamard Manifolds. Symmetry 2023, 15, 2085. https://doi.org/10.3390/sym15112085

AMA Style

Ma Z, Wang L. New Convergence Theorems for Pseudomonotone Variational Inequality on Hadamard Manifolds. Symmetry. 2023; 15(11):2085. https://doi.org/10.3390/sym15112085

Chicago/Turabian Style

Ma, Zhaoli, and Lin Wang. 2023. "New Convergence Theorems for Pseudomonotone Variational Inequality on Hadamard Manifolds" Symmetry 15, no. 11: 2085. https://doi.org/10.3390/sym15112085

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop