Next Article in Journal
Mathematical Analysis for the Evaluation of Settlement and Load-Bearing Capacity of a Soil Base Adjacent to an Excavation Pit
Next Article in Special Issue
New Type of Degenerate Changhee–Genocchi Polynomials
Previous Article in Journal
Does Set Theory Really Ground Arithmetic Truth?
Previous Article in Special Issue
Numerical Processes for Approximating Solutions of Nonlinear Equations
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Iterative Approximate Solutions for Variational Problems in Hadamard Manifold

1
Department of Mathematics, Faculty of Science, University of Tabuk, P.O. Box 741, Tabuk 71491, Saudi Arabia
2
Department of Mathematical Science, College of Sciences, Princess Nourah Bint Abdulrahman University, Riyadh 84428, Saudi Arabia
3
School of Mathematics, Thapar Institute of Engineering & Technology, Patiala 147004, Punjab, India
4
Department of Mathematics, Faculty of Science, Islamic University of Madinah, P.O. Box 170, Madinah 42351, Saudi Arabia
*
Authors to whom correspondence should be addressed.
Axioms 2022, 11(7), 352; https://doi.org/10.3390/axioms11070352
Submission received: 18 June 2022 / Revised: 16 July 2022 / Accepted: 18 July 2022 / Published: 21 July 2022
(This article belongs to the Special Issue 10th Anniversary of Axioms: Mathematical Analysis)

Abstract

:
The goal of this paper is to propose and investigate new iterative methods for examining an approximate solution of a fixed-point problem, an equilibrium problem, and a finite collection of variational inclusions in the Hadamard manifold’s structure. Operating under some assumptions, we extend the proximal point algorithm to estimate the common solution of stated problems and obtain a strong convergence theorem for the common solution. We also present several consequences of the proposed iterative methods and their convergence results.

1. Introduction

Many nonlinear problems, such as equilibrium, optimization, variational inequality, and fixed-point problems, have recently been transformed from linear spaces to Hadamard manifolds; see [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15]. Fan [16] initiated the equilibrium problem (EP), which was later developed by Blum and Oettli [17] in real Hilbert space. It was Colao [5] who studied the equilibrium problem for the first time on the Hadamard manifold. For a bi-function F : K × K R , such that F ( u , u ) = 0 , u K , K is a nonempty subset of the Hadamard manifold X . The equilibrium problem is to locate a point u K , such that
F ( u , u ) 0 , u K .
They studied the existence of equilibrium point of equilibrium problem (1), and utilized their results to find the solution of mixed variational inequality problems, fixed-point problems and Nash equilibrium problems in Hadamard manifolds. They also introduced the Picard iterative method to approximate a solution of the equilibrium problem (1). Recently, Khammahawong et al. [10,18] studied the splitting type algorithms for equilibrium and inclusion problems on Hadamard manifolds. We denote by EP ( F ) the set of equilibrium points of the equilibrium problem (1).
The variational inclusion problem in Hilbert space H is to locate a point u D , such that
0 V ( u ) + G ( u ) ,
where V : D H and G : D 2 H are single valued and set-valued mappings, respectively, defined on a nonempty subset D of Hilbert space H . The solution set of the problem (2) is denoted by ( V + G ) 1 ( 0 ) .
Due to its application-oriented nature, the problem (2) has been investigated extensively by a number of researchers in diverse directions.The proximal point method due to Martinet [19] is a fundamental approach for solving the inclusion problem u G 1 ( 0 ) , and Rockafellar [15] generalized this strategy to solve the variational inclusion problem (2). Li et al. [11] introduced the proximal point method for the inclusion problem in Hadamard manifold. Ansari et al. [2] examined Korpelevich’s method to find the solution of the variational inclusion problem (2) in the structure of the Hadamard manifold X .
Recently, Ansari and Babu [3] investigated the variational inclusion problem (2) using the proximal point method in the Hadamard manifold, as follows:
Let u 0 X and λ k > 0 , define u k + 1 , such that
0 P u k + 1 , u k V ( u k ) + G ( u k + 1 ) 1 λ k exp u k + 1 1 u k ,
where P u k + 1 , u k is the parallel transport of T u k X to T u k + 1 X on the tangent bundle of T X , exp is the exponential mapping, V and G are single valued and set-valued monotone vector fields, respectively defined on K X .
Several practical problems can be formulated as a fixed-point problem:
S ( u ) = u ,
where S is a nonlinear mapping. The solutions of this equation are called fixed points of S, which is denoted by Fix ( S ) . Li et al. [13] extended the Mann and Halpern iteration scheme to find the fixed point of nonexpansive mappings from Hilbert spaces to Hadamard manifolds. Recently, Al-Homidan et al. [1] proposed and analyzed the Halpern and Mann-type iterative methods to find the solution of a variational inclusion problem (2) and fixed-point problem (4) of self nonexpansive mapping S in the Hadamard manifold, which is to locate u K , such that
u Fix ( S ) ( V + G ) 1 ( 0 ) .
Most of the problems originating in nonlinear science, such as signal processing, image recovery, signal processing, optimization, machine learning, etc., are switchable to either variational inclusion, an equilibrium problem or a fixed-point problem. Therefore, many mathematicians have recently transformed and studied the inclusion problems, equilibrium problems and fixed-point problems in different directions from linear to nonlinear spaces; for examples, see [1,2,3,6,7,9,11,12,13,20,21,22] and references cited therein.
As zero of the sum of monotone mapping V + G is the fixed point of resolvent J λ G ( exp x ( λ V ( x ) ) ) , λ > 0 , following the work of Ansari et al. [2], and Al-Homidan et al. [1], Chang et al. [4] investigated the problem:
Find u K such that u Fix ( S ) i = 1 N ( V i + G ) 1 ( 0 ) EP ( F ) ,
where Fix ( S ) and EP ( F ) represent the set of fixed points of the mapping S and equilibrium points of equilibrium function F, respectively, and i = 1 N ( V i + G ) 1 ( 0 ) is the set of common singularities of N variational inclusion problems, defined as:
Find u K such that 0 V i ( u ) + G ( u ) , i { 1 , 2 N } .
If V i = V , for all i = 1 , 2 , N , we have
Find u K such that u Fix ( S ) ( V + G ) 1 ( 0 ) EP ( F ) .
Inspired by the works of Ansari and Babu [3], Al-Homidan et al. [1] and following contemporary research work, our motive in this article is to propose new iterative algorithms to solve problems (5)–(7) in the setting of Hadamard manifold. We also bring out some consequences of proposed iterative algorithms. The following section contains some definitions, symbols, and useful results on Riemannian manifolds. Section 3 contains the main results describing the iterative algorithms for the problems (5)–(7). In the last section, we discuss some of the consequences of the suggested algorithms and their convergence results for solving variational inequality problems with equilibrium and fixed-point problems.

