Preprint
Article

This version is not peer-reviewed.

Modified inertial-type subgradient extragradient methods for variational inequalities and fixed points of finite Bregman relatively nonexpansive and demicontractive mappings

A peer-reviewed article of this preprint also exists.

Submitted:

24 July 2023

Posted:

27 July 2023

You are already at the latest version

Abstract
In this paper, we design two inertial-type subgradient extragradient algorithms with line-search process for solving the pseudomonotone variational inequality problems (VIPs) and common fixed-point problem (CFPP) of finite Bregman relatively nonexpansive mapping and a Bregman relatively demicontractive mapping in p-uniformly convex and uniformly smooth Banach spaces, which are more general than Hilbert spaces. Under mild conditions, we derive weak and strong convergence of the suggested algorithms to a common solution of the VIPs and CFPP, respectively. Additionally, an illustrated example is furnished to back up the feasibility and implementability of our proposed methods.
Keywords: 
;  ;  ;  ;  ;  

1. Introduction

Suppose that ( H , · , · ) is a real Hilbert space with the induced norm · . Let P C be the metric projection from H onto a nonempty, convex and closed C H . Given a nonlinear operator S : C C . We denote by Fix ( S ) the fixed-point set of S. Also, the R , and ⇀ are used to represent the set of all real numbers, the strong convergence and the weak convergence, respectively. A mapping S : C C is said to be strictly pseudocontractive (see [1]) if ξ [ 0 , 1 ) s.t. S x S y 2 x y 2 + ξ ( I S ) x ( I S ) y 2 x , y C . In particular, in case ξ = 0 , S reduces to a nonexpansive mapping. Moreover, S is said to be demicontractive if Fix ( S ) and ξ [ 0 , 1 ) s.t. S x y 2 x y 2 + ξ x S x 2 x C , y Fix ( S ) . In particular, in case ξ = 0 , S reduces to a quasi-nonexpansive mapping.
Let A : H H be a mapping. Consider the classical variational inequality problem (VIP) of finding u C s.t. A u , v u 0 v C . The solution set of the VIP is denoted by VI ( C , A ) . In 1976, to seek an element of VI ( C , A ) under weaker conditions, Korpelevich [24] put forward the extragradient approach below, i.e., for any initial x 0 C , the sequence { x n } is generated by
y n = P C ( x n τ A x n ) , x n + 1 = P C ( x n τ A y n ) n 0 ,
with τ ( 0 , 1 L ) . If VI ( C , A ) , then the sequence { x n } converges weakly to an element in VI ( C , A ) . To the best of our knowledge, the Korpelevich extragradient approach is one of the most effective methods for solving the VIP at present. The literature on the VIP is vast and the Korpelevich extragradient approach has attained wide attention paid by many scholars, who ameliorated it in various forms; see e.g., [1-6, 8-9, 13-16, 19, 21-23, 25-28, 31, 34].
Furthermore, in 2018, Thong and Hieu [21] first put forward the inertial subgradient extragradient method, that is, for any initial x 0 , x 1 H , the sequence { x n } is generated by
u n = x n + α n ( x n x n 1 ) , y n = P C ( u n A u n ) , C n = { v H : u n A u n y n , v y n 0 } , x n + 1 = P C n ( u n A y n ) n 1 , with constant ( 0 , 1 L ) . Under suitable conditions, they proved the weak convergence of { x n } to an element of VI ( C , A ) . Subsequently, Ceng et al. [14] introduced a modified inertial subgradient extragradient method for solving the pseudomonotone VIP and common fixed point problem (CFPP) of finite nonexpansive mappings. Let S i : H H be nonexpansive for i = 1 , . . . , N , A : H H be L-Lipschitz continuous pseudomonotone on H, and sequentially weakly continuous on C, s.t. Ω = i = 1 N Fix ( S i ) VI ( C , A ) . Let f : H H be a contraction with constant δ [ 0 , 1 ) and F : H H be η -strongly monotone and κ -Lipschitzian s.t. δ < τ : = 1 1 ρ ( 2 η ρ κ 2 ) for ρ ( 0 , 2 η / κ 2 ) . Presume that { β n } , { γ n } , { τ n } are positive sequences s.t. β n + γ n < 1 , n = 1 β n = , lim n β n = 0 , lim inf n γ n ( 1 γ n ) > 0 and τ n = o ( β n ) . Moreover, one writes S n : = S n mod N for integer n 1 with the mod function taking values in the set { 1 , . . . , N } , i.e., if n = j N + m for some integers j 0 and 0 m < N , then S n = S N if m = 0 and S n = S m if 0 < m < N .
Algorithm 1.1 (see [14, Algorithm 3.1]). Initialization: Given λ 1 > 0 , α > 0 , μ ( 0 , 1 ) . Let x 0 , x 1 H be arbitrary.
Iterative steps: Calculate x n + 1 as follows:
Step 1. Given the iterates x n 1 and x n ( n 1 ) , choose α n s.t. 0 α n α n ¯ , where
α n ¯ = min { α , τ n x n x n 1 } if x n x n 1 , α otherwise .
Step 2. Compute w n = S n x n + α n ( S n x n S n x n 1 ) and y n = P C ( w n λ n A w n ) .
Step 3. Construct the half-space C n : = { z H : w n λ n A w n y n , z y n 0 } , and compute z n = P C n ( w n λ n A y n ) .
Step 4. Calculate x n + 1 = β n f ( x n ) + γ n x n + ( ( 1 γ n ) I β n ρ F ) z n , and update
λ n + 1 = min { μ w n y n 2 + z n y n 2 2 A w n A y n , z n y n , λ n } A w n A y n , z n y n > 0 , λ n otherwise .
Set n : = n + 1 and go to Step 1.
Under appropriate conditions, they proved the strong convergence of { x n } to an element of Ω = i = 1 N Fix ( S i ) VI ( C , A ) . In addition, combining the subgradient extragradient method and the Halpern’s iteration method, Kraikaew and Saejung [22] proposed the Halpern subgradient extragradient rule for solving the VIP in 2014. They proved the strong convergence of the proposed method to an element in VI ( C , A ) . Recently, Reich et al. [27] introduced two gradient-projection algorithms for solving the VIP for uniformly continuous pseudomonotone mapping. In particular, they used a novel Armijo-type line search to acquire a hyperplane which strictly separates the current iterate from the solutions of the VIP under consideration. They proved the weak and strong convergence of two algorithms to a solution of the VIP for uniformly continuous pseudomonotone mapping, respectively.
On the other hand, let p , q ( 1 , ) with 1 p + 1 q = 1 , let E be a p-uniformly convex and uniformly smooth Banach space and C be a convex, closed and nonempty set in E. We denote by E * the dual space of E. The norm and the duality pairing between E and E * are denoted by · and · , · , respectively. Let J E p and J E * q be the duality mappings of E and E * , respectively. Let f p ( u ) = u p / p u E , D f p be the Bregman distance with respect to (w.r.t) f p and Π C be the Bregman projection of E onto C w.r.t. f p , and presume that { α n } , { β n } ( 0 , 1 ) s.t. lim n α n = 0 , lim inf n β n ( 1 β n ) > 0 and n = 1 α n = . Assume that A : E E * is uniformly continuous and pseudo-monotone mapping and S : C C is Bregman relatively nonexpansive mapping. Very recently, inspired by the research outcomes in [27], Eskandani et al. [31] invented the hybrid projection method with line-search process for seeking a solution of the VIP with the FPP constraint of S.
Algorithm 1.2 (see [31]). Initialization: Let ν > 0 , l ( 0 , 1 ) , λ ( 0 , 1 ν ) , and put u , u 1 C arbitrarily.
Iterative steps: Given the current iterate u n , calculate u n + 1 below:
Step 1. Compute v n = Π C ( J E * q ( J E p u n λ A u n ) ) and r λ ( u n ) : = u n v n . If r λ ( u n ) = 0 and S u n = u n , then stop; u n Ω = Fix ( S ) VI ( C , A ) . Otherwise,
Step 2. Compute t n = u n τ n r λ ( u n ) , where τ n : = l k n and k n is the smallest nonnegative integer k satisfying A u n A ( u n l k r λ ( u n ) ) , r λ ( u n ) ν 2 D f p ( u n , v n ) .
Step 3. Compute w n = J E * q ( β n J E p u n + ( 1 β n ) J E p ( S Π C n u n ) ) and u n + 1 = Π C ( J E * q ( α n J E p u + ( 1 α n ) J E p w n ) ) , where C n : = { v C : n ( v ) 0 } and n ( v ) = A t n , v u n + τ n 2 λ D f p ( u n , v n ) .
Again set n : = n + 1 and return to Step 1.
Under suitable conditions, they proved the strong convergence of Algorithm 1.2 to Π Ω u . Inspired by the above research outcomes, we design two inertial-type subgradient extragradient algorithms with line-search process for solving the pseudomonotone variational inequality problems (VIPs) and common fixed-point problem (CFPP) of finite Bregman relatively nonexpansive mappings and a Bregman relatively demicontractive mapping in p-uniformly convex and uniformly smooth Banach spaces. Under mild conditions, we prove weak and strong convergence of the suggested algorithms to a common solution of the VIPs and CFPP, respectively. Additionally, an illustrated example is furnished to back up the feasibility and implementability of our proposed approaches.
The structure of this paper is built below: In Sect. 2, we release some concepts and basic results for further use. In Sect. 3, we discuss the convergence analysis of the suggested algorithms. In Sect. 4, our main results are employed to solve the VIPs and CFPP in an illustrated example. Our algorithms are more advantageous and more flexible than the above Algorithms 1.1-1.2 because they involve solving the VIPs for uniformly continuous pseudomonotone mappings and the CFPP of finite Bregman relatively nonexpansive mappings and a Bregman relatively demicontractive mapping. Our results improve and extend the corresponding results announced by some others, e.g., Ceng et al. [14], Eskandani et al. [31] and Reich et al. [27].

2. Preliminaries