2. Preliminaries

We consider X to be a differentiable manifold of finite dimension. Let T u X indicate the tangent space of X at u, and the tangent bundle of X is indicated by T X = u X T u X , which is obviously a manifold. An inner product · , · u on T u X is termed as Riemannian metric on T u X . A tensor · , · : u · , · u is said to be the Riemannian metric on T u X , if · , · u is a Riemannian metric on T u X for each u X . We denote the Riemannian metric on X by · , · u and corresponding norm by · u , which is given by w u = w , w u , for all w T u X . We assume that X is equipped with the Riemannian metric · , · u and its corresponding norm is · u . For simplicity, we omit the subscript.
The length of a piecewise smooth curve joining u to v (i.e., γ ( u ) = a and γ ( v ) = b ) is defined as L ( γ ) = a b γ ( x ) d x . The Riemannian distance d ( u , v ) yields the original topology on X , which minimizes the length over the set of all such curves which connect u and v.
We denote the Levi-Civita connection associated to X by ∇. We know that if γ ( κ ) F = 0 , the vector field F is parallel along a smooth curve γ . If γ is parallel along γ , then γ is said to be geodesic and in this case γ is constant. γ is called a normalized geodesic, if γ = 1 . A minimal geodesic is a geodesic connecting u to v in X with the length equal to d ( u , v ) . A complete Riemannian manifold is one in which for any u X . All geodesics that originate from u are defined for all real numbers κ ( , ) . Due to Hopf–Rinow Theorem [23], it is known to us that in a complete Riemannian manifold X , any u , v X can be attached through a minimal geodesic.
Moreover, the exponential map exp u : T u X X at u is defined by exp u ( w ) = γ w ( 1 , u ) for each w T u X , where γ w ( · , u ) is the geodesic starting from u with velocity w (that is, γ w ( 0 , u ) = u and γ w ( 0 , u ) = w ) . We know that exp u ( t w ) = γ w ( t , u ) for each real number t and exp u 0 = γ w ( 0 ; u ) = u . It is known to us that for any u X , the exponential map exp u is differentiable on T u X and the derivative of exp u ( 0 ) is the identity vector of T u X . Hence, using inverse mapping theorem, there is an inverse exponential map exp u 1 : X T u X . Moreover, for any u , v X , we have d ( u , v ) = exp u 1 v = exp v 1 u , where exp u 1 v = exp u 1 v , exp u 1 v . In particular, if X = R n the Euclidian space, then exp u 1 v = v u for all u , v R n .
A Hadamard manifold is a Riemannian manifold with nonpositive sectional curvature which is complete and simply connected.
Lemma 1
([23]). Let X be a finite dimensional manifold and γ : [ 0 , 1 ] X be a geodesic joining u to v. Then,
d ( γ ( κ 1 ) , γ ( κ 2 ) ) = | κ 1 κ 2 | d ( u , v ) , f o r a l l κ 1 , κ 2 [ 0 , 1 ] .
Proposition 1
([23]). Let X be a Hadamard manifold. Then
(i) 
The exponential map exp u : T u X X is a diffeomorphism for all u X .
(ii) 
For any pair of point u , v X , there exists a unique normalized geodesic γ : [ 0 , 1 ] X joining u = γ ( 0 ) to v = γ ( 1 ) , which is in fact a minimal geodesic defined by
γ ( κ ) = exp u κ exp u 1 v , for all κ [ 0 , 1 ] .
A subset K of Hadamard manifold X is called a convex set if, for any u , v K , any geodesic joining u and v must be in K. In other words, if γ : [ a , b ] X is a geodesic, such that u = γ ( a ) and v = γ ( b ) , then γ ( ( 1 κ ) a + κ b ) K , for all κ [ 0 , 1 ] .
A function h : K ( , ] is called a geodesic convex function, if for any geodesic γ : [ a , b ] X , the composition function h γ : [ a , b ] R is convex; that is,
( h γ ) ( t 1 κ + ( 1 κ ) t 2 ) κ ( h γ ) ( t 1 ) + ( 1 κ ) ( h γ ) ( t 2 ) , κ [ 0 , 1 ] and t 1 , t 2 R .
Proposition 2
([23]). The Riemannian distance d : X × X R is a convex function with respect to the product Riemannian metric, i.e., given any pair of geodesics γ 1 : [ 0 , 1 ] X and γ 2 : [ 0 , 1 ] X , the following inequality holds for all κ [ 0 , 1 ] :
d ( γ 1 ( κ ) , γ 2 ( κ ) ) ( 1 κ ) d ( γ 1 ( 0 ) , γ 2 ( 0 ) ) + κ d ( γ 1 ( 1 ) , γ 2 ( 1 ) ) .
In particular, for each u X , the function d ( · , u ) : X R is a convex function.
For n-dimensional manifold X , we conclude by Proposition 1 that X is diffeomorphic to the Euclidean space R n ; hence, X and R n have the same differential structure and topology. Moreover, Euclidean spaces and Hadamard manifold have certain identical geometric prospects. Some of these are stated in the following results.
In a Riemannian manifold X , geodesic triangle Δ ( r 1 , r 2 , r 3 ) is a collection of three points r 1 , r 2 and r 3 and the three minimal geodesics γ k joining ϕ k to ϕ k + 1 , where k = 1 , 2 , 3 mod ( 3 ) .
Lemma 2
([13]). Let Δ ( r 1 , r 2 , r 3 ) be a geodesic triangle in Hadamard manifold X . Then, r 1 , r 2 , r 3 R 2 , such that
d ( r 1 , r 2 ) = r 1 r 2 , d ( r 2 , r 3 ) = r 2 r 3 , a n d d ( r 3 , r 1 ) = r 3 r 1 .
The points r 1 , r 2 , r 3 are called the comparison points to r 1 , r 2 , r 3 , respectively. The triangle Δ ( r 1 , r 2 , r 3 ) is called the comparison triangle of the geodesic triangle Δ ( r 1 , r 2 , r 3 ) , which is unique to the isometry of X .
Lemma 3
([13]). Let Δ ( r 1 , r 2 , r 3 ) be a geodesic triangle in Hadamard manifold X and Δ ( r 1 , r 2 , r 3 ) R 2 be its comparison triangle.
(i) 
Let θ 1 , θ 2 , θ 3 (respectively, θ 1 , θ 2 , θ 3 ) be the angles of Δ ( r 1 , r 2 , a 3 ) (respectively, Δ ( r 1 , r 2 , r 3 ) ) at the vertices ( r 1 , r 2 , r 3 ) (respectively, r 1 , r 2 , r 3 ). Then, the following inequalities hold:
θ 1 θ 1 , θ 2 θ 2 , θ 3 θ 3 .
(ii) 
Let v be a point on the geodesic joining r 1 to r 2 and v be its comparison point in the interval [ r 1 , r 2 ] . Suppose that d ( v , r 1 ) = v r 1 and d ( v , r 2 ) = v r 2 . Then,
d ( v , r 3 ) v r 3 .
Proposition 3
([23]). (Comparison Theorem for Triangle) Let Δ ( r 1 , r 2 , r 3 ) be a geodesic triangle. Denote, for each k = 1 , 2 , 3 mod ( 3 ) , by γ k : [ 0 , l k ] X geodesic joining r k to r k + 1 and set l k = L ( γ k ) , θ k = ( γ k ( 0 ) γ k 1 ( l k 1 ) ) . Then,
θ 1 + θ 2 + θ 3 π ,
l k 2 + l k + 1 2 2 l k l k + 1 cos θ k + 1 l k 1 2 .
In terms of d and exp, (11) can be expressed as
d 2 ( r k , r k + 1 ) + d 2 ( r k + 1 , r k + 2 ) 2 exp r k + 1 1 r k , exp r k + 1 1 r k + 2 d 2 ( r k 1 , r k ) ,
since
exp r k + 1 1 r k , exp r k + 1 1 r k + 2 = d ( r k , r k + 1 ) d ( r k + 1 , r k + 2 ) cos θ k + 1 .
The parallel transport P γ , γ ( d ) , γ ( c ) : T γ ( x ) X T γ ( y ) X on the tangent bundle T X along γ : [ c , d ] R , with respect to ∇, is defined by
P γ , γ ( d ) γ ( c ) ( u ) = V ( γ ( d ) ) , c , d R , u T γ ( c ) X ,
such that γ ( t ) V = 0 , for all t [ c , d ] and V γ ( c ) ) = u , where V is the unique vector field. If γ is the minimal geodesic from u to v, then we write P v , u in place of P γ , v , u . Moreover, P v , u is an isometry from T u X to T v X , which means that parallel transport preserves the inner product, P v , u w , P y , x z = w , z u , w , z T u X .
Lemma 4
([11]). Let u 0 X and { u k } X with u k u 0 . Then, the following assertions hold:
(i) 
For any v X , we have exp u k 1 v exp u 0 1 v and exp v 1 u k exp v 1 u 0 .
(ii) 
If z k T u k X and z k z 0 , then z 0 T u 0 X
(iii) 
Let z k , y k T u k X and z 0 , y 0 T u 0 X , if z k z 0 and y k y 0 then z k , y k z 0 , y 0 .
(iv)
For any z T u 0 X , the function ψ : X T X , defined by ψ ( u ) = P u , u 0 z for all u X , is continuous on X .
We denote by Ω ( X ) , the set of all single-valued vector fields V : X T X , such that V ( u ) T u ( X ) for all u X and by χ ( X ) the set of all set-valued vector fields, G : X T X , such that G ( u ) T u ( X ) for all u d o m ( G ) , where d o m ( G ) is the domain of G defined as d o m ( G ) = { u X : G ( u ) } .
Definition 1
([24]). A single-valued vector field V Ω ( X ) is said to be
(i) 
Monotone if
V ( u ) , exp u 1 v V ( v ) , exp v 1 u , u , v X .
(ii) 
Strongly monotone if there exists a constant η > 0 such that
V ( u ) , exp u 1 v + V ( v ) , exp v 1 u η d 2 ( u , v ) , u , v X .
(iii) 
φ-Lipschitz continuous if there exists a constant φ > 0 , such that
P u , v V ( u ) V ( v ) φ d ( u , v ) , u , v X .
Definition 2
([25]). A set-valued vector field G χ ( X ) is said to be
(i) 
Monotone if for all u , v D ( X ) ,
w , exp u 1 v z , exp v 1 u , w G ( u ) , z G ( v ) .
(ii) 
Maximal monotone if G is monotone and for u D ( G ) and w T u ( X ) , the condition
w , exp u 1 v z , exp v 1 u ,
implies w G ( u ) .
Definition 3
([25]). A set-valued vector field G χ ( X ) is called upper Kuratowski semicontinuous at u D ( G ) if, for any sequence { u k } D ( G ) and { v k } T X with v k G ( u k ) , the relation lim k v k = v and lim k u k = u imply v G ( u ) . Moreover, G is called upper Kuratowski semicontinuous on X if it is Kuratowski semicontinuous at each u D ( G ) .
Definition 4.
Let ( X , d ) be a complete metric space and K X be a nonempty set. A sequence { u n } in X is called Fej e ´ r convergent to K if, for all u K and k 0 ,
d ( u k + 1 , u ) d ( u k , u ) .
Lemma 5
([8]). Let ( X , d ) be a complete metric space. If u k X is a Fej e ´ r convergent to a nonempty set K X , then { u k } is bounded. Moreover, if cluster point u of { u k } belongs to K, then { u k } converges to u.
Let K X and F : K × K R be a bifunction satisfying the following conditions:
(A)
F ( u , u ) 0 , u K ;
(B)
F is monotone; that is, for all u , v K , F ( u , v ) + F ( v , u ) 0 ;
(C)
For every v K , u F ( u , v ) is upper semicontinuous;
(D)
For all u K , v F ( u , v ) is geodesic convex and lower semicontinuous;
(E)
There exists a compact set C X and a point u C K , such that
F ( u , v ) < 0 , v K \ C ,
The resolvent T t F : X K of a bifunction F, a set-valued operator introduced by Colao [5] in the setting of the Hadamard manifold, is defined by
T t F ( u ) = { w K : F ( w , v ) 1 t exp w 1 u , exp w 1 v 0 , v K } , u X .
Lemma 6
([5]). Let K X and F : K × K R be a bifunction satisfying (A)–(E). Then, for t > 0 ,
(a) 
The resolvent T t F of F is nonempty and single valued;
(b) 
The resolvent T t F of F is firmly nonexpansive;
(c) 
The fixed point of T t F is the equilibrium point set of F;
(d)
The equilibrium point set EP ( F ) is closed and geodesic convex.