Let ( E , · ) be a real Banach space, whose dual is denoted by E * . We use the u n u and u n u to indicate the strong and weak convergence of { u n } to u E , respectively. Moreover, the set of weak cluster points of { u n } is denoted by ω w ( u n ) , i.e., ω w ( u n ) = { u E : u n k u for some { u n k } { u n } } . Let U = { u E : u = 1 } and 1 < q 2 p with 1 p + 1 q = 1 . A Banach space E is referred to as being strictly convex if for each u , v U with u v , one has u + v / 2 < 1 . E is referred to as being uniformly convex if ϵ ( 0 , 2 ] , δ > 0 s.t. u , v U with u v ϵ , one has u + v / 2 1 δ . It is known that a uniformly convex Banach space is reflexive and strictly convex. The modulus of convexity of E is the function δ : [ 0 , 2 ] [ 0 , 1 ] defined by δ ( ϵ ) = inf { 1 u + v / 2 : u , v U with u v ϵ } . It is also known that E is uniformly convex if and only if δ ( ϵ ) > 0 ϵ ( 0 , 2 ] . Moreover, E is referred to as being p-uniformly convex if c > 0 s.t. δ ( ϵ ) c ϵ p ϵ [ 0 , 2 ] .
The modulus of smoothness ρ E : [ 0 , ) [ 0 , ) is defined as ρ E ( τ ) = sup { ( u + τ v + u τ v ) / 2 1 : u , v U } . E is said to be uniformly smooth if lim τ 0 ρ E ( τ ) / τ = 0 , and q-uniformly smooth if C q > 0 s.t. ρ E ( τ ) C q τ q τ > 0 . It is known that E is p-uniformly convex if and only if E * is q-uniformly smooth. For example, see [32] for more details. Putting B ( 0 , r ) = { u E : u r } for each r > 0 , we say that f : E R is uniformly convex on bounded sets (see [31]) if ρ r ( t ) > 0 r , t > 0 , where ρ r ( t ) : [ 0 , ) [ 0 , ] is specified below
ρ r ( t ) = inf { [ α f ( u ) + ( 1 α ) f ( v ) f ( α u + ( 1 α ) v ) ] / α ( 1 α ) : α ( 0 , 1 ) and u , v B ( 0 , r ) with u v = t } , for all t 0 . The function ρ r is called the gauge of uniform convexity of f. It is known that ρ r is a nondecreasing function.
Let f : E R be a convex function. If the limit lim t 0 + f ( u + t v ) f ( u ) t exists for each v E , then f is referred to as being Gâteaux differentiable at u. In this case, the gradient of f at u is the linear function f ( u ) , which is defined by f ( u ) , v : = lim t 0 + f ( u + t v ) f ( u ) t for each v E . The function f is referred to as being Gâteaux differentiable if it is Gâteaux differentiable at each u E . Whenever the limit lim t 0 + f ( u + t v ) f ( u ) t is attained uniformly for any v U , we say that f is Fréchet differentiable at u. Besides, f is referred to as being uniformly Fréchet differentiable on a subset K E if the limit lim t 0 + f ( u + t v ) f ( u ) t is attained uniformly for ( u , v ) K × U . A Banach space E is called smooth if its norm is Gâteaux differentiable.
Let p , q ( 1 , ) with 1 p + 1 q = 1 . The duality mapping J E p : E E * is specified below
J E p ( u ) = { ψ E * : ψ , u = u p and ψ = u p 1 } u E .
It is known that E is smooth if and only if J E p is single-valued mapping of E into E * . Also, E is reflexive if and only if J E p is surjective, and E is strictly convex if and only if J E p is one-to-one. So it follows that, if E is smooth, strictly convex and reflexive Banach space, then J E p is a single-valued bijection and in this case, J E p = ( J E * q ) 1 where J E * q is the duality mapping of E * . Besides, it is known that E is uniformly smooth if and only if the function f p ( u ) = u p / p is uniformly Fréchet differentiable on bounded sets if and only if J E p is single-valued and uniformly continuous on bounded sets. It is also known that E is uniformly convex if and only if the function f p is uniformly convex (see [32]).
Let f : E R be a Gâteaux differentiable convex function. The Bregman distance w.r.t. f is specified below
D f ( u , v ) : = f ( u ) f ( v ) f ( v ) , u v u , v E .
It is worth mentioning that the Bregman distance is not a metric in the usual sense of the term. Clearly, D f ( u , u ) = 0 but D f ( u , v ) = 0 can not yield u = v . Generally, D f is not symmetric and does not satisfy the triangle inequality. However, D f satisfies the three point identity
D f ( u , v ) + D f ( v , w ) = D f ( u , w ) f ( v ) f ( w ) , u v .
See [20] for more details on Bregman functions and distances.
It is noteworthy that the duality mapping J E p on the smooth Banach space E is the Gâteaux derivative of the function f p . Then the Bregman distance w.r.t. f p is specified below
D f p ( u , v ) = u p / p v p / p J E p ( v ) , u v = u p / p + v p / q J E p ( v ) , u = ( v p u p ) / q J E p ( v ) J E p ( u ) , u .
In the smooth and p-uniformly convex Banach space E with 2 p < , there holds the following relationship between the metric and Bregman distance:
τ u v p D f p ( u , v ) J E p ( u ) J E p ( v ) , u v , ( 2.1 )
where τ > 0 is some fixed number (see [12]). From (2.1) it is readily known that for any bounded sequence { u n } E , the following holds:
u n u D f p ( u , u n ) 0 ( n ) .
Let C be a nonempty closed convex subset of reflexive, smooth and strictly convex Banach space E. Bregman projections are defined as minimizers of Bregman distances. The Bregman projection of u E onto C w.r.t. f p is the unique element Π C u C s.t. D f p ( Π C u , u ) = min v C D f p ( v , u ) . In Hilbert spaces the Bregman projection w.r.t. f 2 reduces to the metric projection. Using [18, Corollary 4.4] and [30, Theorem 2.1], in uniformly convex Banach spaces Bregman projections can be characterized by the following inequality:
J E p ( u ) J E p ( Π C u ) , v Π C u 0 v C . ( 2.2 )
Moreover, this inequality is equivalent to the descent property
D f p ( v , Π C u ) + D f p ( Π C u , u ) D f p ( v , u ) v C . ( 2.3 )
In case p = 2 , the duality mapping J E p reduces to the normalized duality mapping and is denoted by J. The function ϕ : E 2 R is formulated below
ϕ ( u , v ) = u 2 2 J v , u + v 2 u , v E ,
and Π C ( u ) = argmin v C ϕ ( v , u ) u E .
In terms of [31], the function V f p : E × E * [ 0 , ) associated with f p is specified below
V f p ( u , u * ) = u p / p u * , u + u * q / q ( u , u * ) E × E * . ( 2.4 )
So, V f p ( u , u * ) = D f p ( u , J E * q ( u * ) ) ( u , u * ) E × E * . Moreover, by the subdifferential inequality, we obtain
V f p ( u , u * ) + v * , J E * q ( u * ) u V f p ( u , u * + v * ) u E , u * , v * E * . ( 2.5 )
In addition, V f p is convex in the second variable. Thus one has
D f p ( z , J E * q ( i = 1 n t i J E p ( u i ) ) ) i = 1 n t i D f p ( z , u i ) z E , { u i } i = 1 n E , { t i } i = 1 n [ 0 , 1 ] with i = 1 n t i = 1 . ( 2.6 )
Lemma 2.1 (see [30]). Let E be a uniformly convex Banach space and { u n } , { v n } be two sequences in E such that the first one is bounded. If lim n D f p ( v n , u n ) = 0 , then lim n v n u n = 0 .
Let S : C C be a mapping. We denote by Fix ( S ) the set of fixed points of S, that is, Fix ( S ) = { u C : u = S u } . A point u C is referred to as an asymptotic fixed point of S if { u n } C s.t. u n u and u n S u n 0 . We denote by Fix ^ ( S ) the set of asymptotic fixed points of S. The notion of asymptotic fixed points was invented in Reich [11]. A mapping S : C C is known as being Bregman relatively ξ -demicontractive w.r.t. f p if Fix ( S ) = Fix ^ ( S ) , and ξ [ 0 , 1 ) s.t. for each bounded { v n } C satisfying sup n 1 S v n < , the following holds:
D f p ( u , S v n ) D f p ( u , v n ) + ξ ρ b * J E p v n J E p S v n u Fix ( S ) ,
with b = sup n 1 { v n p 1 , S v n p 1 } < . In particular, putting b x = max { x p 1 , S x p 1 } for each x C , one has
D f p ( u , S x ) D f p ( u , x ) + ξ ρ b x * J E p x J E p S x u Fix ( S ) .
In addition, if ξ = 0 , then S reduces to a Bregman relatively nonexpansive mapping w.r.t. f p , that is, S is said to be Bregman relatively nonexpansive w.r.t. f p if Fix ( S ) = Fix ^ ( S ) and D f p ( u , S v ) D f p ( u , v ) v C , u Fix ( S ) .
Definition 2.1. Let C be a nonempty closed convex subset of E. A mapping A : C E * is referred to as being
(i) monotone on C if A u A v , u v 0 u , v C ;
(ii) pseudo-monotone if A u , v u 0 A v , v u 0 u , v C ;
(iii)L-Lipschitz continuous or L-Lipschitzian if L > 0 s.t. A u A v L u v u , v C ;
(iv) weakly sequentially continuous if for each { x n } C , the relation holds: x n x A x n A x .
Lemma 2.2 (see [31]). Let r > 0 be a constant and suppose that f : E R is a uniformly convex function on bounded subsets of a Banach space E. Then
f ( k = 1 n α k x k ) k = 1 n α k f ( x k ) α i α j ρ r ( x i x j ) ,
i , j { 1 , 2 , . . . , n } , { x k } k = 1 n B ( 0 , r ) and { α k } k = 1 n ( 0 , 1 ) with k = 1 n α k = 1 , where ρ r is the gauge of uniform convexity of f.
Proof. It is easy to show the conclusion.
Lemma 2.3 (see [28]). Let E 1 and E 2 be two Banach spaces. Suppose that A : E 1 E 2 is uniformly continuous on bounded subsets of E 1 and D is a bounded subset of E 1 . Then A ( D ) is bounded.
Lemma 2.4 (see [10]). Let C E with C being closed and convex in a Banach space E and suppose A : C E * is pseudo-monotone and continuous. Then x C is a solution to the VIP A x , y x 0 y C , if and only if A y , y x 0 y C .
Lemma 2.5. Let 2 p < and suppose that E is a smooth and p-uniformly convex Banach space with the weakly sequentially continuous duality mapping J E p . Let { q n } E and Ω E . If { D f p ( x , q n ) } converges for each x Ω , and ω w ( q n ) Ω . Then { q n } converges weakly to a point in Ω .
Proof. 
Using (2.1) we get τ x q n p D f p ( x , q n ) x Ω . This ensures that { q n } is bounded. Hence, from the reflexivity of E we have ω w ( q n ) . Also, let us show the weak convergence of { q n } to a point in Ω . Indeed, let q ¯ , q ^ ω w ( q n ) with q ¯ q ^ . Then, { q n k } { q n } and { q m k } { q n } s.t. q n k q ¯ and q m k q ^ . By the weakly sequential continuity of J E p one deduces that J E p ( q n k ) J E p q ¯ and J E p ( q m k ) J E p q ^ . Note that D f p ( q ¯ , q ^ ) + D f p ( q ^ , q n ) = D f p ( q ¯ , q n ) J E p q ^ J E p q n , q ¯ q ^ . So, exploiting the convergence of the sequences { D f p ( q ¯ , q n ) } and { D f p ( q ^ , q n ) } , we deduce that
J E p q ^ J E p q ¯ , q ¯ q ^ = lim k [ J E p q ^ J E p q n k , q ¯ q ^ ] = lim n [ D f p ( q ¯ , q ^ ) + D f p ( q ^ , q n ) D f p ( q ¯ , q n ) ] = lim k [ J E p q ^ J E p q m k , q ¯ q ^ ] = J E p q ^ J E p q ^ , q ¯ q ^ = 0 ,
which hence yields J E p q ¯ J E p q ^ , q ¯ q ^ = 0 . From (2.1) we get 0 < τ q ¯ q ^ p D f p ( q ¯ , q ^ ) J E p q ¯ J E p q ^ , q ¯ q ^ = 0 . This arrives at a contradiction. Consequently, the sequence { q n } converges weakly to a point in Ω . □
The lemma below was put forth in R m by [29]. It is easy to verify that the proof of the lemma in Banach spaces is actually the same as in R m . Here, we present the lemma but omit the proof in Banach spaces.
Lemma 2.6. Let C E with C being closed and convex in a Banach space E. Suppose that K : = { x C : h ( x ) 0 } where h is a real-valued function on E. If K and h is Lipschitz continuous on C with modulus θ > 0 , then θ dist ( x , K ) max { h ( x ) , 0 } x C , where dist ( x , K ) stands for the distance of x to K.
Lemma 2.7 (see [17]). Let { Γ n } be a sequence of real numbers that does not decrease at infinity in the sense that, { Γ n k } { Γ n } s.t. Γ n k < Γ n k + 1 k 1 . Let the sequence { ψ ( n ) } n n 0 of integers be defined as ψ ( n ) = max { k n : Γ k < Γ k + 1 } , with integer n 0 1 satisfying { k n 0 : Γ k < Γ k + 1 } . Then the following hold:
(i) ψ ( n 0 ) ψ ( n 0 + 1 ) and ψ ( n ) ;
(ii) Γ ψ ( n ) Γ ψ ( n ) + 1 and Γ n Γ ψ ( n ) + 1 n n 0 .
Lemma 2.8 (see [7]). Let { a n } be a sequence in [ 0 , ) satisfying a n + 1 ( 1 μ n ) a n + μ n ν n n 1 , where { μ n } and { ν n } both are real sequences such that (i) { μ n } [ 0 , 1 ] and n = 1 μ n = , and (ii) lim sup n ν n 0 or n = 1 | μ n ν n | < . Then lim n a n = 0 .
Lemma 2.9 (see [33]). Let { a n } , { b n } and { δ n } be sequences of nonnegative real numbers satisfying the inequality a n + 1 ( 1 + δ n ) a n + b n n 1 . If n = 1 δ n < and n = 1 b n < , then lim n a n exists.

3. Main Results