3. Main Results

The solution to problem (6) is assumed to be consistent, and it is denoted by Γ . We propose the following iterative procedure to solve the problem (6) in X , based on the proximal point method (3).
Algorithm 1.
Suppose that V i Ω ( X ) , ( i = 1 , , N ) , G χ ( ( X ) , F , S and T t F are the same as described above. Choose arbitrary z 0 K , to define the sequences { u k i } , i { 1 , 2 , , N } , { v k } and { z k } as follows:
0 P u k i , z k V i ( z k ) + G ( u k i ) 1 λ k exp u k i 1 z k , v k = exp z k ( 1 α k ) exp z k 1 T t F ( u k k i ) , z k + 1 = exp z k ( 1 ϱ β k ) exp z k 1 S ( v k ) ,
where k i { 1 , 2 , N } such that d ( u k k i , z k ) = max i = 1 , , N { d ( u k i , z k ) } , α n , β n ( 0 , 1 ) , 0 < ϱ < 1 and λ k > 0 .
If V i = V for all i { 1 , 2 , N } , we have the following iterative algorithm to solve the problem (7).
Algorithm 2.
For arbitrary z 0 K , obtain the sequences { u k } , { v k } and { z k } as follows:
0 P u k , z k V ( z k ) + G ( u k ) 1 λ k exp u k 1 z k , v k = exp z k ( 1 α k ) exp z k 1 T t F ( u k ) , z k + 1 = exp z k ( 1 ϱ β k ) exp z k 1 S ( v k ) ,
where α k , β k ( 0 , 1 ) , 0 < ϱ < 1 and λ k > 0 .
If V i = V for all i { 1 , 2 , N } and F = 0 , then we have the following iterative algorithm to solve the problem (5).
Algorithm 3.
For arbitrary z 0 K , obtain the sequences { u k } and { z k } as follows:
0 P u k , z k V ( z k ) + G ( u k ) 1 λ k exp u k 1 z k , z k + 1 = exp z k ( 1 ϱ β k ) exp z k 1 S ( u k ) ,
where β k ( 0 , 1 ) , 0 < ϱ < 1 and λ k > 0 .
Theorem 1.
Let K be the nonempty, closed and geodesic convex subset of X . Suppose that for every i { 1 , 2 , N } , vector field V i Ω ( X ) is η i -strongly monotone and φ i -Lipschitz continuous and G χ ( X ) is maximally monotone. Let F : K × K R be a bifunction enjoying the conditions ( A ) ( E ) and T t F be the resolvent of F, S : K K as a nonexpansive mapping. If Γ and η = min { i = 1 , 2 N } { η i } , φ = max { i = 1 , 2 N } { φ i } , α n , β n ( 0 , 1 ) , 0 < ϱ < 1 and λ k > 0 satisfy the following conditions:
(H1)
0 < λ ¯ < λ k < λ < 1 2 η , and φ < 2 η .
(H2)
k = 0 β k = .
(H3)
0 < b < α k , β k < c < 1 .
Then, the sequence { z k } obtained from Algorithm 1 converges to an element in Γ.
Proof. 
The proof is divided into the following three steps:
Step I. First, we justify that the sequence { z k } is Fej e ´ r monotone with respect to Γ .
Let z Γ , then V i ( z ) G ( z ) for each i { 1 , 2 , N } . For any arbitrary z 0 K , from Algorithm 1, we have
P u k i , z k V i ( z k ) + 1 λ k exp u k i 1 z k G ( u k i ) ,
with monotonicity of G, which implies that
P u k i , z k V i ( z k ) + 1 λ k exp u k i 1 z k , exp u k i 1 z V i ( z ) , exp u k i 1 z .
Since V i is η i -strongly monotone vector field for each i { 1 , 2 N } , then
V i ( z ) , exp z 1 u k i V i ( u k i ) , exp u k i 1 z η i d 2 ( u k i , z ) .
Combining (14) and (15), we get
P u k i , z k V i ( z k ) + 1 λ k exp u k i 1 z k , exp u k i 1 z V i ( z ) , exp u k i 1 z η i d 2 ( u k i , z ) ,
or,
exp u k i 1 z k , exp u k i 1 z λ k P u k i , z k V i ( z k ) V i ( u k i ) , exp u k i 1 z η i d 2 ( u k i , z ) .
Since V i is φ i -Lipschitz continuous monotone vector field for each i { 1 , 2 N } and φ = max { i = 1 , 2 N } { φ i } , using Cauchy–Schwartz inequality, we get
P u k i , z k V i ( z k ) V i ( u k i ) , exp u k i 1 z P u k i , z k V i ( z k ) V i ( u k i ) exp u k i 1 z φ i d ( u k i , z k ) exp u k i 1 z = φ i exp u k i 1 z k exp u k i 1 z φ 2 exp u k i 1 z k 2 + exp u k i 1 z 2 φ 2 d 2 ( z k , u k i ) + d 2 ( u k i , z ) .
Thus, inequality (16) becomes
2 exp u k i 1 z k ) , exp u k i 1 z φ λ k d 2 ( z k , u k i ) + d 2 ( u k i , z ) 2 η i d 2 ( u k i , z ) .
For fixed k N and i { 1 , 2 N } , let ( z k , u k i , z ) X . Then, using (12), we get
d 2 ( z k , u k i ) + d 2 ( u k i , z ) 2 exp u k i 1 z k , exp u k i 1 z d 2 ( z k , z ) .
From inequalities (17) and (18), and using η = min { i = 1 , 2 N } { η i } , we have
d 2 ( z k , u k i ) + d 2 ( u k i , z ) φ λ k d 2 ( z k , u k i ) + φ λ k d 2 ( u k i , z ) + d 2 ( z k , z ) 2 η λ k d 2 ( u k , z ) .
Since, 0 < λ ¯ < λ k < λ < 1 2 η and φ < 2 η , we have
d 2 ( z k , u k i ) + d 2 ( u k i , z ) φ λ d 2 ( z k , u k i ) + d 2 ( z k , z ) ,
or
d 2 ( u k i , z ) d 2 ( z k , z ) ( 1 φ λ ) d 2 ( z k , u k i ) .
Since λ < 1 2 η and φ < 2 η , implies that φ λ < 1 , we get
d 2 ( u k i , z ) d 2 ( z k , z ) , i { 1 , 2 , N } , k N .
Let k i { 1 , 2 , N } such that d ( u k k i , z ) = max k { 1 , 2 , N } { d ( u k i , z ) } d ( z k , z ) . From (20), Algorithm 1, we have
d ( v k , z ) = d ( γ k ( 1 α k ) , z ) ( 1 α n ) d ( γ k ( 0 ) , z ) + α n d ( γ k ( 1 ) , z ) = ( 1 α k ) d ( z k , z ) + α n d ( T t F ( u k k i ) , z ) ( 1 α k ) d ( z k , z ) + α n d ( u k k i , z ) ( 1 α k ) d ( z k , z ) + α n d ( z k , z ) = d ( z k , z ) .
From Algorithm 1, (21) and using the nonexpansiveness of S, we get
d ( z k + 1 , z ) = d ( γ k ( 1 ϱ β n ) , z ) ( 1 ϱ β n ) d ( γ k ( 0 ) , z ) + ϱ β n d ( γ k ( 1 ) , z ) = ( 1 ϱ β n ) d ( z k , z ) + ϱ β n d ( S ( v k ) , z ) ( 1 ϱ β n ) d ( z k , z ) + ϱ β n d ( v k , z ) ( 1 ϱ β n ) d ( z k , z ) + ϱ β n d ( z k , z ) = d ( z k , z ) .
that is, { z k } is Fej e ´ r monotone and hence bounded by Lemma 5, and therefore the sequence { u k } , { v k } all are bounded and lim k d ( z k , z ) exists.
Step II. Next, we show that d ( z k , u k ) = 0 , d ( z k , v k ) = 0 and d ( z k + 1 , z k ) = 0 , as n . Since z k + 1 = γ k ( 1 ϱ β k ) , then applying geodesic convexity of d, we get
d ( z k + 1 , z k ) = d ( γ k ( 1 ϱ β k ) , z k ) ( 1 ϱ β k ) d ( γ k ( 0 ) , z k ) + ϱ β k d ( γ k ( 1 ) , z k ) ( 1 ϱ β k ) d ( z k , z k ) + ϱ β k d ( S ( v k ) , z k ) ϱ β k d ( S ( v k ) , z k ) .
For fixed k N , let p k = S ( v k ) and ( z k , p k , z ) be the geodesic triangle and ( x ˜ k , p ˜ k , x ˜ ) X be the comparison triangle. Then, we have
d 2 ( z k + 1 , z ) x ˜ k + 1 x ˜ 2 = ( 1 ϱ β k ) x ˜ + ϱ β k p ˜ k x ˜ 2 = ( 1 ϱ β k ) ( x ˜ k x ˜ ) + ϱ β k x ˜ p ˜ k 2 = ( 1 ϱ β k ) x ˜ k x ˜ 2 + ϱ β k p ˜ k x ˜ 2 ϱ β k ( 1 ϱ β k ) p ˜ k x ˜ k 2 ( 1 ϱ β k ) d 2 ( z k , z ) + ϱ β k d 2 ( p k , z ) ϱ β k ( 1 ϱ β k ) d 2 ( p k , z k ) ( 1 ϱ β k ) d 2 ( z k , z ) + ϱ β k d 2 ( S ( v k ) , z ) ϱ β k ( 1 ϱ β k ) d 2 ( S ( v k ) , z k ) ( 1 ϱ β k ) d 2 ( z k , z ) + ϱ β k d 2 ( z k , z ) ϱ β k ( 1 ϱ β k ) d 2 ( S ( v k , z k ) ) d 2 ( z k , z ) ϱ β k ( 1 ϱ β k ) d 2 ( S ( v k ) , z k )
or,
d 2 ( S ( v k ) , z k ) 1 ϱ β k ( 1 ϱ β k ) d 2 ( z k , z ) d 2 ( z k + 1 , z ) .
Further, using condition (H3), we have
d 2 ( z k , S ( v k ) ) 1 ϱ b ( 1 ϱ c ) d 2 ( z k , z ) d 2 ( z k + 1 , z ) .
Since { z k } is Fej e ´ r monotone with respect to Γ , lim k d ( z k , z ) exists; hence, we get
d ( z k , S ( v k ) ) = 0 , k .
Using (23) and (26), we obtain
d ( z k + 1 , z k ) = 0 , k .
Since { z k } , { v k } , are bounded, there exists N 1 > 0 with d ( z k , z ) N 1 , and for each k N , we have
d ( z k , z ) d ( γ k 1 ( 1 ϱ β k ) , z ) ( 1 ϱ β k 1 ) d ( γ k 1 ( 0 ) , z ) + ϱ β k 1 d ( γ k 1 ( 1 ) , z ) = ( 1 ϱ β k 1 ) d ( z k , z ) + ϱ β k 1 d ( S ( v k 1 ) , z ) ( 1 ϱ β k 1 ) d ( z k , z ) + ϱ β k 1 d ( v k 1 , z ) .
For any integer m k 1 , we can write
d ( z k , z ) N 1 j = m k 1 ( 1 ϱ β j ) n = j + 1 k 1 ϱ β n + N 1 j = m k 1 ϱ β j .
From (20), (22) and (29), we achieve
d ( z k , u k i ) = d ( z k , z k + 1 ) + d ( z k + 1 , z ) + d ( u k i , z ) = d ( z k , z k + 1 ) + d ( z k + 1 , z ) + d ( z k , z ) d ( z k , z k + 1 ) + d ( z k , z ) + d ( z k , z ) = d ( z k , z k + 1 ) + 2 d ( z k , z ) d ( z k , z k + 1 ) + 2 N 1 j = m k 1 ( 1 ϱ β j ) n = j + 1 k 1 ϱ β n + 2 N 1 j = m k 1 ϱ β j .
Using condition (H2), we have
lim m j = m ( 1 ϱ β j ) n = j + 1 ϱ β n = 0 , lim m j = m ϱ β j = 0 .
Thus, using (27), we get
lim k d ( z k , u k i ) = 0 , k for each i { 1 , , N } .
Furthermore, for each i { 1 , 2 , N }
d ( z k , T t F ( u k i ) ) = d ( z k , z k + 1 ) + d ( z k + 1 , z ) + d ( T t F ( u k i ) , z ) d ( z k , z k + 1 ) + d ( z k + 1 , z ) + d ( u k i , z ) d ( z k , z k + 1 ) + d ( z k + 1 , z ) + d ( z k , z ) 0 , k ,
and
d ( z k , v k ) = d ( z k , z k + 1 ) + d ( z k + 1 , z ) + d ( v k , z ) d ( z k , z k + 1 ) + d ( z k + 1 , z ) + d ( z k , z ) 0 , k .
Step III. Finally, we show that the limit of a sequence { z k } belongs in Γ .
From step I, we know that the sequence { z k } is bounded, so there is a subsequence { z k n } of { z k } converging to a cluster point w of { z k } . From (26), we have v k n w , and (32) implies d ( z k n , S ( v k n ) ) 0 as n ; thus, due to the nonexpansiveness of S, we get
d ( S ( w ) , w ) = d ( S ( w ) , S ( v k n ) ) + d ( S ( v k n ) , z k n ) + d ( z k n , w ) d ( w , v k n ) + d ( S ( v k n ) , z k n ) + d ( z k n , w ) 0 , n ,
Thus, we obtain w Fix ( S ) .
Since T t F is also nonexpansive, using (31), we get
d ( T t F ( w ) , w ) = d ( T t F ( w ) , T t F ( u k n i ) ) + d ( T t F ( u k n i ) , z k n ) + d ( z k n , w ) d ( w , u k n i ) + d ( T t F ( u k n i ) , z k n ) + d ( z k n , w ) 0 , n ,
which amounts to w Fix ( T t F ) .
From Algorithm 1, we have
ψ k n + 1 = P u k n i , z k n V i ( z k n ) + 1 λ k n exp u k n i 1 z k n G ( u k n i ) .
From (30), we have lim k d ( z k , u k i ) = 0 and sine 0 < λ ¯ < λ k < λ < 1 , and we deduce that lim k 1 λ k d ( z k , u k i ) = 0 , for every i { 1 , 2 , N } . Thus, we have
lim n 1 λ k n exp u k n i 1 z k n = lim n 1 λ k n d ( u k n i , z k n ) = 0 ,
and so,
lim n 1 λ k n exp u k n i 1 z k n = 0 .
Since V i is the Lipschitz continuous vector field and z k n w as n , taking into account (34) and (36), we get
lim n ψ k n + 1 = V i ( w ) , i { 1 , 2 , N } .
G is upper Kuratowski semicontinuous, as it is maximally monotone; then, we have V i ( w ) G ( w ) , for every i { 1 , 2 , N } , that is w i = 1 N ( V i + G ) 1 ( 0 ) . Hence, w Γ . This completes the proof by appealing to Lemma 5. □
If V i = V , then we have the following convergence result for Algorithm 2.
Corollary 1.
Let K be nonempty, closed and geodesic convex subset of X . Let vector field V Ω ( X ) be a η-strongly monotone and φ-Lipschitz continuous; G χ ( X ) is maximally monotone. Let F : K × K R be a bifunction enjoying the conditions ( A ) ( E ) , and T t F be the resolvent of F, S : K K be a nonexpansive mapping. If Fix ( S ) ( V + G ) 1 ( 0 ) EP ( F ) and α n , β n ( 0 , 1 ) , 0 < ϱ < 1 and λ k > 0 satisfy the following conditions (H1)–(H3), then the sequence { z k } obtained by Algorithm 2 converges to the solution of problem (7).
For Algorithm 3, we have the following result to solve Fix ( S ) ( V + G ) 1 ( 0 ) .
Corollary 2.
Let K be a nonempty, closed and geodesic convex subset of X and vector field V Ω ( X ) be η-strongly monotone and φ-Lipschitz continuous. G χ ( X ) is maximally monotone and S : K K is a nonexpansive mapping. If Fix ( S ) ( V + G ) 1 ( 0 ) and β n ( 0 , 1 ) , 0 < ϱ < 1 and λ k > 0 satisfy the following conditions (H1)–(H3), then the sequence { z k } obtained by Algorithm 3 converges to the solution of problem (5).

4. Consequences

Németh [14], introduced and studied the following variational inequality problem V I ( V , K ) : Find u K , such that
V ( u ) , exp u 1 v 0 , for all v K ,
where V : K T X is a single-valued vector field defined on K X .
We know that u K is a solution of V I ( V , K ) if and only if u satisfies
0 V ( u ) + N K ( u ) ,
where N K ( u ) is the normal cone to K at u K , defined by
N K ( u ) = { p T u X : p , exp u 1 v 0 , for all v K } .
The indicator function γ K of K is defined by
γ K ( u ) = 0 , i f u K , + , i f u K .
Since γ K is proper, lower semicontinuous, then the differential γ K ( u ) of γ K is maximally monotone, which is defined by
γ K ( u ) = { p T u X : p , exp u 1 v γ K ( v ) γ K ( u ) = 0 } .
Thus, we have
I K ( u ) = { p T u X : p , exp u 1 v 0 } = N K ( u ) .
For λ > 0 , the resolvent of γ K , defined by
J λ γ K ( u ) = { q X : u exp q λ γ K ( q ) } = P K ( u ) , for all u X .
Thus, for V : K X and for all u K , we have
u ( V + γ K ) 1 ( 0 ) = 0 V ( u ) + γ K ( u ) = V ( u ) γ K ( u ) V ( u ) , exp u 1 v 0 , for all v K u V I ( V , K ) .
Let V i : K T X , i { 1 , 2 , N } be a finite collection of monotone mappings, then the variational inequality problem for V i is defined as
V i ( u ) , exp u 1 v 0 , v K and i { 1 , 2 , , N } ,
and the solution set is denoted by i = 1 N V I ( V i , K ) .
Algorithm 4.
For an arbitrary z 0 K , compute the sequences { u k i } , i { 1 , 2 , } , { v k } and { z k } as follows:
0 P u k , z k V i ( z k ) + i γ K ( u k i ) 1 λ k exp u k i 1 z k , v k = exp z k ( 1 α k ) exp z k 1 T t F ( u k k i ) , z k + 1 = exp z k ( 1 ϱ β k ) exp z k 1 S ( v k ) ,
where k i { 1 , 2 , N } such that d ( u k k i , z k ) = max i = 1 , , N { d ( u k i , z k ) } , α k , β k ( 0 , 1 ) , 0 < ϱ < 1 and λ k > 0 .
If V i = V for all i { 1 , 2 , N } , then we give the following algorithm to solve Fix ( S ) V I ( V , K ) EP ( F ) .
Algorithm 5.
For arbitrary z 0 K , compute the sequences { u k } , { v k } and { z k } as follows:
0 P u k , z k V ( z k ) + γ K ( u k ) 1 λ k exp u k 1 z k , v k = exp z k ( 1 α k ) exp z k 1 T t F ( u k ) , z k + 1 = exp z k ( 1 ϱ β k ) exp z k 1 S ( v k ) ,
where α k , β k ( 0 , 1 ) , 0 < ϱ < 1 and λ k > 0 .
If V i = V for all i { 1 , 2 , N } and F = 0 , then we propose the following algorithm to solve Fix ( S ) V I ( V , K ) .
Algorithm 6.
For arbitrary z 0 K , compute the sequences { u k } and { z k } as follows:
0 P u k , z k V ( z k ) + γ K ( u k ) 1 λ k exp u k 1 z k , z k + 1 = exp z k ( 1 ϱ β k ) exp z k 1 S ( u k ) ,
where β k ( 0 , 1 ) , 0 < ϱ < 1 and λ k > 0 .
Corollary 3.
Let V i Ω ( X ) be η i -strongly monotone and φ i -Lipschitz continuous monotone vector fields for each i { 1 , 2 , N } . Let F : K × K R be a bifunction satisfying the conditions (A)–(E) and T t F be the resolvent of F, S : K K , which is a nonexpansive mapping. If Fix ( S ) i = 1 N V I ( V i , K ) EP ( F ) and η = min { i = 1 , 2 N } { η i } , φ = max { i = 1 , 2 N } { φ i } , α k , β k ( 0 , 1 ) , 0 < ϱ < 1 and λ k > 0 satisfy the conditions given in Theorem 1. Then, the sequence { z k } obtained by Algorithm 4 converges to an element in Fix ( S ) i = 1 N V I ( V i , K ) EP ( F ) .
Corollary 4.
Let V Ω ( X ) be η-strongly monotone and φ-Lipschitz continuous monotone vector field. Let F : K × K R be a bifunction satisfying the conditions (A)–(E) and T t F be the resolvent of F, S : K K be a nonexpansive mapping. If Fix ( S ) V I ( V , K ) EP ( F ) , α k , β k ( 0 , 1 ) , 0 < ϱ < 1 and λ k > 0 satisfy the conditions given in Theorem 1, then the sequence { z k } obtained by Algorithm 5 converges to an element in Fix ( S ) V I ( V , K ) EP ( F ) .
Corollary 5.
Let V Ω ( X ) be η-strongly monotone and φ-Lipschitz continuous monotone vector field. Let S : K K be a nonexpansive mapping. If Fix ( S ) V I ( V , K ) , β k ( 0 , 1 ) , 0 < ϱ < 1 and λ k > 0 satisfy the conditions given in Theorem 1. Then the sequence { z k } obtained by Algorithm 6 converges to an element in Fix ( S ) V I ( V , K ) .