In this section, let E be a p-uniformly convex and uniformly smooth Banach space with 2 p < . Let C E with C being closed and convex in E. We are now in a position to state and analyze our iterative algorithms for settling the VIPs for uniformly continuous pseudomonotone mappings and the CFPP of finite Bregman relatively nonexpansive mappings and a Bregman relatively demicontractive mapping in E. Assume always that the conditions hold below:
(C1) For i = 1 , . . . , N , S i : C C is a uniformly continuous and Bregman relatively nonexpansive mapping and S 0 : C C is a uniformly continuous and Bregman relatively ξ -demicontractive mapping.
(C2) { S n } n = 1 is defined as S n : = S n mod N for integer n 1 with the mod function taking values in the set { 1 , . . . , N } , i.e., if n = j N + m for some integers j 0 and 0 m < N , then S n = S N if m = 0 and S n = S m if 0 < m < N .
(C3) For i = 1 , 2 , A i : E E * is pseudomonotone and uniformly continuous on C, s.t. A i x lim inf n A i x n { x n } C with x n x .
(C4) Ω = ( i = 1 2 VI ( C , A i ) ) ( i = 0 N Fix ( S i ) ) .
Algorithm 3.1. Initialization: Given x 0 , x 1 C arbitrarily and let ϵ > 0 , μ i > 0 , λ i ( 0 , 1 μ i ) , l i ( 0 , 1 ) for i = 1 , 2 . Choose { n } , { β n } ( 0 , 1 ) and { α n } ( ξ , 1 ) s.t. n = 1 n < , lim inf n β n ( 1 β n ) > 0 and lim inf n ( α n ξ ) ( 1 α n ) > 0 . Moreover, given the iterates x n 1 and x n ( n 1 ) , choose ϵ n s.t. 0 ϵ n ϵ n ¯ , where
ϵ n ¯ = min { ϵ , n J E p S n x n J E p ( 2 S n x n S n x n 1 ) } if S n x n S n x n 1 , ϵ otherwise .
Iterative steps: Calculate x n + 1 as follows:
Step 1. Calculate g n = J E * q ( ( 1 ϵ n ) J E p S n x n + ϵ n J E p ( 2 S n x n S n x n 1 ) ) and calculate u n = J E * q ( β n J E p x n + ( 1 β n ) J E p g n ) , y n = Π C ( J E * q ( J E p u n λ 1 A 1 u n ) ) , r λ 1 ( u n ) : = u n y n and s n = u n τ n r λ 1 ( u n ) , where τ n : = l 1 k n and k n is the smallest nonnegative integer k satisfying
A 1 u n A 1 ( u n l 1 k r λ 1 ( u n ) ) , u n y n μ 1 2 D f p ( u n , y n ) . ( 3.1 )
Step 2. Calculate w n = Π C n ( u n ) , with C n : = { x C : h n ( x ) 0 } and
h n ( x ) = A 1 s n , x u n + τ n 2 λ 1 D f p ( u n , y n ) . ( 3.2 )
Step 3. Calculate y ˜ n = Π C ( J E * q ( J E p w n λ 2 A 2 w n ) ) , r λ 2 ( w n ) : = w n y ˜ n and t n = w n τ ˜ n r λ 2 ( w n ) , where τ ˜ n : = l 2 j n and j n is the smallest nonnegative integer j satisfying
A 2 w n A 2 ( w n l 2 j r λ 2 ( w n ) ) , w n y ˜ n μ 2 2 D f p ( w n , y ˜ n ) . ( 3.3 )
Step 4. Calculate v n = J E * q ( α n J E p w n + ( 1 α n ) J E p ( S 0 w n ) ) and x n + 1 = Π C ˜ n Q n ( w n ) , where Q n : = { x C : D f p ( x , v n ) D f p ( x , w n ) } , C ˜ n : = { x C : h ˜ n ( x ) 0 } and
h ˜ n ( x ) = A 2 t n , x w n + τ ˜ n 2 λ 2 D f p ( w n , y ˜ n ) . ( 3.4 )
Again set n : = n + 1 and go to Step 1.
The following lemmas are used in the proofs of our main results in the sequel.
Lemma 3.1. Suppose that { x n } is the sequence constructed in Algorithm 3.1. Then the relations hold: 1 λ 1 D f p ( u n , y n ) A 1 u n , r λ 1 ( u n ) and 1 λ 2 D f p ( w n , y ˜ n ) A 2 w n , r λ 2 ( w n ) .
Proof. 
Observe that the last two relations are similar. Then it suffices to show that the latter relation holds. In fact, using the definition of y ˜ n and properties of Π C , one has
J E p w n λ 2 A 2 w n J E p y ˜ n , y y ˜ n 0 y C .
Setting y = w n in the last inequality, from (2.1) we get
D f p ( w n , y ˜ n ) J E p w n J E p y ˜ n , w n y ˜ n λ 2 A 2 w n , w n y ˜ n .
This completes the proof. □
Lemma 3.2. The Armijo-type search rules (3.1), (3.3) and the sequence { x n } constructed in Algorithm 3.1 are well defined.
Proof. 
Observe that the rules (3.1) and (3.3) are similar. Then it suffices to show that the latter rule (3.3) is valid. Using the uniform continuity of A 2 on C, from l 2 ( 0 , 1 ) one gets lim j A 2 w n A 2 ( w n l 2 j r λ 2 ( w n ) ) , r λ 2 ( w n ) = 0 . In case r λ 2 ( w n ) = 0 , it is evident that j n = 0 . In case r λ 2 ( w n ) 0 , we know that j n 0 s.t. (3.3) holds.
It is easy to check that for each n 1 , C ˜ n and Q n are convex and closed. We assert that Ω C ˜ n Q n . Let z Ω = ( i = 1 2 VI ( C , A i ) ) ( i = 0 N Fix ( S i ) ) . Using Lemma 2.2 and the Bregman relative ξ -demicontractivity of S 0 , from { α n } ( ξ , 1 ) we get
D f p ( z , v n ) α n D f p ( z , w n ) + ( 1 α n ) D f p ( z , S 0 w n ) α n ( 1 α n ) ρ b w n * J E P w n J E P S 0 w n α n D f p ( z , w n ) + ( 1 α n ) [ D f p ( z , w n ) + ξ ρ b w n * J E P w n J E P S 0 w n ] α n ( 1 α n ) ρ b w n * J E P w n J E P S 0 w n = D f p ( z , w n ) ( α n ξ ) ( 1 α n ) ρ b w n * J E P w n J E P S 0 w n D f p ( z , w n ) ,
which hence leads to z Q n . Moreover, by Lemma 2.4, we get A 2 t n , t n z 0 . Therefore,
h ˜ n ( z ) = A 2 t n , z w n + τ ˜ n 2 λ 2 D f p ( w n , y ˜ n ) = A 2 t n , w n t n A 2 t n , t n z + τ ˜ n 2 λ 2 D f p ( w n , y ˜ n ) τ ˜ n A 2 t n , r λ 2 ( w n ) + τ ˜ n 2 λ 2 D f p ( w n , y ˜ n ) . ( 3.5 )
So it follows from (3.3) that
A 2 w n A 2 t n , r λ 2 ( w n ) μ 2 2 D f p ( w n , y ˜ n ) .
Using Lemma 3.1 we have
A 2 t n , r λ 2 ( w n ) A 2 w n , r λ 2 ( w n ) μ 2 2 D f p ( w n , y ˜ n ) ( 1 λ 2 μ 2 2 ) D f p ( w n , y ˜ n ) .
This together with (3.5), arrives at
h ˜ n ( z ) τ ˜ n 2 ( 1 λ 2 μ 2 ) D f p ( w n , y ˜ n ) 0 .
Consequently, Ω C ˜ n Q n . So, the sequence { x n } is well defined. □
Lemma 3.3. Suppose that { y n } and { y ˜ n } are the sequences generated by Algorithm 3.1. If lim n u n y n = 0 and lim n w n y ˜ n = 0 , then ω w ( u n ) VI ( C , A 1 ) and ω w ( w n ) VI ( C , A 2 ) .
Proof. 
Observe that the last two inclusions are similar. Then it suffices to show that the latter inclusion is valid. In fact, let z ω w ( w n ) . Then, { w n k } { w n } , s.t. w n k z and lim n w n k y ˜ n k = 0 . Hence, it is known that y ˜ n k z . Since C is of both convexity and closedness, from { y ˜ n } C and y ˜ n k z we get z C . Next, we consider two cases. If A 2 z = 0 , then z VI ( C , A 2 ) because A 2 z , y z 0 y C . If A 2 z 0 , using the assumption on A 2 , instead of the weakly sequential continuity of A 2 , we get 0 < A 2 z lim inf k A 2 w n k . So, we could assume that A 2 w n k 0 k 1 . From (2.2), we get
J E p w n k λ 2 A 2 w n k J E p y ˜ n k , x y ˜ n k 0 x C ,
and hence
1 λ 2 J E p w n k J E p y ˜ n k , x y ˜ n k + A 2 w n k , y ˜ n k w n k A 2 w n k , x w n k x C . ( 3.6 )
According to the uniform continuity of A 2 , one knows that { A 2 w n k } is bounded by Lemma 2.3. Note that { y ˜ n k } is bounded as well. So, using the uniform continuity of J E p on bounded subsets of E, from (3.6) we have
lim inf k A 2 w n k , x w n k 0 x C . ( 3.7 )
To prove that z VI ( C , A 2 ) , we now pick a sequence { ε ˜ k } ( 0 , 1 ) satisfying ε ˜ k 0 as k . For each k 1 , we denote by l k the smallest positive integer such that
A 2 w n j , y w n j + ε ˜ k 0 j l k . ( 3.8 )
Because { ε ˜ k } is decreasing, it is easily known that { l k } is increasing. For convenience, we still denote { A 2 w n l k } by { A 2 w l k } . Note that A 2 w l k 0 k 1 (due to { A 2 w l k } { A 2 w n k } ). Then, putting g ˜ l k = A 2 w l k A 2 w l k q q 1 , one gets A 2 w l k , J E * q g ˜ l k = 1 k 1 . Indeed, it is evident that A 2 w l k , J E * q g ˜ l k = A 2 w l k , ( 1 A 2 w l k q q 1 ) q 1 J E * q A 2 w l k = ( 1 A 2 w l k q q 1 ) q 1 A 2 w l k q = 1 k 1 . So, by (3.8) one has A 2 w l k , y + ε ˜ k J E * q g ˜ l k w l k 0 k 1 . Again from the pseudomonotonicity of A 2 one has
A 2 ( y + ε ˜ k J E * q g ˜ l k ) , y + ε ˜ k J E * q g ˜ l k w l k 0 y C . ( 3.9 )
We assert that lim k ε ˜ k J E * q g ˜ l k = 0 . Indeed, since { w l k } { w n k } and ε ˜ k 0 as k , it follows that
0 lim sup k ε ˜ k J E * q g ˜ l k = lim sup k ε ˜ k A 2 w l k lim sup k ε ˜ k lim inf k A 2 w n k = 0 .
Hence one gets ε ˜ k J E * q g ˜ l k 0 as k . Thus, taking the limit as k in (3.9), by condition (C2) we have A 2 y , y z 0 y C . By Lemma 2.4 one obtains z VI ( C , A 2 ) . □
Lemma 3.4. Suppose that { y n } and { y ˜ n } are the sequences generated by Algorithm 3.1. Then the following hold:
(i) lim n τ n D f p ( u n , y n ) = 0 lim n D f p ( u n , y n ) = 0 ;
(ii) lim n τ ˜ n D f p ( w n , y ˜ n ) = 0 lim n D f p ( w n , y ˜ n ) = 0 .
Proof. 
Observe that the assertions (i) and (ii) are similar. Then it suffices to show that assertion (ii) is valid. To verify assertion (ii), we consider two cases. In case lim inf n τ ˜ n > 0 , we might presume that τ ˜ > 0 s.t. τ ˜ n τ ˜ > 0 n 1 , which hence arrives at
D f p ( w n , y ˜ n ) = 1 τ ˜ n τ ˜ n D f p ( w n , y ˜ n ) 1 τ ˜ · τ ˜ n D f p ( w n , y ˜ n ) . ( 3.10 )
This together with lim n τ ˜ n D f p ( w n , y ˜ n ) = 0 , leads to lim n D f p ( w n , y ˜ n ) = 0 .
In case lim inf n τ ˜ n = 0 , we presume that lim sup n D f p ( w n , y ˜ n ) = a 2 > 0 . Then we know that { n k } { n } s.t.
lim k τ ˜ n k = 0 and lim k D f p ( w n k , y ˜ n k ) = a 2 > 0 .
We define t n k ^ = 1 l 2 τ ˜ n k y ˜ n k + ( 1 1 l 2 τ ˜ n k ) w n k for each k 1 . Applying (2.1) and noticing lim k τ ˜ n k D f p ( w n k , y ˜ n k ) = 0 , we have lim k τ ˜ n k w n k y ˜ n k p = 0 and hence
lim k t n k ^ w n k p = lim k τ ˜ n k p 1 l 2 p · τ ˜ n k w n k y ˜ n k p = 0 . ( 3.11 )
Because A 2 is uniformly continuous on bounded subsets of C, we obtain
lim k A 2 w n k A 2 t n k ^ = 0 . ( 3.12 )
From the step size rule (3.3) and the definition of t n k ^ , it follows that
A 2 w n k A 2 t n k ^ , w n k y ˜ n k > μ 2 2 D f p ( w n k , y ˜ n k ) . ( 3.13 )
Now, taking the limit as k , from (3.12) we have lim k D f p ( w n k , y ˜ n k ) = 0 . This, however, reaches a contradiction. So it follows that lim n D f p ( w n , y ˜ n ) = 0 . □
Now, we are ready to prove the weak convergence theorem.
Theorem 3.1. Suppose that E is a p-uniformly convex and uniformly smooth Banach space with the weakly sequentially continuous duality mapping J E p . If { x n } is the sequence generated by Algorithm 3.1, then x n z Ω sup n 0 x n < .
Proof. 
It is clear that the necessity of Theorem 3.1 is valid. Next it suffices to show that the sufficiency is valid. Assume that sup n 0 x n < . Let z Ω . It is clear that S n x n S n x n 1 J E p S n x n J E p ( 2 S n x n S n x n 1 ) . Using the definition of ϵ n , we get ϵ n J E p S n x n J E p ( 2 S n x n S n x n 1 ) n n 1 . From (2.1), (2.6) and the three point identity of D f p we get
D f p ( z , g n ) ( 1 ϵ n ) D f p ( z , S n x n ) + ϵ n D f p ( z , 2 S n x n S n x n 1 ) = D f p ( z , S n x n ) + ϵ n [ D f p ( z , 2 S n x n S n x n 1 ) D f p ( z , S n x n ) ] = D f p ( z , S n x n ) + ϵ n [ D f p ( S n x n , 2 S n x n S n x n 1 ) + J E p S n x n J E p ( 2 S n x n S n x n 1 ) , z S n x n ] D f p ( z , x n ) + ϵ n J E p S n x n J E p ( 2 S n x n S n x n 1 ) , z + S n x n 1 2 S n x n D f p ( z , x n ) + ϵ n J E p S n x n J E p ( 2 S n x n S n x n 1 ) z + S n x n 1 2 S n x n D f p ( z , x n ) + n M ,
where sup n 1 z + S n x n 1 2 S n x n M for some M > 0 . Using Lemma 2.2, we get
D f p ( z , u n ) = V f p ( z , β n J E p x n + ( 1 β n ) J E p g n ) 1 p z p β n J E p x n , z ( 1 β n ) J E p g n , z + β n q J E p x n q + ( 1 β n ) q J E p g n q β n ( 1 β n ) ρ b * J E p x n J E p g n = 1 p z p β n J E p x n , z ( 1 β n ) J E p g n , z + β n q x n p + ( 1 β n ) q g n p β n ( 1 β n ) ρ b * J E p x n J E p g n = β n D f p ( z , x n ) + ( 1 β n ) D f p ( z , g n ) β n ( 1 β n ) ρ b * J E p x n J E p g n β n D f p ( z , x n ) + ( 1 β n ) [ D f p ( z , x n ) + n M ] β n ( 1 β n ) ρ b * J E p x n J E p g n D f p ( z , x n ) + n M β n ( 1 β n ) ρ b * J E p x n J E p g n .
Since w n = Π C n u n , by (2.1) and (2.3) we get
D f p ( z , w n ) D f p ( z , u n ) D f p ( w n , u n ) = D f p ( z , u n ) D f p ( Π C n u n , u n ) D f p ( z , u n ) τ Π C n u n u n p D f p ( z , u n ) τ P C n u n u n p = D f p ( z , u n ) τ [ dist ( C n , u n ) ] p .
Because x n + 1 = Π C ˜ n Q n w n , from (2.1) and (2.3) we get
D f p ( z , x n + 1 ) D f p ( z , w n ) D f p ( x n + 1 , w n ) = D f p ( z , w n ) D f p ( Π C ˜ n Q n w n , w n ) D f p ( z , w n ) D f p ( Π C ˜ n w n , w n ) D f p ( z , w n ) τ Π C ˜ n w n w n p D f p ( z , w n ) τ P C ˜ n w n w n p = D f p ( z , w n ) τ [ dist ( C ˜ n , w n ) ] p .
Combining (3.13) and the last two inequalities, we obtain
D f p ( z , x n + 1 ) D f p ( z , w n ) D f p ( x n + 1 , w n ) D f p ( z , u n ) D f p ( w n , u n ) D f p ( x n + 1 , w n ) D f p ( z , u n ) τ [ dist ( C n , u n ) ] p τ [ dist ( C ˜ n , w n ) ] p D f p ( z , x n ) + n M β n ( 1 β n ) ρ b * J E p x n J E p g n τ [ dist ( C n , u n ) ] p τ [ dist ( C ˜ n , w n ) ] p , ( 3.14 )
which hence arrives at
D f p ( z , x n + 1 ) D f p ( z , x n ) + n M .
Since n = 1 n < , by Lemma 2.9 we deduce that lim n D f p ( z , x n ) exists. In addition, by the boundedness of { x n } , we conclude that { g n } , { u n } , { v n } , { w n } , { y n } , { y ˜ n } , { s n } , { t n } , { S n x n } and { S 0 w n } are also bounded. Using (3.14) we obtain
D f p ( w n , u n ) + D f p ( x n + 1 , w n ) D f p ( z , u n ) D f p ( z , x n + 1 ) D f p ( z , x n ) + n M β n ( 1 β n ) ρ b * J E p x n J E p g n D f p ( z , x n + 1 ) ,
which immediately yields
D f p ( w n , u n ) + D f p ( x n + 1 , w n ) + β n ( 1 β n ) ρ b * J E p x n J E p g n D f p ( z , x n ) D f p ( z , x n + 1 ) + n M .
Since lim n n = 0 , lim inf n β n ( 1 β n ) > 0 and lim n D f p ( z , x n ) exists, it follows that lim n D f p ( w n , u n ) = 0 , lim n D f p ( x n + 1 , w n ) = 0 , and lim n ρ b * J E p x n J E p g n = 0 , which hence yields lim n J E p x n J E p g n = 0 . From u n = J E * q ( β n J E p x n + ( 1 β n ) J E p g n ) , it can be readily seen that lim n J E p u n J E p x n = 0 . Noticing g n = J E * q ( ( 1 ϵ n ) J E p S n x n + ϵ n J E p ( 2 S n x n S n x n 1 ) ) , we obtain from lim n n = 0 and the definition of ϵ n that
J E p g n J E p S n x n = ϵ n J E p ( 2 S n x n S n x n 1 ) J E p S n x n n 0 ( n ) .
Hence, using (2.1) and uniform continuity of J E p on bounded subsets of E, we conclude that lim n g n S n x n = 0 and
lim n w n u n = lim n x n + 1 w n = lim n x n S n x n = lim n u n x n = 0 . ( 3.15 )
Since { x n } is bounded and E is reflexive, then we know that ω w ( x n ) . In what follows, we claim that ω w ( x n ) Ω . Let z ω w ( x n ) . Then, { x n k } { x n } s.t. x n k z . From (3.15) one gets w n k z . Since { A 1 s n } is bounded, we know that L 1 > 0 s.t. A 1 s n L 1 . This ensures that for each x , y C n ,
| h n ( x ) h n ( y ) | = | A 1 s n , x y | A 1 s n x y L 1 x y ,
which implies that h n ( x ) is L 1 -Lipschitz continuous on C n . Using Lemma 2.6, we get
dist ( C n , u n ) 1 L 1 h n ( u n ) = τ n 2 λ 1 L 1 D f p ( u n , y n ) . ( 3.16 )
Noticing x n + 1 Q n , from the definition of Q n and (3.14), we have
D f p ( x n + 1 , v n ) D f p ( x n + 1 , w n ) D f p ( z , w n ) D f p ( z , x n + 1 ) D f p ( z , u n ) D f p ( z , x n + 1 ) D f p ( z , x n ) D f p ( z , x n + 1 ) + n M .
Since lim n n = 0 and lim n D f p ( z , x n ) exists, we have lim n D f p ( x n + 1 , v n ) = 0 and hence lim n x n + 1 v n = 0 . This together with (3.15), arrives at
lim n w n v n = 0 . ( 3.17 )
On the other hand, using Lemma 2.2, we get
D f p ( z , v n ) = V f p ( z , α n J E p w n + ( 1 α n ) J E p S 0 w n ) 1 p z p α n J E p w n , z ( 1 α n ) J E p S 0 w n , z + α n q J E p w n q + ( 1 α n ) q J E p S 0 w n q α n ( 1 α n ) ρ b * J E p w n J E p S 0 w n = 1 p z p α n J E p w n , z ( 1 α n ) J E p S 0 w n , z + α n q w n p + ( 1 α n ) q S 0 w n p α n ( 1 α n ) ρ b * J E p w n J E p S 0 w n = α n D f p ( z , w n ) + ( 1 α n ) D f p ( z , S 0 w n ) α n ( 1 α n ) ρ b * J E p w n J E p S 0 w n α n D f p ( z , w n ) + ( 1 α n ) [ D f p ( z , w n ) + ξ ρ b * J E p w n J E p S 0 w n ] α n ( 1 α n ) ρ b * J E p w n J E p S 0 w n = D f p ( z , w n ) ( α n ξ ) ( 1 α n ) ρ b * J E p w n J E p S 0 w n .
Therefore,
( α n ξ ) ( 1 α n ) ρ b * J E p w n J E p S 0 w n D f p ( z , w n ) D f p ( z , v n ) D f p ( z , w n ) D f p ( z , v n ) + D f p ( w n , v n ) = J E p v n J E p w n , z w n .
Taking the limit in the last inequality as n , and using uniform continuity of J E p on bounded subsets of E, (3.17) and lim inf n ( α n ξ ) ( 1 α n ) > 0 , we get lim n ρ b * J E p w n J E p S 0 w n = 0 and hence lim n J E p w n J E p S 0 w n = 0 . This together with uniform continuity of J E * q on bounded subsets of E * implies that
lim n w n S 0 w n = 0 . ( 3.18 )
Now let us show that z i = 1 2 VI ( C , A i ) . Since { A 2 t n } is bounded, we know that L 2 > 0 s.t. A 2 t n L 2 . This ensures that for each x , y C ˜ n ,
| h ˜ n ( x ) h ˜ n ( y ) | = | A 2 t n , x y | A 2 t n x y L 2 x y ,
which guarantees that h ˜ n ( x ) is L 2 -Lipschitz continuous on C ˜ n . By Lemma 2.6, we get
dist ( C ˜ n , w n ) 1 L 2 h ˜ n ( w n ) = τ ˜ n 2 λ 2 L 2 D f p ( w n , y ˜ n ) . ( 3.19 )
Combining (3.14), (3.16) and (3.19), we obtain
D f p ( z , x n ) D f p ( z , x n + 1 ) + n M D f p ( z , u n ) D f p ( z , x n + 1 ) τ [ τ n 2 λ 1 L 1 D f p ( u n , y n ) ] p + τ [ τ ˜ n 2 λ 2 L 2 D f p ( w n , y ˜ n ) ] p . ( 3.20 )
Thus,
lim n τ n D f p ( u n , y n ) = lim n τ ˜ n D f p ( w n , y ˜ n ) = 0 .
By Lemma 3.4, we get
lim n u n y n = lim n w n y ˜ n = 0 .
Besides, combining (3.15) and x n k z guarantees that u n k z and w n k z . By Lemma 3.3 we deduce that z ω w ( u n ) VI ( C , A 1 ) and z ω w ( w n ) VI ( C , A 2 ) . Consequently,
z i = 1 2 VI ( C , A i ) .
Next we claim that z i = 0 N Fix ( S i ) . Indeed, by (3.15) we immediately get
x n + 1 x n x n + 1 w n + w n u n + u n x n 0 ( n ) . ( 3.21 )
We first claim that lim n x n S r x n = 0 for r = 1 , . . . , N . Actually, by the definition of S n , we obtain that S n { S 1 , . . . , S N } n 1 , which hence leads to S n + i { S 1 , . . . , S N } n 1 , i = 1 , . . . , N . Note that for i = 1 , . . . , N ,
x n S n + i x n x n x n + i + x n + i S n + i x n + i + S n + i x n + i S n + i x n x n x n + i + x n + i S n + i x n + i + j = 1 N S j x n + i S j x n .
Utilizing the uniform continuity of each S j on C, we deduce from (3.15) and (3.21) that x n + i S n + i x n + i 0 and S j x n + i S j x n 0 for i , j = 1 , . . . , N . Thus, we get lim n x n S n + i x n = 0 for i = 1 , . . . , N . This immediately implies that
lim n x n S r x n = 0 for r = 1 , . . . , N .
So it follows from x n k z that z Fix ^ ( S r ) = Fix ( S r ) for r = 1 , . . . , N . Therefore, z i = 1 N Fix ( S i ) . In addition, from (3.15) and x n k z , one has that w n k z . Thus, using (3.18) we get z Fix ^ ( S 0 ) = Fix ( S 0 ) . Consequently, z i = 0 N Fix ( S i ) , and hence z Ω = ( i = 1 2 VI ( C , A i ) ) ( i = 0 N Fix ( S i ) ) . This means that ω w ( x n ) Ω . As a result, applying Lemma 2.5 we conclude that x n z . □
Next, we prove a strong convergence theorem for approximating a common solution of the VIPs for uniformly continuous pseudomonotone mappings and the CFPP of finite Bregman relatively nonexpansive mappings and a Bregman relatively demicontractive mapping in E.
Algorithm 3.2. Initialization: Given x 0 , x 1 C arbitrarily and let ϵ > 0 , μ i > 0 , l i ( 0 , 1 ) and λ i ( 0 , 1 μ i ) for i = 1 , 2 . Choose { n } , { γ n } , { α n } ( 0 , 1 ) and { β n } ( ξ , 1 ) s.t. lim n n = 0 , n = 1 α n = , lim n α n = 0 , lim inf n ( β n ξ ) ( 1 β n ) > 0 and lim inf n γ n ( 1 γ n ) > 0 . Moreover, given the iterates x n 1 and x n ( n 1 ) , choose ϵ n s.t. 0 ϵ n ϵ n ¯ , where sup n 1 ϵ n α n < and
ϵ n ¯ = min { ϵ , n J E p S n x n J E p ( 2 S n x n S n x n 1 ) } if S n x n S n x n 1 , ϵ otherwise .
Iterative steps: Calculate x n + 1 as follows:
Step 1. Set g n = J E * q ( ( 1 ϵ n ) J E p S n x n + ϵ n J E p ( 2 S n x n S n x n 1 ) ) , and calculate u n = J E * q ( γ n J E p x n + ( 1 γ n ) J E p g n ) , y n = Π C ( J E * q ( J E p u n λ 1 A 1 u n ) ) , r λ 1 ( u n ) : = u n y n and s n = u n τ n r λ 1 ( u n ) , where τ n : = l 1 k n and k n is the smallest nonnegative integer k satisfying
A 1 u n A 1 ( u n l 1 k r λ 1 ( u n ) ) , u n y n μ 1 2 D f p ( u n , y n ) .
Step 2. Calculate w n = Π C n ( u n ) , with C n : = { x C : h n ( x ) 0 } and
h n ( x ) = A 1 s n , x u n + τ n 2 λ 1 D f p ( u n , y n ) .
Step 3. Calculate y ˜ n = Π C ( J E * q ( J E p w n λ 2 A 2 w n ) ) , r λ 2 ( w n ) : = w n y ˜ n and t n = w n τ ˜ n r λ 2 ( w n ) , where τ ˜ n : = l 2 j n and j n is the smallest nonnegative integer j satisfying
A 2 w n A 2 ( w n l 2 j r λ 2 ( w n ) ) , w n y ˜ n μ 2 2 D f p ( w n , y ˜ n ) .
Step 4. Set z n = Π C ˜ n ( w n ) , and calculate v n = J E * q ( β n J E p z n + ( 1 β n ) J E p ( S 0 z n ) ) and x n + 1 = Π C ( J E * q ( α n J E p u + ( 1 α n ) J E p v n ) , where C ˜ n : = { x C : h ˜ n ( x ) 0 } and
h ˜ n ( x ) = A 2 t n , x w n + τ ˜ n 2 λ 2 D f p ( w n , y ˜ n ) .
Again set n : = n + 1 and go to Step 1.
Theorem 3.2. Suppose that the conditions (C1)-(C3) hold. If { x n } is the sequence generated by Algorithm 3.2, then x n Π Ω u sup n 0 x n < .
Proof. 
It is clear that the necessity of Theorem 3.2 is valid. Next it suffices to show that the sufficiency is valid. Assume that sup n 0 x n < . In what follows, we divide our proof into four claims.
Claim 1. We show that
( 1 α n ) γ n ( 1 γ n ) ρ b * J E p x n J E p g n α n D f p ( u ^ , u ) + D f p ( z , x n ) D f p ( u ^ , x n + 1 ) + n M ,
for some M > 0 . Indeed, put u ^ = Π Ω u . Noticing w n = Π C n u n and z n = Π C ˜ n w n , we deduce from (2.1) and (2.3) that
D f p ( u ^ , w n ) D f p ( u ^ , u n ) D f p ( w n , u n ) D f p ( u ^ , u n ) τ [ dist ( C n , u n ) ] p ,
and
D f p ( u ^ , z n ) D f p ( u ^ , w n ) D f p ( z n , w n ) D f p ( u ^ , w n ) τ [ dist ( C ˜ n , w n ) ] p .
Using the same inferences as in the proof of Theorem 3.1, we know that
D f p ( u ^ , g n ) D f p ( u ^ , x n ) + ϵ n J E p S n x n J E p ( 2 S n x n S n x n 1 ) × u ^ + S n x n 1 2 S n x n D f p ( u ^ , x n ) + n M ,
where sup n 1 u ^ + S n x n 1 2 S n x n M for some M > 0 . This ensures that { g n } is bounded.
Using (2.6) and the last two inequalities, from { γ n } ( 0 , 1 ) and { β n } ( ξ , 1 ) we obtain
D f p ( u ^ , x n + 1 ) α n D f p ( u ^ , u ) + ( 1 α n ) D f p ( u ^ , v n ) α n D f p ( u ^ , u ) + ( 1 α n ) [ β n D f p ( u ^ , z n ) + ( 1 β n ) D f p ( u ^ , S 0 z n ) β n ( 1 β n ) ρ b z n * z n S 0 z n ] α n D f p ( u ^ , u ) + ( 1 α n ) { β n D f p ( u ^ , z n ) + ( 1 β n ) [ D f p ( u ^ , z n ) + ξ ρ b z n * z n S 0 z n ] β n ( 1 β n ) ρ b z n * z n S 0 z n } = α n D f p ( u ^ , u ) + ( 1 α n ) [ D f p ( u ^ , z n ) ( β n ξ ) ( 1 β n ) ρ b z n * z n S 0 z n ] α n D f p ( u ^ , u ) + ( 1 α n ) [ D f p ( u ^ , w n ) D f p ( z n , w n ) ] α n D f p ( u ^ , u ) + ( 1 α n ) [ D f p ( u ^ , u n ) D f p ( w n , u n ) D f p ( z n , w n ) ] α n D f p ( u ^ , u ) + ( 1 α n ) D f p ( u ^ , u n ) α n D f p ( u ^ , u ) + ( 1 α n ) [ γ n D f p ( u ^ , x n ) + ( 1 γ n ) D f p ( u ^ , g n ) γ n ( 1 γ n ) ρ b * J E p x n J E p g n ] α n D f p ( u ^ , u ) + ( 1 α n ) [ D f p ( z , x n ) + n M γ n ( 1 γ n ) ρ b * J E p x n J E p g n ] α n D f p ( u ^ , u ) + D f p ( z , x n ) + n M ( 1 α n ) γ n ( 1 γ n ) ρ b * J E p x n J E p g n ,
which immediately arrives at the desired claim. In addition, it is easily known that { u n } , { v n } , { w n } , { y n } , { y ˜ n } , { z n } , { s n } , { t n } and { S 0 z n } are also bounded.
Claim 2. We show that
D f p ( w n , u n ) + D f p ( z n , w n ) D f p ( u ^ , u n ) D f p ( u ^ , x n + 1 ) + α n J E p u J E p u ^ , ζ n u ^ .
Indeed, set b = sup n 1 { x n p 1 , g n p 1 , z n p 1 , S 0 z n p 1 } . By Lemma 2.2 we get
D f p ( u ^ , u n ) = V f p ( u ^ , γ n J E p x n + ( 1 γ n ) J E p g n ) 1 p u ^ p γ n J E p x n , u ^ ( 1 γ n ) J E p g n , u ^ + γ n q J E p x n q + ( 1 γ n ) q J E p g n q γ n ( 1 γ n ) ρ b * J E p x n J E p g n = 1 p u ^ p γ n J E p x n , u ^ ( 1 γ n ) J E p g n , u ^ + γ n q x n p + ( 1 γ n ) q g n p γ n ( 1 γ n ) ρ b * J E p x n J E p g n = γ n D f p ( u ^ , x n ) + ( 1 γ n ) D f p ( u ^ , g n ) γ n ( 1 γ n ) ρ b * J E p x n J E p g n γ n D f p ( u ^ , x n ) + ( 1 γ n ) [ D f p ( u ^ , x n ) + n M ] γ n ( 1 γ n ) ρ b * J E p x n J E p g n D f p ( u ^ , x n ) + n M γ n ( 1 γ n ) ρ b * J E p x n J E p g n , ( 3.22 )
and
D f p ( u ^ , v n ) = V f p ( u ^ , β n J E p z n + ( 1 β n ) J E p S 0 z n ) 1 p u ^ p β n J E p z n , u ^ ( 1 β n ) J E p S 0 z n , u ^ + β n q J E p z n q + ( 1 β n ) q J E p S 0 z n q β n ( 1 β n ) ρ b * J E p z n J E p S 0 z n = 1 p u ^ p β n J E p z n , u ^ ( 1 β n ) J E p S 0 z n , u ^ + β n q z n p + ( 1 β n ) q S 0 z n p β n ( 1 β n ) ρ b * J E p z n J E p S 0 z n = β n D f p ( u ^ , z n ) + ( 1 β n ) D f p ( u ^ , S 0 z n ) β n ( 1 β n ) ρ b * J E p z n J E p S 0 z n β n D f p ( u ^ , z n ) + ( 1 β n ) [ D f p ( u ^ , z n ) + ξ ρ b * J E p z n J E p S 0 z n ] β n ( 1 β n ) ρ b * J E p z n J E p S 0 z n = D f p ( u ^ , z n ) ( β n ξ ) ( 1 β n ) ρ b * J E p z n J E p S 0 z n D f p ( u ^ , w n ) ( β n ξ ) ( 1 β n ) ρ b * J E p z n J E p S 0 z n . ( 3.23 )
Set ζ n = J E * q ( α n J E p u + ( 1 α n ) J E p v n ) . From (2.5), we have
D f p ( u ^ , x n + 1 ) D f p ( u ^ , J E * q ( α n J E p u + ( 1 α n ) J E p v n ) ) = V f p ( u ^ , α n J E p u + ( 1 α n ) J E p v n ) V f p ( u ^ , α n J E p u + ( 1 α n ) J E p v n α n ( J E p u J E p u ^ ) ) + α n J E p u J E p u ^ , ζ n u ^ α n D f p ( u ^ , u ^ ) + ( 1 α n ) D f p ( u ^ , v n ) + α n J E p u J E p u ^ , ζ n u ^ = ( 1 α n ) D f p ( u ^ , v n ) + α n J E p u J E p u ^ , ζ n u ^ ( 1 α n ) [ D f p ( u ^ , w n ) ( β n ξ ) ( 1 β n ) ρ b * J E p z n J E p S 0 z n ] + α n J E p u J E p u ^ , ζ n u ^ ( 1 α n ) D f p ( u ^ , w n ) + α n J E p u J E p u ^ , ζ n u ^ . ( 3.24 )
On the other hand, from (3.23) we have
D f p ( u ^ , v n ) D f p ( u ^ , z n ) ( β n ξ ) ( 1 β n ) ρ b * J E p z n J E p S 0 z n D f p ( u ^ , w n ) D f p ( z n , w n ) ( β n ξ ) ( 1 β n ) ρ b * J E p z n J E p S 0 z n D f p ( u ^ , w n ) D f p ( z n , w n ) .
Substituting the above inequality into (3.24), we get
D f p ( u ^ , x n + 1 ) ( 1 α n ) D f p ( u ^ , v n ) + α n J E p u J E p u ^ , ζ n u ^ D f p ( u ^ , w n ) D f p ( z n , w n ) + α n J E p u J E p u ^ , ζ n u ^ D f p ( u ^ , u n ) D f p ( w n , u n ) D f p ( z n , w n ) + α n J E p u J E p u ^ , ζ n u ^ .
This immediately arrives at
D f p ( w n , u n ) + D f p ( z n , w n ) D f p ( u ^ , u n ) D f p ( u ^ , x n + 1 ) + α n J E p u J E p u ^ , ζ n u ^ . ( 3.25 )
Claim 3. We show that
( 1 α n ) { τ [ τ n 2 λ 1 L 1 D f p ( u n , y n ) ] p + τ [ τ ˜ n 2 λ 2 L 2 D f p ( w n , y ˜ n ) ] p } α n D f p ( u ^ , u ) + D f p ( u ^ , x n ) D f p ( u ^ , x n + 1 ) + n M .
Indeed, using the similar inferences to these of (3.20) in the proof of Theorem 3.1, we get
D f p ( u ^ , z n ) D f p ( u ^ , w n ) τ [ τ ˜ n 2 λ 2 L 2 D f p ( w n , y ˜ n ) ] p D f p ( u ^ , u n ) τ [ τ n 2 λ 1 L 1 D f p ( u n , y n ) ] p τ [ τ ˜ n 2 λ 2 L 2 D f p ( w n , y ˜ n ) ] p . ( 3.26 )
Applying (3.26), (3.23) and (3.22), we have
D f p ( u ^ , x n + 1 ) D f p ( u ^ , J E * q ( α n J E p u + ( 1 α n ) J E p v n ) ) α n D f p ( u ^ , u ) + ( 1 α n ) D f p ( u ^ , v n ) α n D f p ( u ^ , u ) + ( 1 α n ) [ D f p ( u ^ , z n ) ( β n ξ ) ( 1 β n ) ρ b * z n S 0 z n ] α n D f p ( u ^ , u ) + ( 1 α n ) { D f p ( u ^ , u n ) τ [ τ n 2 λ 1 L 1 D f p ( u n , y n ) ] p τ [ τ ˜ n 2 λ 2 L 2 D f p ( w n , y ˜ n ) ] p } α n D f p ( u ^ , u ) + D f p ( u ^ , u n ) ( 1 α n ) { τ [ τ n 2 λ 1 L 1 D f p ( u n , y n ) ] p + τ [ τ ˜ n 2 λ 2 L 2 D f p ( w n , y ˜ n ) ] p } α n D f p ( u ^ , u ) + D f p ( u ^ , x n ) + n M γ n ( 1 γ n ) ρ b * J E p x n J E p g n ( 1 α n ) { τ [ τ n 2 λ 1 L 1 D f p ( u n , y n ) ] p + τ [ τ ˜ n 2 λ 2 L 2 D f p ( w n , y ˜ n ) ] p } α n D f p ( u ^ , u ) + D f p ( u ^ , x n ) + n M ( 1 α n ) { τ [ τ n 2 λ 1 L 1 D f p ( u n , y n ) ] p + τ [ τ ˜ n 2 λ 2 L 2 D f p ( w n , y ˜ n ) ] p } . ( 3.27 )
Claim 4. We show that x n u ^ as n . Indeed, since E is reflexive and { x n } is bounded, we know that ω w ( x n ) . Let z ω w ( x n ) . Then, { x n k } { x n } s.t. x n k z . For each n 1 , we write Γ n = D f p ( u ^ , x n ) . In what follows, we show the convergence of { Γ n } to zero in the following two possible cases.
Case 1. Suppose that ∃ (integer) n 0 1 such that { Γ n } n = n 0 is nonincreasing. Then lim n Γ n = d < + and lim n ( Γ n Γ n + 1 ) = 0 . From (3.25) and (3.22) we get
D f p ( w n , u n ) + D f p ( z n , w n ) D f p ( u ^ , u n ) D f p ( u ^ , x n + 1 ) + α n J E p u J E p u ^ , ζ n u ^ D f p ( u ^ , x n ) + n M γ n ( 1 γ n ) ρ b * J E p x n J E p g n D f p ( u ^ , x n + 1 ) + α n J E p u J E p u ^ , ζ n u ^ ,
which hence yields
D f p ( w n , u n ) + D f p ( z n , w n ) + γ n ( 1 γ n ) ρ b * J E p x n J E p g n D f p ( u ^ , x n ) D f p ( u ^ , x n + 1 ) + n M + α n J E p u J E p u ^ , ζ n u ^ = Γ n Γ n + 1 + n M + α n J E p u J E p u ^ , ζ n u ^ .
Since lim n n = lim n α n = 0 , lim inf n γ n ( 1 γ n ) > 0 , lim n ( Γ n Γ n + 1 ) = 0 and the sequence { ζ n } is bounded, we obtain that lim n D f p ( w n , u n ) = 0 , lim n D f p ( z n , w n ) = 0 , and lim n ρ b * J E p x n J E p g n = 0 , which hence yields lim n J E p x n J E p g n = 0 . From u n = J E * q ( γ n J E p x n + ( 1 γ n ) J E p g n ) , it is easily known that lim n J E p u n   J E p x n = 0 . Noticing g n = J E * q ( ( 1 ϵ n ) J E p S n x n + ϵ n J E p ( 2 S n x n S n x n 1 ) ) , we deduce from lim n n = 0 and the definition of ϵ n that
J E p g n J E p S n x n = ϵ n J E p ( 2 S n x n S n x n 1 ) J E p S n x n n 0 ( n ) .
Hence, using (2.1) and uniform continuity of J E p on bounded subsets of E, we conclude that lim n g n x n = 0 and
lim n w n u n = lim n z n w n = lim n x n S n x n = lim n u n x n = 0 . ( 3.28 )
Furthermore, from (3.24) and (3.22) we have
( 1 α n ) ( β n ξ ) ( 1 β n ) ρ b * J E p z n J E p S 0 z n ( 1 α n ) D f p ( u ^ , w n ) D f p ( u ^ , x n + 1 ) + α n J E p u J E p u ^ , ζ n u ^ D f p ( u ^ , u n ) D f p ( u ^ , x n + 1 ) + α n J E p u J E p u ^ , ζ n u ^ D f p ( u ^ , x n ) D f p ( u ^ , x n + 1 ) + n M + α n J E p u J E p u ^ , ζ n u ^ .
By the similar inferences, we infer that lim n J E p z n J E p S 0 z n = 0 , which hence leads to lim n J E p v n J E p z n = 0 (due to v n = J E * q ( β n J E p z n + ( 1 β n ) J E p S 0 z n ) ). Using uniform continuity of J E * q on bounded subsets of E * , we get
lim n z n S 0 z n = lim n v n z n = 0 . ( 3.29 )
This together with (3.28) implies that
v n x n v n z n + z n w n + w n u n + u n x n 0 ( n ) .
It is clear that
lim n z n x n = 0 . ( 3.30 )
Let us show that z i = 0 N Fix ( S i ) . Indeed, since ζ n = J E * q ( α n J E p u + ( 1 α n ) J E p v n ) , it can be readily seen that
lim n ζ n x n = 0 . ( 3.31 )
In addition, using (2.3), (3.22) and (3.23), we have
D f p ( u ^ , x n + 1 ) D f p ( u ^ , ζ n ) D f p ( x n + 1 , ζ n ) = D f p ( u ^ , J E * q ( α n J E p u + ( 1 α n ) J E p v n ) D f p ( x n + 1 , ζ n ) α n D f p ( u ^ , u ) + ( 1 α n ) D f p ( u ^ , v n ) D f p ( x n + 1 , ζ n ) α n D f p ( u ^ , u ) + D f p ( u ^ , w n ) D f p ( x n + 1 , ζ n ) α n D f p ( u ^ , u ) + D f p ( u ^ , u n ) D f p ( x n + 1 , ζ n ) α n D f p ( u ^ , u ) + D f p ( u ^ , x n ) + n M D f p ( x n + 1 , ζ n ) ,
which hence arrives at
D f p ( x n + 1 , ζ n ) α n D f p ( u ^ , u ) + D f p ( u ^ , x n ) D f p ( u ^ , x n + 1 ) + n M = α n D f p ( u ^ , u ) + Γ n Γ n + 1 + n M .
So it follows that lim n D f p ( x n + 1 , ζ n ) = 0 and hence lim n x n + 1 ζ n = 0 . This together with (3.31), leads to
x n + 1 x n x n + 1 ζ n + ζ n x n 0 ( n ) . ( 3.32 )
Observe that for i = 1 , . . . , N ,
x n S n + i x n x n x n + i + x n + i S n + i x n + i + S n + i x n + i S n + i x n x n x n + i + x n + i S n + i x n + i + j = 1 N S j x n + i S j x n .
Exploiting the uniform continuity of each S j on C, we deduce from (3.28) and (3.32) that x n + i S n + i x n + i 0 and S j x n + i S j x n 0 for i , j = 1 , . . . , N . Thus, we get lim n x n S n + i x n = 0 for i = 1 , . . . , N . This immediately implies that lim n x n S r x n = 0 for r = 1 , . . . , N . So it follows from x n k z that z Fix ^ ( S r ) = Fix ( S r ) for r = 1 , . . . , N . Therefore, z i = 1 N Fix ( S i ) . In addition, from (3.30) and x n k z , one has that z n k z . Thus, using (3.29) we get z Fix ^ ( S 0 ) = Fix ( S 0 ) . Consequently, z i = 0 N Fix ( S i ) ,
In what follows, we show that z i = 1 2 VI ( C , A i ) . From (3.27), we have
( 1 α n ) { τ [ τ n 2 λ 1 L 1 D f p ( u n , y n ) ] p + τ [ τ ˜ n 2 λ 2 L 2 D f p ( w n , y ˜ n ) ] p } α n D f p ( u ^ , u ) + D f p ( u ^ , x n ) D f p ( u ^ , x n + 1 ) + n M = α n D f p ( u ^ , u ) + Γ n Γ n + 1 + n M .
So it follows that lim n τ n 2 λ 1 L 1 D f p ( u n , y n ) = lim n τ ˜ n 2 λ 2 L 2 D f p ( w n , y ˜ n ) = 0 , and hence
lim n τ n D f p ( u n , y n ) = lim n τ ˜ n D f p ( w n , y ˜ n ) = 0 . ( 3.33 )
Using Lemma 3.4, we infer that
lim n u n y n = lim n w n y ˜ n = 0 . ( 3.34 )
Applying Lemma 3.3 and (3.34), we obtain that z i = 1 2 VI ( C , A i ) . Hence we get ω w ( x n ) i = 1 2 VI ( C , A i ) . Consequently, ω w ( x n ) Ω = ( i = 1 2 VI ( C , A i ) ) ( i = 0 N Fix ( S i ) ) . Lastly, we show that lim sup n J E p u J E p u ^ , ζ n u ^ 0 . We can pick a subsequence { x n j } of { x n } such that
lim sup n J E p u J E p u ^ , x n u ^ = lim j J E p u J E p u ^ , x n j u ^ .
Because E is reflexive and { x n } is bounded, we may assume, without loss of generality, that x n j z ˜ . So it follows from (2.2) and z ˜ Ω that
lim sup n J E p u J E p u ^ , x n u ^ = lim j J E p u J E p u ^ , x n j u ^ = J E p u J E p u ^ , z ˜ u ^ 0 . ( 3.35 )
This together with (3.31) ensures that
lim sup n J E p u J E p u ^ , ζ n u ^ 0 .
From (3.24) and (3.22), we get
D f p ( u ^ , x n + 1 ) ( 1 α n ) D f p ( u ^ , w n ) + α n J E p u J E p u ^ , ζ n u ^ ( 1 α n ) D f p ( u ^ , u n ) + α n J E p u J E p u ^ , ζ n u ^ ( 1 α n ) [ D f p ( u ^ , x n ) + ϵ n J E p S n x n J E p ( 2 S n x n S n x n 1 ) × u ^ + S n x n 1 2 S n x n ] + α n J E p u J E p u ^ , ζ n u ^ ( 1 α n ) D f p ( u ^ , x n ) + ϵ n J E p S n x n J E p ( 2 S n x n S n x n 1 ) × u ^ + S n x n 1 2 S n x n + α n J E p u J E p u ^ , ζ n u ^ = ( 1 α n ) D f p ( u ^ , x n ) + α n { ϵ n α n J E p S n x n J E p ( 2 S n x n S n x n 1 ) × u ^ + S n x n 1 2 S n x n + J E p u J E p u ^ , ζ n u ^ } . ( 3.36 )
Using uniform continuity of each S i ( 1 i N ) on C, and uniform continuity of J E p on bounded subsets of E, from (3.32) and the boundedness of { x n } we get
lim n J E p S n x n J E p ( 2 S n x n S n x n 1 ) u ^ + S n x n 1 2 S n x n = 0 .
Noticing sup n 1 ϵ n α n < and lim sup n J E p u J E p u ^ , ζ n u ^ 0 , we infer that
lim sup n { ϵ n α n J E p S n x n J E p ( 2 S n x n S n x n 1 ) × u ^ + S n x n 1 2 S n x n + J E p u J E p u ^ , ζ n u ^ } 0 .
Since { α n } ( 0 , 1 ) and n = 1 α n = , applying Lemma 2.8 to (3.36) we obtain that lim n D f p ( u ^ , x n ) = 0 and hence lim n u ^ x n = 0 .
Case 2. Suppose that { Γ n k } { Γ n } s.t. Γ n k < Γ n k + 1 k N , where N is the set of all positive integers. Define the mapping ψ : N N by
ψ ( n ) : = max { k n : Γ k < Γ k + 1 } .
By Lemma 2.7, we get
Γ ψ ( n ) Γ ψ ( n ) + 1 and Γ n Γ ψ ( n ) + 1 . ( 3.37 )
From (3.25) and (3.22) it follows that
D f p ( w ψ ( n ) , u ψ ( n ) ) + D f p ( z ψ ( n ) , w ψ ( n ) ) + γ ψ ( n ) ( 1 γ ψ ( n ) ) ρ b * J E p x ψ ( n ) J E p g ψ ( n ) Γ ψ ( n ) Γ ψ ( n ) + 1 + ψ ( n ) M + α ψ ( n ) J E p u J E p u ^ , ζ ψ ( n ) u ^ .
Noticing g ψ ( n ) = J E * q ( ( 1 ϵ ψ ( n ) ) J E p S ψ ( n ) x ψ ( n ) + ϵ ψ ( n ) J E p ( 2 S ψ ( n ) x ψ ( n ) S ψ ( n ) x ψ ( n ) 1 ) ) and u ψ ( n ) = J E * q ( γ ψ ( n ) J E p x ψ ( n ) + ( 1 γ ψ ( n ) ) J E p g ψ ( n ) ) ) , we obtain that lim n g ψ ( n ) x ψ ( n ) = 0 and
lim n w ψ ( n ) u ψ ( n ) = lim n z ψ ( n ) w ψ ( n ) = lim n x ψ ( n ) S ψ ( n ) x ψ ( n ) = lim n u ψ ( n ) x ψ ( n ) = 0 . ( 3.38 )
Also, from (3.24) and (3.22) we have
( 1 α ψ ( n ) ) ( β ψ ( n ) ξ ) ( 1 β ψ ( n ) ) ρ b * J E p z ψ ( n ) J E p S 0 z ψ ( n ) Γ ψ ( n ) Γ ψ ( n ) + 1 + ψ ( n ) M + α ψ ( n ) J E p u J E p u ^ , ζ ψ ( n ) u ^ .
Noticing v ψ ( n ) = J E * q ( β ψ ( n ) J E p z ψ ( n ) + ( 1 β ψ ( n ) ) J E p S 0 z ψ ( n ) ) and using the similar inferences to those in Case 1, we get
lim n z ψ ( n ) S 0 z ψ ( n ) = lim n v ψ ( n ) z ψ ( n ) = 0 .
This together with (3.38) implies that
lim n v ψ ( n ) x ψ ( n ) = lim n z ψ ( n ) x ψ ( n ) = 0 . ( 3.39 )
Noticing ζ ψ ( n ) = J E * q ( α ψ ( n ) J E p u + ( 1 α ψ ( n ) ) J E p v ψ ( n ) ) , from (3.39) we get
lim n ζ ψ ( n ) x ψ ( n ) = 0 . ( 3.40 )
Using the similar inferences to those in Case 1, we conclude that lim n x ψ ( n ) + 1 x ψ ( n ) = 0 ,
lim n u ψ ( n ) y ψ ( n ) = lim n w ψ ( n ) y ˜ ψ ( n ) = 0 , ( 3.41 )
and
lim sup n J E p u J E p u ^ , ζ ψ ( n ) u ^ 0 . ( 3.42 )
Using (3.36), we get
D f p ( u ^ , x ψ ( n ) + 1 ) ( 1 α ψ ( n ) ) D f p ( u ^ , x ψ ( n ) ) + α ψ ( n ) { ϵ ψ ( n ) α ψ ( n ) J E p S ψ ( n ) x ψ ( n ) J E p ( 2 S ψ ( n ) x ψ ( n ) S ψ ( n ) x ψ ( n ) 1 ) × u ^ + S ψ ( n ) x ψ ( n ) 1 2 S ψ ( n ) x ψ ( n ) + J E p u J E p u ^ , ζ ψ ( n ) u ^ } , ( 3.43 )
which together with (3.37), hence yields
Γ ψ ( n ) ϵ ψ ( n ) α ψ ( n ) J E p S ψ ( n ) x ψ ( n ) J E p ( 2 S ψ ( n ) x ψ ( n ) S ψ ( n ) x ψ ( n ) 1 ) × u ^ + S ψ ( n ) x ψ ( n ) 1 2 S ψ ( n ) x ψ ( n ) + J E p u J E p u ^ , ζ ψ ( n ) u ^ .
As a result, from (3.42) we deduce that
lim n Γ ψ ( n ) = 0 . ( 3.44 )
From (3.42), (3.43) and (3.44), one has that
lim n Γ ψ ( n ) + 1 = 0 . ( 3.45 )
Again from (3.37), we have lim n D f p ( u ^ , x n ) = lim n Γ n = 0 . Hence lim n x n u ^ = 0 . This completes the proof. □
Remark 3.1. It can be easily seen from the proof of Theorem 3.2 that if the assumption that lim n n α n = 0 , is used in place of the one that lim n n = 0 and sup n 1 ϵ n α n < , then Theorem 3.2 is still valid.
Setting A 2 = 0 in Algorithm 3.1, we immediately obtain the following algorithm for finding an element of Ω = VI ( C , A 1 ) ( i = 0 N Fix ( S i ) ) .
Algorithm 3.3. Initialization: Given x 0 , x 1 C arbitrarily and let ϵ > 0 , μ 1 > 0 , λ 1 ( 0 , 1 μ 1 ) , l 1 ( 0 , 1 ) . Choose { n } , { β n } ( 0 , 1 ) and { α n } ( ξ , 1 ) s.t. n = 1 n < , lim inf n β n ( 1 β n ) > 0 and lim inf n ( α n ξ ) ( 1 α n ) > 0 . Moreover, given the iterates x n 1 and x n ( n 1 ) , choose ϵ n s.t. 0 ϵ n ϵ n ¯ , where
ϵ n ¯ = min { ϵ , n J E p S n x n J E p ( 2 S n x n S n x n 1 ) } if S n x n S n x n 1 , ϵ otherwise .
Iterative steps: Calculate x n + 1 as follows:
Step 1. Set g n = J E * q ( ( 1 ϵ n ) J E p S n x n + ϵ n J E p ( 2 S n x n S n x n 1 ) ) , and calculate u n = J E * q ( β n J E p x n + ( 1 β n ) J E p g n ) , y n = Π C ( J E * q ( J E p u n λ 1 A 1 u n ) ) , r λ 1 ( u n ) : = u n y n and s n = u n τ n r λ 1 ( u n ) , where τ n : = l 1 k n and k n is the smallest nonnegative integer k satisfying
A 1 u n A 1 ( u n l 1 k r λ 1 ( u n ) ) , u n y n μ 1 2 D f p ( u n , y n ) .
Step 2. Calculate w n = Π C n ( u n ) , with C n : = { x C : h n ( x ) 0 } and
h n ( x ) = A 1 s n , x u n + τ n 2 λ 1 D f p ( u n , y n ) .
Step 3. Calculate v n = J E * q ( α n J E p w n + ( 1 α n ) J E p ( S 0 w n ) ) and x n + 1 = Π Q n ( w n ) , where Q n : = { x C : D f p ( x , v n ) D f p ( x , w n ) } .
Again set n : = n + 1 and go to Step 1.
Corollary 3.1. Suppose that the conditions (C1)-(C3) with A 2 = 0 , hold, and Ω = VI ( C , A 1 ) ( i = 0 N Fix ( S i ) ) . Let { x n } be the sequence constructed in Algorithm 3.3. Then x n z Ω sup n 0 x n < .
Next, let S 1 : E C be a Bregman relatively nonexpansive mapping and S i = S = I the identity mapping of E for i = 2 , . . . , N . Then we get Ω = ( i = 1 2 VI ( C , A i ) ) ( i = 0 N Fix ( S i ) ) = ( i = 1 2 VI ( C , A i ) ) Fix ( S 1 ) . In this case, Algorithm 3.2 reduces to the following iterative scheme for solving a pair of VIPs and the FPP of S 1 . By Theorem 3.2 we obtain the following strong convergence result.
Corollary 3.2. Suppose that the condition (C3) holds, and let Ω = ( i = 1 2 VI ( C , A i ) ) Fix ( S 1 ) . For initial x 0 , x 1 C , choose ϵ n s.t. 0 ϵ n ϵ n ¯ , where
ϵ n ¯ = min { ϵ , n J E p S 1 x n J E p ( 2 S 1 x n S 1 x n 1 ) } if S 1 x n S 1 x n 1 , ϵ otherwise .
Suppose that { x n } is the sequence constructed by
g n = J E * q ( ( 1 ϵ n ) J E p S 1 x n + ϵ n J E p ( 2 S 1 x n S 1 x n 1 ) ) , u n = J E * q ( γ n J E p x n + ( 1 γ n ) J E p g n ) , y n = Π C ( J E * q ( J E p u n λ 1 A 1 u n ) ) , s n = ( 1 τ n ) u n + τ n y n , w n = Π C n u n , y ˜ n = Π C ( J E * q ( J E p w n λ 2 A 2 w n ) ) , t n = ( 1 τ ˜ n ) w n + τ ˜ n y ˜ n , z n = Π C ˜ n w n , x n + 1 = Π C ( J E * q ( α n J E p u + ( 1 α n ) J E p z n ) n 1 ,
where τ n : = l 1 k n , τ ˜ n : = l 2 j n and k n , j n are the smallest nonnegative integers k and j satisfying, respectively,
A 1 u n A 1 ( u n l 1 k ( u n y n ) ) , u n y n μ 1 2 D f p ( u n , y n ) ,
A 2 w n A 2 ( w n l 2 j ( w n y ˜ n ) ) , w n y ˜ n μ 2 2 D f p ( w n , y ˜ n ) ,
and the sets C n , C ˜ n , are constructed below
(i) C n : = { x C : h n ( x ) 0 } and h n ( x ) = A 1 s n , x u n + τ n 2 λ 1 D f p ( u n , y n ) ;
(ii) C ˜ n : = { x C : h ˜ n ( x ) 0 } and h ˜ n ( x ) = A 2 t n , x w n + τ ˜ n 2 λ 2 D f p ( w n , y ˜ n ) .
Then, x n Π Ω u sup n 0 x n < .

4. Examples

In this section, we provide an illustrated example to demonstrate the feasibility and implementability of our proposed approaches. Put ϵ = 1 3 , μ i = 1 and l i = λ i = 1 3 for i = 1 , 2 . We first provide an example of uniformly continuous and pseudomonotone mappings A i : E E * , i = 1 , 2 , Bregman relatively nonexpansive mapping S 1 : C C and Bregman relatively demicontractive mapping S 0 : C C with Ω = ( i = 1 2 VI ( C , A i ) ) ( i = 0 1 Fix ( S i ) ) . Let C = [ 2 , 2 ] and E = H = R with the inner product a , b = a b and induced norm · = | · | . The initial points x 0 , x 1 are randomly chosen in C. For i = 1 , 2 , let A i : H H be defined as A 1 x : = 1 1 + | sin x | 1 1 + | x | and A 2 x : = x + sin x for all x H . Now, we first show that A 1 is Lipschitz continuous and pseudomonotone. Indeed, for all x , y H we have
A 1 x A 1 y = | 1 1 + sin x 1 1 + x 1 1 + sin y + 1 1 + y | | y x ( 1 + x ) ( 1 + y ) | + | sin y sin x ( 1 + sin x ) ( 1 + sin y ) | x y + sin x sin y 2 x y .
This implies that A 1 is Lipschitz continuous. Also, we show that A 1 is pseudomonotone. For each x , y H , it is easy to see that
A 1 x , y x = ( 1 1 + | sin x | 1 1 + | x | ) ( y x ) 0 A 1 y , y x = ( 1 1 + | sin y | 1 1 + | y | ) ( y x ) 0 .
It is readily known that A 2 is Lipschitz continuous and monotone. Indeed, we deduce that A 2 x A 2 y x y + sin x sin y 2 x y and
A 2 x A 2 y , x y = x y 2 + sin x sin y , x y x y 2 x y 2 = 0 .
Now, let S 1 : C C and S 0 : C C be defined as S 1 x = sin x and S 0 x = 1 5 x + 3 5 sin x . It is easy to verify that Fix ( S 1 ) = Fix ( S 0 ) = { 0 } and S 1 : C C is Bregman relatively nonexpansive. Also, S 0 : C C is Bregman relatively ξ -demicontractive with ξ = 1 5 . Indeed, note that
S 0 x S 0 y 2 = 1 5 ( x y ) + 3 5 ( sin x sin y ) 2 x y 2 + 2 5 ( I S 0 ) x ( I S 0 ) y 2 .
Consequently,
Ω = ( i = 1 2 VI ( C , A i ) ) ( i = 0 1 Fix ( S i ) ) = { 0 } .
In addition, putting β n = n + 2 2 ( n + 1 ) n 1 , we obtain
lim n ( β n ξ ) ( 1 β n ) = lim n ( n + 2 2 ( n + 1 ) 1 5 ) ( 1 n + 2 2 ( n + 1 ) ) = ( 1 2 1 5 ) ( 1 1 2 ) = 3 20 > 0
In this case, the conditions (C1)-(C3) are satisfied.
Example 4.1. Let n = 1 2 ( n + 1 ) 2 and α n = β n = n + 2 2 ( n + 1 ) n 1 . Given the iterates x n 1 and x n ( n 1 ) , choose ϵ n s.t. 0 ϵ n ϵ n ¯ , where
ϵ n ¯ = min { ϵ , n S 1 x n S 1 x n 1 } if S 1 x n S 1 x n 1 , ϵ otherwise .
Algorithm 3.1 is rewritten as follows:
g n = S 1 x n + ϵ n ( S 1 x n S 1 x n 1 ) , u n = n + 2 2 ( n + 1 ) x n + n 2 ( n + 1 ) g n , y n = P C ( u n 1 3 A 1 u n ) , s n = ( 1 τ n ) u n + τ n y n , w n = P C n u n , y ˜ n = P C ( w n 1 3 A 2 w n ) , t n = ( 1 τ ˜ n ) w n + τ ˜ n y ˜ n , v n = n + 2 2 ( n + 1 ) w n + n 2 ( n + 1 ) S 0 w n , Q n = { x C : x v n x w n } , x n + 1 = P C ˜ n Q n w n n 1 , ( 4.1 )
where for each n 1 , the sets C n , C ˜ n and the step-sizes τ n , τ ˜ n are chosen as in Algorithm 3.1. Then, by Theorem 3.1, we deduce that { x n } converges to 0 Ω = ( i = 1 2 VI ( C , A i ) ) ( i = 0 1 Fix ( S i ) ) .
Example 4.2. Let n = 1 2 ( n + 1 ) 2 , α n = 1 2 ( n + 1 ) and β n = γ n = n + 2 2 ( n + 1 ) n 1 . Given the iterates x n 1 and x n ( n 1 ) , choose ϵ n s.t. 0 ϵ n ϵ n ¯ , where
ϵ n ¯ = min { ϵ , n S 1 x n S 1 x n 1 } if S 1 x n S 1 x n 1 , ϵ otherwise .
Algorithm 3.2 is rewritten as follows:
g n = S 1 x n + ϵ n ( S 1 x n S 1 x n 1 ) , u n = n + 2 2 ( n + 1 ) x n + n 2 ( n + 1 ) g n , y n = P C ( u n 1 3 A 1 u n ) , s n = ( 1 τ n ) u n + τ n y n , w n = P C n u n , y ˜ n = P C ( w n 1 3 A 2 w n ) , t n = ( 1 τ ˜ n ) w n + τ ˜ n y ˜ n , z n = P C ˜ n w n , v n = n + 2 2 ( n + 1 ) z n + n 2 ( n + 1 ) S 0 z n , x n + 1 = P C ( 1 2 ( n + 1 ) u + 2 n + 1 2 ( n + 1 ) v n ) n 1 , ( 4.2 )
where for each n 1 , the sets C n , C ˜ n and the step-sizes τ n , τ ˜ n are chosen as in Algorithm 3.2. Then, by Theorem 3.2, we deduce that { x n } converges to 0 Ω = ( i = 1 2 VI ( C , A i ) ) ( i = 0 1 Fix ( S i ) ) .

5. Conclusions

Let 1 < q 2 p < with 1 p + 1 q = 1 and let E be a p-uniformly convex and uniformly smooth Banach space. Then its dual space E * is q-uniformly smooth Banach space with 1 < q 2 . Utilizing the geometric properties of E and E * , we design two inertial-type subgradient extragradient algorithms with line-search process for solving the pseudomonotone variational inequality problems (VIPs) and common fixed-point problem (CFPP), where the geometric properties involve the properties of the generalized duality mappings J E p , J E * q and Bregman projection operator Π C . Here the CFPP indicates the common fixed-point problem of finite Bregman relatively nonexpansive mapping and a Bregman relatively demicontractive mapping in E. Under the properties of the generalized duality mappings J E p , J E * q and Bregman projection operator Π C , we prove weak and strong convergence of the suggested algorithms to a common solution of the VIPs and CFPP, respectively. Additionally, an illustrated example is furnished to demonstrate the feasibility and implementability of our proposed approaches. In the end, it is noteworthy that part of our future research is aimed at attaining the weak and strong convergence results for the modifications of our proposed approaches with Nesterov double inertial-type extrapolation steps (see [34]) and adaptive stepsizes.

References

  1. S. Huang, Hybrid extragradient methods for asymptotically strict pseudo-contractions in the intermediate sense and variational inequality problems, Optimization 60 (2011) 739-754. [CrossRef]
  2. L.O. Jolaoso, Y. Shehu, J.C. Yao, Inertial extragradient type method for mixed variational inequalities without monotonicity, Math. Comput. Simulation 192 (2022) 353-369. [CrossRef]
  3. Y.L. Cui, L.C. Ceng, F.F. Zhang et al., Mann hybrid deepest-descent extragradient method with line-search process for hierarchical variational inequalities for countable nonexpansive mappings, J. Math. 2023, Art. ID 6177912, 18 pp. [CrossRef]
  4. L.C. Ceng, T.C. Yin, Subgradient-like extragradient algorithms for systems of variational inequalities with constraints, Filomat 37 (2023) 7181-7197.
  5. Y. Censor, A. Gibali, S. Reich, The subgradient extragradient method for solving variational inequalities in Hilbert space, J. Optim. Theory Appl. 148 (2011) 318-335. [CrossRef]
  6. Y. Yao, N. Shahzad, J.C. Yao, Convergence of Tseng-type self-adaptive algorithms for variational inequalities and fixed point problems, Carpathian J. Math. 37 (2021) 541-550. [CrossRef]
  7. H.K. Xu, T.H. Kim, Convergence of hybrid steepest-descent methods for variational inequalities, J. Optim. Theory Appl. 119 (2003) 185-201. [CrossRef]
  8. L.C. Ceng, A. Petrusel, X. Qin, J.C. Yao, On inertial subgradient extragradient rule for monotone bilevel equilibrium problems, Fixed Point Theory 24 (2023) 101-126.
  9. L.C. Ceng, L.J. Zhu, T.C. Yin, Modified subgradient extragradient algorithms for systems of generalized equilibria with constraints, AIMS Math. 8 (2023) 2961-2994.
  10. R.W. Cottle, J.C. Yao, Pseudo-monotone complementarity problems in Hilbert space, J. Optim. Theory Appl. 75 (1992) 281-295. [CrossRef]
  11. S. Reich, A weak convergence theorem for the alternating method with Bregman distances. In: Theory and Applications of Nonlinear Operators, Marcel Dekker, New York, pp. 313-318, 1996.
  12. F. Schöpfer, T. Schuster, A.K. Louis, An iterative regularization method for the solution of the split feasibility problem in Banach spaces, Inverse Problems 24 (2008) Article ID 055008, 20 pp. [CrossRef]
  13. J. Yang, H. Liu, Z. Liu, Modified subgradient extragradient algorithms for solving monotone variational inequalities, Optimization 67 (2018) 2247-2258. [CrossRef]
  14. L.C. Ceng, A. Petrusel, X. Qin, J.C. Yao, A modified inertial subgradient extragradient method for solving pseudomonotone variational inequalities and common fixed point problems, Fixed Point Theory 21 (2020) 93-108.
  15. L.C. Ceng, S. Huang, A. Petrusel, Generalized projection and iterative methods for approximating fixed points of asymptotically weakly suppressive operators, Taiwanese J. Math. 14 (2010) 59-80. [CrossRef]
  16. L.C. Ceng, S. Huang, A. Petrusel, Weak convergence theorem by a modified extragradient method for nonexpansive mappings and monotone mappings, Taiwanese J. Math. 13 (2009) 225-238. [CrossRef]
  17. P.E. Maingé, Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization, Set-Valued Anal. 16 (2008) 899-912. [CrossRef]
  18. D. Butnariu, E. Resmerita, Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces, Abstr. Appl. Anal. 2006, Art. ID 84919, 39 pp. [CrossRef]
  19. P.T. Vuong, Y. Shehu, Convergence of an extragradient-type method for variational inequality with applications to optimal control problems, Numer. Algorithms 81 (2019) 269-291. [CrossRef]
  20. D. Reem, S. Reich and A. De Pierro, Re-examination of Bregman functions and new properties of their divergences, Optimization 68 (2019) 279-348. [CrossRef]
  21. D.V. Thong, D.V. Hieu, Modified subgradient extragradient method for variational inequality problems, Numer. Algorithms 79 (2018) 597-610. [CrossRef]
  22. R. Kraikaew, S. Saejung, Strong convergence of the Halpern subgradient extragradient method for solving variational inequalities in Hilbert spaces, J. Optim. Theory Appl. 163 (2014) 399-412. [CrossRef]
  23. L.C. Ceng, C.F. Wen, Systems of variational inequalities with hierarchical variational inequality constraints for asymptotically nonexpansive and pseudocontractive mappings, Rev. R. Acad. Cienc. Exactas Fís. Nat. Ser. A Mat. RACSAM 113 (2019) 2431-2447. [CrossRef]
  24. G.M. Korpelevich, The extragradient method for finding saddle points and other problems, Ekonomikai Matematicheskie Metody 12 (1976) 747-756.
  25. L.C. Ceng, S. Huang, Modified extragradient methods for strict pseudo-contractions and monotone mappings, Taiwanese J. Math. 13 (2009) 1197-1211. [CrossRef]
  26. L.C. Ceng, S. Huang, A hybrid extragradient method for asymptotically strict pseudo-contractions in the intermediate sense, Fixed Point Theory 11 (2010) 189-201.
  27. S. Reich, D.V. Thong, Q.L. Dong, X.H. Li, V.T. Dung, New algorithms and convergence theorems for solving variational inequalities with non-Lipschitz mappings, Numer. Algorithms 87 (2021) 527-549. [CrossRef]
  28. A.N. Iusem, M. Nasri, Korpelevich’s method for variational inequality problems in Banach spaces, J. Global Optim. 50 (2011) 59-76. [CrossRef]
  29. Y.R. He, A new double projection algorithm for variational inequalities, J. Comput. Appl. Math. 185 (2006) 166-173. [CrossRef]
  30. D. Butnariu, A.N. Iusem, E. Resmerita, Total convexity for powers of the norm in uniformly convex Banach spaces, J. Convex Anal. 7 (2000) 319-334.
  31. G.Z. Eskandani, R. Lotfikar, M. Raeisi, Hybrid projection methods for solving pseudo-monotone variational inequalities in Banach spaces, to appear in Fixed Point Theory, 2023. [CrossRef]
  32. Y. Takahashi, K. Hashimoto, M. Kato, On sharp uniform convexity, smoothness, and strong type, cotype inequalities, J. Nonlinear Convex Anal. 3 (2002) 267-281.
  33. M.O. Osilike, S.C. Aniagbosor, B.G. Akuchu, Fixed points of asymptotically demicontractive mappings in arbitrary Banach spaces, PanAm. Math. J. 12 (2002) 77-88.
  34. Y. Yao, O.S. Iyiola, Y. Shehu, Subgradient extragradient method with double inertial steps for variational inequalities, J. Sci. Comput. 2022, Paper No. 71, 29 pp. [CrossRef]
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.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings

© 2025 MDPI (Basel, Switzerland) unless otherwise stated