5. Conclusions

This work is concerned with the investigation of the common solution of a fixed-point problem, an equilibrium problem and a finite collection of variational inclusion problems. Our proposed algorithms are advanced and can be considered improvements to the methods discussed in the paper [3]. Several consequences of the suggested algorithms are discussed for variational inequalities, equilibrium and fixed-point problems. We anticipate that the methods presented in this paper can be extended to more general settings; for example, hyperbolic spaces, geodesic spaces and a CAT(0) space.

Author Contributions

Conceptualization, M.D.; methodology, D.F.; validation, M.A.; formal analysis, D.F.; investigation, S.C.; writing, original draft preparation, M.D.; funding acquisition, D.F.; writing, review and editing, M.A. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the Deanship of Scientific Research at Princess Nourah bint Abdulrahman University through the Fast-track Research Funding Program.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

This research was funded by the Deanship of Scientific Research at Princess Nourah bint Abdulrahman University through the Fast-track Research Funding Program. The authors sincerely thank the unknown reviewers for their worthy suggestions and helpful comments that have led to the present form of the original manuscript.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. 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]
  2. Ansari, Q.H.; Babu, F.; Li, X.-B. Variational inclusion problems on Hadamard manifolds. J. Nonlinear Convex Anal. 2018, 19, 219–237. [Google Scholar]
  3. Ansari, Q.H.; Babu, F. Proximal point algorithm for inclusion problems in Hadamard manifolds with applications. Optim. Lett. 2021, 15, 901–921. [Google Scholar] [CrossRef]
  4. Chang, S.S.; Yao, J.C.; Yang, L.; Wen, C.F.; Wu, D.P. Convergence analysis for variational inclusion problems equilibrium problems and fixed point in Hadamard manifolds. Numer. Funct. Anal. Appl. 2021, 42, 567–582. [Google Scholar] [CrossRef]
  5. Colao, V.; López, G.; Marino, G.; Martín-Márquez, V. Equilibrium problems in Hadamard manifolds. J. Math. Anal. Appl. 2012, 388, 61–71. [Google Scholar] [CrossRef] [Green Version]
  6. Dilshad, M. Solving Yosida inclusion problem in Hadamard manifold. Arab. J. Math. 2020, 9, 357–366. [Google Scholar] [CrossRef] [Green Version]
  7. Dilshad, M.; Khan, A.; Akram, M. Splitting type viscosity methods for inclusion and fixed point problems on Hadamard manifolds. AIMS Math. 2021, 6, 5205–5221. [Google Scholar] [CrossRef]
  8. Ferreira, O.P.; Oliveira, P.R. Proximal point algorithm on Riemannian manifold. Optimization 2002, 51, 257–270. [Google Scholar] [CrossRef]
  9. Filali, D.; Dilshad, M.; Akram, M.; Babu, F.; Ahmad, I. Viscosity method for hierarchical variational inequalities and variational inclusions on Hadamard manifolds. J. Inequalities Appl. 2021, 2021, 66. [Google Scholar] [CrossRef]
  10. Khammahawong, K.; Kumam, P.; Chaipunya, P. Splitting algorithms of common solutions between equilibrium and inclusion problems on Hadamard manifold. Linear Nonlinear Anal. 2020, 6, 227–243. [Google Scholar]
  11. Li, C.; Lopez, G.; Márquez, V.M. Monotone vector fields and the proximal point algorithm on Hadamard manifolds. J. Lond. Math. Soc. 2009, 79, 663–683. [Google Scholar] [CrossRef]
  12. Li, C.; López, G.; Márquez, V.M.; Wang, J.H. Resolvent of set-valued monotone vector fields in Hadamard manifolds. J. Set-Valued Anal. 2011, 19, 361–383. [Google Scholar] [CrossRef]
  13. 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]
  14. Németh, S.Z. Variational inequalities on Hadamard manifolds. Nonlinear Anal. 2003, 52, 1491–1498. [Google Scholar] [CrossRef]
  15. Rockafellar, R.T. Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 1976, 14, 877–898. [Google Scholar] [CrossRef] [Green Version]
  16. Fan, K. A Minimax Inequality and Applications; Academic Press: New York, NY, USA, 1972; pp. 103–113. [Google Scholar]
  17. Blum, E.; Oetteli, W. From optomization and variational inequalities to equilibrium problems. Math. Stud. 1994, 63, 123–145. [Google Scholar]
  18. Khammahawong, K.; Kumam, P.; Chaipunya, P. Splitting Algorithms for Equilibrium Problems and Inclusion Problems on Hadamard Manifolds. Numer. Funct. Anal. Optim. 2021, 42, 1645–1682. [Google Scholar] [CrossRef]
  19. Martinet, B. Régularisation d’inequations variationnelles par approximations successives. Rev. Fr. Inform. Oper. 1970, 4, 154–158. [Google Scholar]
  20. Walter, R. On the metric projections onto convex sets in Riemannian spaces. Arch. Math. 1974, 25, 91–98. [Google Scholar] [CrossRef]
  21. Khammahawong, K.; Kumam, P.; Chaipunya, P.; Martinez-Marino, J. Tseng’s method for inclusion problem on Hadamard manifolds. Optimization 2021. [Google Scholar] [CrossRef]
  22. Rapcsák, T. Smooth Nonlinear Optimization in R n ; Kluwer Academic Publishers: Dordrecht, The Netherlands, 1997. [Google Scholar]
  23. Sakai, T. Riemannian Geomety, Translations of Mathematical Monograph; American Mathematical Society: Providence, RI, USA, 1996. [Google Scholar]
  24. Németh, S.Z. Monotone vector fields. Publ. Math. Debrecen 1999, 54, 437–449. [Google Scholar]
  25. Da Cruz Neto, J.X.; Ferreira, O.P.; Lucambio Pérez, L.R. Monotone point-to-set vector fields. Balk. J. Geom. Appl. 2000, 5, 69–79. [Google Scholar]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Dilshad, M.; Filali, D.; Chandok, S.; Akram, M. Iterative Approximate Solutions for Variational Problems in Hadamard Manifold. Axioms 2022, 11, 352. https://doi.org/10.3390/axioms11070352

AMA Style

Dilshad M, Filali D, Chandok S, Akram M. Iterative Approximate Solutions for Variational Problems in Hadamard Manifold. Axioms. 2022; 11(7):352. https://doi.org/10.3390/axioms11070352

Chicago/Turabian Style

Dilshad, Mohammad, Doaa Filali, Sumit Chandok, and Mohammad Akram. 2022. "Iterative Approximate Solutions for Variational Problems in Hadamard Manifold" Axioms 11, no. 7: 352. https://doi.org/10.3390/axioms11070352

APA Style

Dilshad, M., Filali, D., Chandok, S., & Akram, M. (2022). Iterative Approximate Solutions for Variational Problems in Hadamard Manifold. Axioms, 11(7), 352. https://doi.org/10.3390/axioms11070352

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