Next Article in Journal
Optimal Pricing Policies with an Allowable Discount for Perishable Items under Time-Dependent Sales Price and Trade Credit
Next Article in Special Issue
System of Generalized Variational Inclusions Involving Cayley Operators and XOR-Operation in q-Uniformly Smooth Banach Spaces
Previous Article in Journal
On Polynomials Orthogonal with Respect to an Inner Product Involving Higher-Order Differences: The Meixner Case
Previous Article in Special Issue
Inertial Modification Using Self-Adaptive Subgradient Extragradient Techniques for Equilibrium Programming Applied to Variational Inequalities and Fixed-Point Problems
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Modified Mann-Type Subgradient Extragradient Rules for Variational Inequalities and Common Fixed Points Implicating Countably Many Nonexpansive Operators †

Department of Mathematics, Shanghai Normal University, Shanghai 200234, China
*
Author to whom correspondence should be addressed.
This research was partially supported by the 2020 Shanghai Leading Talents Program of the Shanghai Municipal Human Resources and Social Security Bureau (20LJ2006100), the Innovation Program of Shanghai Municipal Education Commission (15ZZ068), and the Program for Outstanding Academic Leaders in Shanghai City (15XD1503100).
Submission received: 3 May 2022 / Revised: 25 May 2022 / Accepted: 27 May 2022 / Published: 6 June 2022
(This article belongs to the Special Issue Applied Functional Analysis and Applications)

Abstract

:
In a real Hilbert space, let the CFPP, VIP, and HFPP denote the common fixed-point problem of countable nonexpansive operators and asymptotically nonexpansive operator, variational inequality problem, and hierarchical fixed point problem, respectively. With the help of the Mann iteration method, a subgradient extragradient approach with a linear-search process, and a hybrid deepest-descent technique, we construct two modified Mann-type subgradient extragradient rules with a linear-search process for finding a common solution of the CFPP and VIP. Under suitable assumptions, we demonstrate the strong convergence of the suggested rules to a common solution of the CFPP and VIP, which is only a solution of a certain HFPP.

1. Introduction

Throughout this paper, we assume that P C is the metric projection of H onto C, with · , · and · denoting the inner product and induced norm of real Hilbert space H and C being a convex and closed set satisfying C H . Given nonlinear mapping S : C H , let the Fix ( S ) and R indicate the fixed-point set of S and the real-number set, respectively. In the fixed point theory, we recall an important class of mappings. A self-mapping S on C is known as being asymptotically nonexpansive iff { θ i } i = 1 [ 0 , + ) s.t. lim i θ i = 0 and
S i u S i v u v + θ i u v i 1 , u , v C .
In particular, whenever θ i = 0 i 1 , S is said to be nonexpansive. In the past several decades, the fixed point theory has played a key role in solving real-world problems such as the time-fractional biological population model [1], fractional multi-dimensional system of boundary value problems on the methylpropane graph [2], traumatic avoidance learning model [3], and so forth.
Given a self-mapping A on H, we consider the classical variational inequality problem (VIP) of finding u C s.t. A u , v u 0 v C . Its solution set is written as VI( C , A ). To the best of our awareness, one of the most effective techniques for treating the VIP is the extragradient one put forward by Korpelevich [4] in 1976, i.e., for any starting point u 0 C , { u i } is fabricated below
v i = P C ( u i A u i ) , u i + 1 = P C ( u i A v i ) i 0 ,
where ( 0 , 1 L ) and L is Lipschitz constant of A. Whenever VI ( C , A ) , the sequence { u i } converges weakly to a point in VI ( C , A ) . At present, the vast literature on Korpelevich’s extragradient technique shows that many authors have paid great attention to it and enhanced this technique in different manners; for details, refer to [5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28] and references therein, to name but a few.
Very recently, Xie et al. [9] suggested the amended inertial extragradient approach with a line-search process for solving the pseudomonotone VIP in H. Let f : H H be a contraction with constant δ [ 0 , 1 ) and assume that Ω : = VI ( C , A ) . Given the sequences { α i } , { β i } ( 0 , 1 ] such that lim i β i = 0 and i = 1 β i = . Their approach is formulated by Algorithm 1 below:
Algorithm 1 Modified inertial extragradient approach (see [9])
Initial Step: Let ς ( 0 , 1 ) , ( 0 , 1 ) , μ ( 0 , 1 ) γ ( 0 , ) , given any starting points x 1 , x 0 in H.
Iterations: Given the iterates x i 1 , x i ( i 1 ) , compute x i + 1 below:
Step 1. Set w i = x i + α i ( x i x i 1 ) .
Step 2. Calculate v i = P C ( w i τ i A w i ) and z i = P C ( w i ς τ i A v i ) , where τ i : = γ m i and m i is the smallest nonnegative integer m such that
γ m A w i A v i , z i v i μ w i v i z i v i .
If w i = v i or A v i = 0 , then stop and v i is an element of Ω . Otherwise, go to Step 3.
Step 3. Calculate x i + 1 = β i f ( z i ) + ( 1 β i ) z i . If w i = z i = x i + 1 , then w i Ω .
Again, set i : = i + 1 and go to Step 1.
  Under appropriate assumptions, they showed the strong convergence of { x i } to the solution p = P Ω f ( p ) provided lim i α i β i x i x i 1 = 0 . In the extragradient technique, two projections onto C have to be calculated per one iteration. In 2018, Thong and Hieu [22] first proposed the inertial subgradient extragradient method, and then proved the weak convergence of this method to an element of VI ( C , A ) under mild assumptions. In 2019, Thong and Hieu [17] proposed the inertial-type subgradient extragradient method with a linear-search process for settling the VIP with monotone and Lipschitzian operator A and the fixed-point problem (FPP) of a quasi-nonexpansive operator S with the demiclosedness in H. Assume that Ω : = Fix ( S ) VI ( C , A ) . Given the sequences { α i } [ 0 , 1 ] and { β i } ( 0 , 1 ) . Their method is formulated by Algorithm 2 below:
Algorithm 2 Inertial-type subgradient extragradient method (see [17])
Initial Step: Let ν ( 0 , 1 ) , l ( 0 , 1 ) , γ ( 0 , ) , given any starting points x 1 , x 0 in H.
Iterations: Compute x i + 1 below:
Step 1. Put w i = x i + α i ( x i x i 1 ) and calculate v i = P C ( w i ς i A w i ) , where ς i is picked to be the largest ς { γ , γ l , γ l 2 , } s.t.
ς A w i A v i ν w i v i .
Step 2. Calculate z i = P C i ( w i ς i A v i ) with C i : = { v H : w i ς i A w i v i , v v i 0 } .
Step 3. Calculate x i + 1 = ( 1 β i ) w i + β i S z i . If w i = z i = x i + 1 , then w i Ω .
Again, set i : = i + 1 and go to Step 1.
Under suitable assumptions, it was proven in [17] that { x i } converges weakly to a point in Ω . Subsequently, Ceng and Shang [25] proposed the hybrid inertial subgradient extragradient rule with a linear-search process for settling the VIP with Lipschitzian pseudomonotonicity operator A and the common fixed-point problem (CFPP) of finite nonexpansive operators { S k } k = 1 N and asymptotically nonexpansive operator S on H. Assume that Ω : = VI ( C , A ) ( k = 0 N Fix ( S k ) ) with S 0 : = S . Given a δ -contractive map g : H H with δ [ 0 , 1 ) , and an operator F : H H of both η -strong monotonicity and κ -Lipschitz continuity, fulfilling δ < ζ : = 1 1 μ ( 2 η μ κ 2 ) with 0 < μ < 2 η κ 2 . Let { β i } , { α i } ( 0 , 1 ) and { ϵ i } [ 0 , 1 ] s.t. α i + β i < 1 i 1 . In addition, one writes S i : = S i mod N for each i 1 , where the mod function takes values in { 1 , , N } , that is, whenever i = q N + j for some integers q 0 and 0 j < N , one has that S i = S N in the case of j = 0 and S i = S j in the case of 0 < j < N . Their rule is formulated by Algorithm 3 below:
Algorithm 3 Hybrid inertial subgradient extragradient rule (see [25])
Initial Step: Let ν ( 0 , 1 ) , l ( 0 , 1 ) , γ ( 0 , ) , given any starting points x 1 , x 0 in H.
Iterations: Compute x i + 1 below:
Step 1. Put w i = S i x i + ϵ i ( S i x i S i x i 1 ) and calculate y i = P C ( w i ς i A w i ) , with ς i being picked to be the largest ς { γ , γ l , γ l 2 , } s.t.
ς A w i A y i ν w i y i .
Step 2. Calculate q i = P C i ( w i ς i A y i ) with C i : = { y H : w i ς i A w i y i , y i y 0 } .
Step 3. Calculate x i + 1 = α i g ( x i ) + β i x i + ( ( 1 β i ) I α i μ F ) S i q i .
Again, set i : = i + 1 and go to Step 1.
Under appropriate assumptions, it was proven in [25] that, if S i q i S i + 1 q i 0 , then { x i } converges strongly to q Ω if and only if x i x i + 1 0 and x i y i 0 as i , with q Ω being only a solution to the hierarchical fixed point problem (HFPP): q = P Ω ( I μ F + g ) q .
In the rest of this paper, we always assume that the CFPP and HFPP denote the common fixed-point problem of countable nonexpansivity operators { S i } i = 1 and asymptotical nonexpansivity operator S 0 : = S and hierarchical fixed-point problem, respectively. With the help of the Mann iteration method, a subgradient extragradient approach with a linear-search process, and hybrid deepest-descent technique, we construct two amended Mann-type subgradient extragradient rules with a linear-search process for finding a common solution of the CFPP of { S i } i = 0 and the VIP for pseudomonotone operator A. Via suitable conditions, we show the strong convergence of the proposed rules to a point in Ω : = VI ( C , A ) ( k = 0 Fix ( S k ) ) , which is only a solution of a certain HFPP. In the end, using the main results, we deal with the CFPP and VIP in an illustrated example.
The architecture of this paper is arranged as follows: In Section 2, we recollect certain concepts and basic tools for subsequent applications. In Section 3, we prove the strong convergence of the proposed rules. Finally, in Section 4, the main theorems are exploited to settle the CFPP and VIP in a demonstrated instance. Our rules are more general and more subtle than the above algorithms because they implicate settling the VIP for pseudomonotone operator and the CFPP for countable nonexpansive operators and an asymptotically nonexpansive operator. Our theorems ameliorate and develop the associated theorems pronounced in Xie et al. [9], Ceng and Shang [25], and Thong and Hieu [17].

2. Preliminaries

Given a sequence { υ i } H , let υ i υ (resp., υ i υ ) represent the weak (resp., strong) convergence of { υ i } to υ . A mapping S : C H is referred to as being
(a)
of L-Lipschitz continuity (or of L-Lipschitzian property) iff L > 0 s.t. L p q S p S q p , q C ;
(b)
of monotonicity iff 0 S p S q , p q p , q C ;
(c)
of pseudomonotonicity iff S p , q p 0 S q , q p 0 p , q C ;
(d)
of η -strong monotonicity iff η > 0 s.t. η p q 2 S p S q , p q p , q C ;
(e)
of sequential weak continuity iff { q i } C , the relation holds: q i q S q i S q .
Obviously, each monotonicity mapping is of pseudomonotonicity. However, the inverse is false. It is known that q H , | (nearest point) P C q C s.t. q p q P C q p C . P C is refereed to as a nearest point (or metric) projection from H onto C. The statements below are valid (see [29]):
(a)
P C q P C p 2 q p , P C q P C p q , p H ;
(b)
p = P C q q p , t p 0 q H , t C ;
(c)
q P C q 2 + P C q t 2 q t 2 q H , t C ;
(d)
q p 2 = q 2 p 2 2 q p , p q , p H ;
(e)
s q + ( 1 s ) p 2 = s q 2 + ( 1 s ) p 2 s ( 1 s ) q p 2 q , p H , s [ 0 , 1 ] .
The following concept and two propositions can be found in [30].
 Definition 1. 
Let { ξ i } i = 1 [ 0 , 1 ] and suppose that { S i } i = 1 is a sequence of nonexpansive operators from C into itself. For any k 1 , the self-mapping W k on C is constructed as follows:
U k , k + 1 = I , U k , k = ξ k S k U k , k + 1 + ( 1 ξ k ) I , U k , k 1 = ξ k 1 S k 1 U k , k + ( 1 ξ k 1 ) I , U k , i = ξ i S i U k , i + 1 + ( 1 ξ i ) I , U k , 2 = ξ 2 S 2 U k , 3 + ( 1 ξ 2 ) I , W k = U k , 1 = ξ 1 S 1 U k , 2 + ( 1 ξ 1 ) I .
Then, W k is refereed to as a W-operator fabricated by S k , , S 2 , S 1 and ξ k , , ξ 2 , ξ 1 .
 Proposition 1. 
Let { ξ i } i = 1 ( 0 , 1 ] and suppose that { S i } i = 1 is a sequence of nonexpansive operators from C into itself, such that i = 1 Fix ( S i ) . Then,
 (a) 
W k is of nonexpansivity and i = 1 k Fix ( S i ) = Fix ( W k ) k 1 ;
 (b) 
q C , i 1 , lim k U k , i q exists;
 (c) 
the operator W, formulated as W q : = lim k W k q = lim k U k , 1 q q C , is a nonexpansive operator s.t. i = 1 Fix ( S i ) = Fix ( W ) , and it is refereed to as the W-operator fabricated by S 1 , S 2 , and ξ 1 , ξ 2 , .
 Proposition 2. 
Let { ξ i } i = 1 ( 0 , ς ] for certain ς ( 0 , 1 ) and suppose that { S i } i = 1 is a sequence of nonexpansive operators from C into itself, such that i = 1 Fix ( S i ) . Then, lim k sup p D W k p W p = 0 for each bounded set D C .
Throughout this paper, we always assume that { ξ i } i = 1 ( 0 , ς ] for some ς ( 0 , 1 ) . Later on, we will make use of the following lemmas to demonstrate our main results.
 Lemma 1 
([28]). Let H 1 and H 2 be two real Hilbert spaces. Suppose that F : H 1 H 2 is of uniform continuity on each boundedness subset of H 1 and D is of boundedness in H 1 . Then, F ( D ) is of boundedness.
It is clear that the relation below holds for the inner product in H:
2 p , q + p + q 2 q + p 2 q , p H .
 Lemma 2 
([31]). Each Hilbert space fulfills Opial’s condition, that is, { q n } H with q n q , the relation lim inf n q n p > lim inf n q n q p H , p q is true.
 Lemma 3 
([9]). Suppose that F : C H of both pseudomonotonicity and continuity, given u C . Then, the relation holds: F u , υ u 0 υ C F υ , υ u 0 υ C .
 Lemma 4 
([32]). Suppose that the sequence { a ι } [ 0 , ) is such that λ ι γ ι + ( 1 λ ι ) a ι a ι + 1 ι 1 , where the real sequences { λ ι } and { γ ι } satisfy the conditions: (a) { λ ι } [ 0 , 1 ] and ι = 1 λ ι = , and (b) lim sup ι γ ι 0 or ι = 1 | λ ι γ ι | < . Then, lim ι a ι = 0 .
 Lemma 5 
([33]). Let E be a Banach space and admit a duality mapping of weak continuity. Suppose that C is convex and closed such that C E , and that S is asymptotically nonexpansive self-mapping on C such that Fix ( S ) . Then, I S is demiclosed at zero, i.e., for { q ι } C satisfying both q ι q C and ( I S ) q ι 0 , one has ( I S ) q = 0 , with I being the identity operator of E.
The following lemmas are very crucial to the convergence analysis of our designed rules.
 Lemma 6 
([34]). Suppose that { Φ m } is a sequence in R , which does not decrease at infinity, that is, { Φ m ι } { Φ m } s.t. Φ m ι < Φ m ι + 1 ι 1 . The sequence { φ ( m ) } m m 0 of integers is formulated below:
φ ( m ) = max { ι m : Φ ι < Φ ι + 1 } ,
where m 0 1 s.t. { ι m 0 : Φ ι < Φ ι + 1 } . Then, the statements hold below:
(a) φ ( m 0 ) φ ( m 0 + 1 ) and φ ( m ) ;
(b) Φ φ ( m ) Φ φ ( m ) + 1 and Φ m Φ φ ( m ) + 1 m m 0 .
 Lemma 7 
([32]). Given a number λ in ( 0 , 1 ] , suppose that S is a nonexpansive self-mapping on C, and S λ : C H is the operator formulated as S λ p : = S p λ ρ F ( S p ) p C , with F : C H being of both κ-Lipschitz continuity and η-strong monotonicity. Then, S λ is a contractive map for ρ ( 0 , 2 η κ 2 ) , that is, S λ q S λ p ( 1 λ ζ ) q p q , p C , with ζ = 1 1 ρ ( 2 η ρ κ 2 ) ( 0 , 1 ] .

3. Criteria of Strong Convergence

In what follows, let us suppose that the conditions are valid below.
{ S i } i = 1 is a sequence of nonexpansive operators on H and S is asymptotically nonexpansive operator on H with { θ i } .
W n is the W-operator constructed by S n , S n 1 , , S 1 and ξ n , ξ n 1 , , ξ 1 , with { ξ i } i = 1 ( 0 , ς ] for certain ς ( 0 , 1 ) .
A is of both pseudomonotonicity and L-Lipschitz continuity on H, s.t. A u lim inf n A υ n for each { υ n } C with υ n u .
g is a δ -contractive map on H with δ [ 0 , 1 ) , and F is of η -strong monotonicity and κ -Lipschitz continuity on H s.t. δ < ζ : = 1 1 μ ( 2 η μ κ 2 ) with 0 < μ < 2 η κ 2 ) .
Ω = VI ( C , A ) ( i = 0 Fix ( S i ) ) where S 0 : = S .
{ ϵ n } , { σ n } [ 0 , 1 ] and { α n } , { β n } ( 0 , 1 ) with α n + β n < 1 n 1 , s.t.
(i)
lim n α n = 0 and n = 1 α n = ;
(ii)
sup n 1 ( ϵ n / α n ) < and lim n ( θ n / α n ) = 0 ;
(iii)
1 > lim sup n σ n lim inf n σ n > 0 ;
(iv)
1 > lim sup n β n lim inf n β n > 0 .
 Lemma 8. 
The linear-search process (6) in the following Algorithm 4 is well formulated, and the relation holds: γ ς n min { ν l L , γ } .
 Proof. 
Note that A u n A P C ( u n γ l m A u n ) L u n P C ( u n γ l m A u n ) . Then, (6) is valid for each γ l m ν L and ς n is well defined. Clearly, ς n γ . When ς n = γ , the conclusion is true. When ς n < γ , from (6), one obtains A u n A P C ( u n ς n l A u n ) > ν ( ς n / l ) u n P C ( u n ς n l A u n ) , which immediately yields ς n > ν l L . Thus, the conclusion is true.    □
 Lemma 9. 
Suppose that the sequences { w n } , { u n } , { y n } , { q n } are constructed in Algorithm 4. Then,
q n p 2 w n p 2 ( 1 ν ) y n q n 2 ( 1 ν ) y n u n 2 σ n ( 1 σ n ) w n W n w n 2 p Ω .
Algorithm 4 The 1st modified Mann-type subgradient extragradient rule
Initial Steps: Let l ( 0 , 1 ) , ν ( 0 , 1 ) , γ ( 0 , ) , given any starting points x 1 , x 0 in H.
Iterations: Calculate x n + 1 ( n 1 ) below:
Step 1. Set w n = x n + ϵ n ( x n x n 1 ) and u n = ( 1 σ n ) w n + σ n W n w n , and calculate y n = P C ( u n ς n A u n ) , with ς n being picked to be the largest ς { γ , γ l , γ l 2 , } s.t.
ς A u n A y n ν u n y n .
Step 2. Calculate q n = P C n ( u n ς n A y n ) with C n : = { y H : u n ς n A u n y n , y n y 0 } .
Step 3. Calculate
x n + 1 = α n g ( x n ) + β n x n + ( ( 1 β n ) I α n μ F ) S n q n .
Put n : = n + 1 and return to Step 1.
 Proof. 
It is clear that C n C Ω . Observe that p Ω ,
q n p 2 = P C n ( u n ς n A y n ) P C n p 2 q n p , u n ς n A y n p = 1 2 ( q n p 2 + u n p 2 q n u n 2 ) ς n q n p , A y n .
Thus, one has
q n p 2 u n p 2 q n u n 2 2 ς n q n p , A y n .
Thanks to q n = P C n ( u n ς n A y n ) where C n : = { y H : u n ς n A u n y n , y n y 0 } , one obtains u n ς n A u n y n , y n q n 0 . Using the pseudomonotonicity of A, from (8) and (6), we deduce that
q n p 2 u n p 2 q n u n 2 2 ς n A y n , y n p + q n y n u n p 2 q n u n 2 2 ς n A y n , q n y n = u n p 2 q n y n 2 y n u n 2 + 2 u n ς n A y n y n , q n y n = u n p 2 q n y n 2 y n u n 2 + 2 u n ς n A u n y n , q n y n + 2 ς n A u n A y n , q n y n u n p 2 q n y n 2 y n u n 2 + 2 ν u n y n q n y n u n p 2 q n y n 2 y n u n 2 + ν ( u n y n 2 + q n y n 2 ) = u n p 2 ( 1 ν ) y n q n 2 ( 1 ν ) y n u n 2 .
Owing to u n = ( 1 σ n ) w n + σ n W n w n , one has
u n p 2 = ( 1 σ n ) w n p 2 + σ n W n w n p 2 σ n ( 1 σ n ) w n W n w n 2 ( 1 σ n ) w n p 2 + σ n w n p 2 σ n ( 1 σ n ) w n W n w n 2 = w n p 2 σ n ( 1 σ n ) w n W n w n 2 .
Consequently, this, together with (9), ensures that inequality (5) is true.    □
 Lemma 10. 
Suppose that { w n } , { u n } , { x n } , { q n } are boundedness sequences constructed in Algorithm 4. Assume that S n x n S n + 1 x n 0 , u n x n 0 , w n q n 0 and x n x n + 1 0 . Then, ω w ( { x n } ) Ω , where ω w ( { x n } ) = { q H : x n l q for some { x n l } { x n } } .
 Proof. 
Take a fixed q ω w ( { x n } ) arbitrarily. Then, { x n l } { x n } s.t. x n l q H . Thanks to u n x n 0 , we know that { u n l } { u n } s.t. u n l q H . In what follows, we claim q Ω . In fact, by Lemma 9, we obtain that, for each p Ω ,
( 1 ν ) y n q n 2 + ( 1 ν ) y n u n 2 + σ n ( 1 σ n ) w n W n w n 2 w n p 2 q n p 2 w n q n ( w n p + q n p ) .
Since w n q n 0 , ν ( 0 , 1 ) and 1 > lim sup n σ n lim inf n σ n > 0 , from boundedness of { w n } , { q n } , we deduce that
lim n y n q n = lim n y n u n = lim n w n W n w n = 0 .
This immediately yields
u n q n u n y n + y n q n 0 ( n ) .
Clearly, one has w n x n = ϵ n x n x n 1 0 (due to sup n 1 ( ϵ n / α n ) < ). Hence, we have
W n x n x n W n x n W n w n + W n w n w n + w n x n 2 w n x n + W n w n w n 0 ( n ) .
Noticing x n + 1 = α n g ( x n ) + β n x n + ( ( 1 β n ) I α n μ F ) S n q n , we obtain x n + 1 S n q n = α n g ( x n ) + β n ( x n S n q n ) α n μ F S n q n , which immediately yields
x n S n q n x n x n + 1 + x n + 1 S n q n x n x n + 1 + α n g ( x n ) + β n x n S n q n + α n μ F S n q n .
Thus, it follows that
( 1 β n ) x n S n q n x n x n + 1 + α n ( g ( x n ) + μ F S n q n ) .
Since x n + 1 x n 0 , α n 0 , lim inf n ( 1 β n ) > 0 and { x n } , { q n } are of boundedness, one obtains
lim n x n S n q n = 0 .
We claim x n S x n 0 ( n ) . Indeed, using the asymptotical nonexpansivity of S, one deduces that
x n S x n x n S n q n + S n q n S n x n + S n x n S n + 1 x n + S n + 1 x n S n + 1 q n + S n + 1 q n S x n x n S n q n + ( 1 + θ n ) q n x n + S n x n S n + 1 x n + ( 1 + θ n + 1 ) x n q n + ( 1 + θ 1 ) S n q n x n = ( 2 + θ 1 ) x n S n q n + ( 2 + θ n + θ n + 1 ) q n x n + S n x n S n + 1 x n ( 2 + θ 1 ) x n S n q n + ( 2 + θ n + θ n + 1 ) ( q n u n + u n x n ) + S n x n S n + 1 x n .
Since u n x n 0 , u n q n 0 and x n S n q n 0 , we obtain
lim n x n S x n = 0 .
In addition, let us show that lim n x n W x n = 0 . In fact, note that
W x n x n W x n W n x n + W n x n x n sup u D W u W n u + W n x n x n ,
where D = { x n : n 1 } . Using Proposition 2, from (10), we obtain
lim n W x n x n = 0 .
   □
In what follows, we claim q VI ( C , A ) . Indeed, noticing u n y n 0 and u n l q , we have y n l q . In addition, noticing { y n } C and y n l q , by the convexity and closedness of C, one obtains q C . Next, we discuss two situations. When A q = 0 , it is readily known that q VI ( C , A ) (due to A q , y q 0 y C ).
Let A q 0 . Since y n l q as l , using the hypothesis on A, one obtains lim inf l A y n l A q > 0 . Hence, one might assume A y n l 0 l 1 . Moreover, using y n = P C ( u n ς n A u n ) , one has u n ς n A u n y n , y y n 0 y C , and hence
1 ς n u n y n , y y n + A u n , y n u n A u n , y u n y C .
Since A is uniform continuous, { A u n } is of boundedness (by Lemma 1). Noticing the boundedness of { y n } , by Lemma 8 and (13), one obtains lim inf l A u n l , y u n l 0 y C . In addition, it is readily known that A y n , y y n = A y n A u n , y u n + A u n , y u n + A y n , u n y n . Note that u n y n 0 and A is uniform continuous. Thus, one obtains A y n A u n 0 . This hence arrives at lim inf l A y n l , y y n l 0 y C .
In order to demonstrate q VI ( C , A ) , one chooses { κ l } ( 0 , 1 ) s.t. κ l 0 ( l ) . For each l, one denotes by m l the smallest natural number satisfying
A y n i , y y n i + κ l 0 i m l .
Note that { κ l } is of decreasement. Thus, it is readily known that { m l } is an increasing. Using A y m l 0 l 1 (owing to { A y m l } { A y n l } ), we set υ m l = A y m l A y m l 2 , and obtain A y m l , υ m l = 1 l 1 . Thus, from (14), one obtains A y m l , y + κ l υ m l y m l 0 l 1 . In addition, by the pseudomonotonicity of A, one has A ( y + κ l υ m l ) , y + κ l υ m l y m l 0 l 1 . This immediately arrives at
A y , y y m l A y A ( y + κ l υ m l ) , y + κ l υ m l y m l κ l A y , υ m l l 1 .
We show that lim l κ l υ m l = 0 . In fact, from u n l q C and u n y n 0 , we obtain y n l q . Note that { y m l } { y n l } and κ l 0 ( l ) . Thus, one deduces that 0 lim sup l κ l υ m l = lim sup l κ l A y m l lim sup l κ l lim inf l A y n l = 0 . Therefore, one obtains κ l υ m l 0 ( l ) . Note that A is uniformly continuous, the sequences { y m l } , { υ m l } are of boundedness, and lim l κ l υ m l = 0 . Consequently, letting l , one concludes that A y , y q = lim inf l A y , y y m l 0 y C . By Lemma 3, one has q VI ( C , A ) .
Next, we show that q Ω . In fact, since (11) guarantees x n l S x n l 0 , by Lemma 5, we obtain the demiclosedness of I S at zero. Thus, from x n l q , one obtains ( I S ) q = 0 , that is, q Fix ( S ) . In addition, we claim q Fix ( W ) = i = 1 Fix ( S i ) . Conversely, we suppose that q Fix ( W ) , that is, W q q . Using Lemma 2 and Proposition 1 (c), we obtain
lim inf l x n l q < lim inf l x n l W q lim inf l ( x n l W x n l + W x n l W q ) ,
which together with (12) yields lim inf l x n l q < lim inf l x n l q , which leads to a contradiction. Thus, one has q i = 1 Fix ( S i ) . Consequently, q i = 0 Fix ( S i ) VI ( C , A ) , that is, q Ω .
 Theorem 1. 
Suppose that { x n } is the sequence constructed in Algorithm 4. Then,
x n q Ω S n x n S n + 1 x n 0 , sup n 1 x n 1 x n < ,
with q Ω being only a solution of the HFPP: q = P Ω ( I μ F + g ) q .
 Proof. 
Because 1 > lim sup n σ n lim inf n σ n > 0 and lim n θ n / α n = 0 , we might suppose that { σ n } [ a ¯ , b ¯ ] ( 0 , 1 ) and β n ( ζ δ ) / 2 θ n for all n. Let us show that P Ω ( I μ F + g ) : H H is the contractive map on H. Indeed, using Lemma 7, one has
P Ω ( I μ F + g ) u P Ω ( I μ F + g ) υ [ 1 ( ζ δ ) ] u υ u , υ H .
This ensures that P Ω ( I μ F + g ) is a contractive map. Thus, it is readily known that there exists q H , which is only a fixed point of P Ω ( I μ F + g ) , that is, q = P Ω ( I μ F + g ) q . That is, there exists q Ω , which is only a solution to the following VIP:
( μ F g ) q , q q 0 q Ω .
We first show the necessity of the theorem. In fact, when x n q Ω , we know that q = S q and
S n x n S n + 1 x n S n x n q + q S n + 1 x n ( 1 + θ n ) x n q + ( 1 + θ n + 1 ) q x n = ( 2 + θ n + θ n + 1 ) x n q 0 ( n ) .
Since x n + 1 q + q x n x n + 1 x n , one has
lim n x n + 1 x n = 0 .
This immediately yields sup n 1 x n 1 x n < .
In what follows, we claim the sufficiency of the theorem. To the goal, under the assumption S n x n S n + 1 x n 0 with sup n 1 x n 1 x n < , we divide the remainder of the proof into several claims.    □
 Claim 1. 
One claims the boundedness of { x n } . In fact, picking a q Ω arbitrarily, one has that S q = q , W n q = q , and (5) leads to
q n q 2 w n q 2 ( 1 ν ) y n q n 2 ( 1 ν ) y n u n 2 σ n ( 1 σ n ) w n W n w n 2 q Ω ,
which hence yields
q n q w n q .
By the formulation of w n , one obtains
w n q x n q + ϵ n x n x n 1 = x n q + α n · ϵ n α n x n x n 1 .
Noticing sup n 1 ( ϵ n / α n ) < and sup n 1 x n x n 1 < , one obtains sup n 1 ( ϵ n / α n ) x n x n 1 < , which guarantees that M 1 > 0 s.t.
M 1 ϵ n α n x n x n 1 .
From (18)–(20), one obtains
q n q w n q x n q + α n M 1 .
In addition, observe that
u n q ( 1 σ n ) w n q + σ n W n w n q w n q ,
which, together with (9) and (21), yields
q n q u n q w n q x n q + α n M 1 .
Thus, using (23) and α n + β n < 1 n 1 , from Lemma 7, we obtain
x n + 1 q = α n g ( x n ) + β n x n + ( ( 1 β n ) I α n μ F ) S n q n q = α n ( g ( x n ) q ) + β n ( x n q ) + ( 1 α n β n ) { 1 β n 1 α n β n × [ ( I α n 1 β n μ F ) S n q n ( I α n 1 β n μ F ) q ] + α n 1 α n β n ( I μ F ) q } = α n ( g ( x n ) g ( p ) ) + β n ( x n q ) + ( 1 β n ) × [ ( I α n 1 β n μ F ) S n q n ( I α n 1 β n μ F ) q ] + α n ( f μ F ) q α n g ( x n ) g ( q ) + β n x n q + ( 1 β n ) × ( I α n 1 β n μ F ) S n q n ( I α n 1 β n μ F ) q + α n ( g μ F ) q α n δ x n q + β n x n q + ( 1 β n ) × ( 1 α n 1 β n ζ ) ( 1 + θ n ) q n q + α n ( g μ F ) q α n δ x n q + β n ( x n q + α n M 1 ) + ( 1 β n α n ζ ) × ( x n q + α n M 1 ) + θ n q n q + α n ( g μ F ) q [ α n δ + β n + ( 1 β n α n ζ ) ] x n q + α n M 1 + α n ( ζ δ ) ( x n q + α n M 1 ) 2 + α n ( g μ F ) q [ 1 α n ( ζ δ ) 2 ] x n q + α n ( 2 M 1 + ( g μ F ) q ) = [ 1 α n ( ζ δ ) 2 ] x n q + α n ( ζ δ ) 2 · 2 ( 2 M 1 + ( g μ F ) q ) ζ δ max { x n q , 2 ( 2 M 1 + ( g μ F ) q ) ζ δ } ,
which immediately arrives at
x n q max { x 1 q , 2 ( 2 M 1 + ( g μ F ) q ) ζ δ } n 1 .
Therefore, one obtains the boundedness of { x n } . This ensures that { w n } , { u n } , { y n } , { q n } , { g ( x n ) } , { A y n } and { W n w n } , { S n q n } are bounded.
 Claim 2. 
One claims that
( 1 β n α n ζ ) ( 1 + θ n ) { ( 1 ν ) ( y n q n 2 + y n u n 2 ) + σ n ( 1 σ n ) w n W n w n 2 } x n q 2 x n + 1 q 2 + ( α n + θ n ) M 4 ,
for certain M 4 > 0 . In fact, one has
x n + 1 q = α n ( g ( x n ) q ) + β n ( x n q ) + ( 1 α n β n ) { 1 β n 1 α n β n × [ ( I α n 1 β n μ F ) S n q n ( I α n 1 β n μ F ) q ] + α n 1 α n β n ( I μ F ) q } = α n ( g ( x n ) g ( q ) ) + β n ( x n q ) + ( 1 β n ) × [ ( I α n 1 β n μ F ) S n q n ( I α n 1 β n μ F ) q ] + α n ( g μ F ) q .
Using the convex property of ϕ ( s ) = s 2 s R , one obtains
x n + 1 q 2 α n ( g ( x n ) g ( q ) ) + β n ( x n q ) + ( 1 β n ) × [ ( I α n 1 β n μ F ) S n q n ( I α n 1 β n μ F ) q ] 2 + 2 α n ( g μ F ) q , x n + 1 q [ α n δ x n q + β n x n q + ( 1 β n ) × ( 1 α n 1 β n ζ ) ( 1 + θ n ) q n q ] 2 + 2 α n ( g μ F ) q , x n + 1 q = [ α n δ x n q + β n x n q + ( 1 β n α n ζ ) ( 1 + θ n ) q n q ] 2 + 2 α n ( g μ F ) q , x n + 1 q α n δ x n q 2 + β n x n q 2 + ( 1 β n α n ζ ) ( 1 + θ n ) q n q 2 + α n M 2
(because of α n δ + β n + ( 1 β n α n ζ ) ( 1 + θ n ) 1 + α n ( δ ζ ) + θ n 1 α n ( ζ δ ) 2 ), with sup n 1 2 ( g μ F ) q x n q M 2 for certain M 2 > 0 . Combining (17) and (24), one obtains
x n + 1 q 2 α n δ x n q 2 + β n x n q 2 + ( 1 β n α n ζ ) ( 1 + θ n ) [ w n q 2 ( 1 ν ) y n q n 2 ( 1 ν ) y n u n 2 σ n ( 1 σ n ) w n W n w n 2 ] + α n M 2 .
In addition, from (23), we have
w n q 2 ( x n q + α n M 1 ) 2 = x n q 2 + α n ( 2 M 1 x n q + α n M 1 2 ) x n q 2 + α n M 3 ,
where sup n 1 ( 2 M 1 x n q + α n M 1 2 ) M 3 for certain M 3 > 0 . From (25) and (26), one obtains
x n + 1 q 2 α n δ x n q 2 + β n [ x n q 2 + α n M 3 ] + ( 1 β n α n ζ ) ( 1 + θ n ) [ x n q 2 + α n M 3 ] ( 1 β n α n ζ ) ( 1 + θ n ) [ ( 1 ν ) y n q n 2 + ( 1 ν ) y n u n 2 + σ n ( 1 σ n ) w n W n w n 2 ] + α n M 2 [ 1 α n ( ζ δ ) ] x n q 2 ( 1 β n α n ζ ) ( 1 + θ n ) [ ( 1 ν ) ( y n q n 2 + y n u n 2 ) + σ n ( 1 σ n ) w n W n w n 2 ] + ( α n + θ n ) M 4 x n q 2 ( 1 β n α n ζ ) ( 1 + θ n ) [ ( 1 ν ) ( y n q n 2 + y n u n 2 ) + σ n ( 1 σ n ) w n W n w n 2 ] + ( α n + θ n ) M 4 ,
where sup n 1 ( x n q 2 + M 3 + M 2 ) M 4 for certain M 4 > 0 . Consequently,
( 1 β n α n ζ ) ( 1 + θ n ) { ( 1 ν ) ( y n q n 2 + y n u n 2 ) + σ n ( 1 σ n ) w n W n w n 2 } x n q 2 x n + 1 q 2 + ( α n + θ n ) M 4 .
 Claim 3. 
One claims that
x n + 1 q 2 [ 1 α n ( ζ δ ) ] x n q 2 + α n ( ζ δ ) { 2 ζ δ ( g μ F ) q , x n + 1 q + M ζ δ ( ϵ n α n 3 x n x n 1 + θ n α n ) }
for some M > 0 . In fact, one has
w n q 2 ( x n q + ϵ n x n x n 1 ) 2 = x n q 2 + ϵ n x n x n 1 ( 2 x n q + ϵ n x n x n 1 ) .
Using (23), (24) and (28), one obtains
x n + 1 q 2 α n δ x n q 2 + β n x n q 2 + ( 1 β n α n ζ ) ( 1 + θ n ) q n q 2 + 2 α n ( g μ F ) q , x n + 1 q α n δ x n q 2 + β n x n q 2 + ( 1 β n α n ζ ) w n q 2 + θ n q n q 2 + 2 α n ( g μ F ) q , x n + 1 q α n δ x n q 2 + ( 1 α n ζ ) [ x n q 2 + ϵ n x n x n 1 ( 2 x n q + ϵ n x n x n 1 ) ] + θ n q n q 2 + 2 α n ( g μ F ) q , x n + 1 q [ 1 α n ( ζ δ ) ] x n q 2 + ϵ n x n x n 1 ( 2 x n q + ϵ n x n x n 1 ) + θ n q n q 2 + 2 α n ( g μ F ) q , x n + 1 q [ 1 α n ( ζ δ ) ] x n q 2 + ( ϵ n x n x n 1 3 + θ n ) M + 2 ϵ n ( g μ F ) q , x n + 1 q = [ 1 α n ( ζ δ ) ] x n q 2 + α n ( ζ δ ) [ 2 ( g μ F ) q , x n + 1 q ζ δ + M ζ δ ( ϵ n α n 3 x n x n 1 + θ n α n ) ]
with sup n 1 { x n q , ϵ n x n x n 1 , q n q 2 } M for certain M > 0 .
 Claim 4. 
One claims that x n q Ω , which is only a solution to the HFPP: q = P Ω ( I μ F + g ) q . In fact, using (29) with q = q , one obtains
x n + 1 q 2 [ 1 α n ( ζ δ ) ] x n q 2 + α n ( ζ δ ) [ 2 ( g μ F ) q , x n + 1 q ζ δ + M ζ δ ( ϵ n α n 3 x n x n 1 + θ n α n ) ] .
Putting Φ n = x n q 2 , one demonstrates Φ n 0 ( n ) in both aspects below.
 Aspect 1. 
Suppose that ∃ (integer) n 0 1 s.t. { Φ n } is non-increasing. It is clear that the limit lim n Φ n = d < and lim n ( Φ n Φ n + 1 ) = 0 . Setting q = q , by (27) and { σ n } [ a ¯ , b ¯ ] ( 0 , 1 ) one obtains
( 1 β n α n ζ ) ( 1 + θ n ) { ( 1 ν ) ( y n q n 2 + y n u n 2 ) + a ¯ ( 1 b ¯ ) w n W n w n 2 } ( 1 β n α n ζ ) ( 1 + θ n ) { ( 1 ν ) ( y n q n 2 + y n u n 2 ) + σ n ( 1 σ n ) w n W n w n 2 } x n q 2 x n + 1 q 2 + ( α n + θ n ) M 4 Φ n Φ n + 1 + ( α n + θ n ) M 4 .
Noticing lim inf n ( 1 β n ) > 0 , α n 0 , θ n 0 and Φ n Φ n + 1 0 , one has
lim n w n W n w n = lim n y n u n = lim n y n q n = 0 .
Thus, it follows that
u n q n u n y n + y n q n 0 ( n ) .
Noticing w n x n = ϵ n ( x n x n 1 ) and u n w n = σ n ( W n w n w n ) , we obtain
u n x n u n w n + w n x n = σ n W n w n w n + ϵ n x n x n 1 W n w n w n + α n · ϵ n α n x n x n 1 W n w n w n + α n · sup n 1 ϵ n α n · sup n 1 x n x n 1 .
Since sup n 1 ϵ n α n < , sup n 1 x n x n 1 < and α n 0 , using (31), one has
lim n u n x n = 0 .
Moreover, noticing x n + 1 q = β n ( x n q ) + ( 1 β n ) ( S n q n q ) + α n ( g ( x n ) μ F S n q n ) , we obtain from (23) that
x n + 1 q 2 = β n ( x n q ) + ( 1 β n ) ( S n q n q ) + α n ( g ( x n ) μ F S n q n ) 2 β n ( x n q ) + ( 1 β n ) ( S n q n q ) 2 + 2 α n ( g ( x n ) μ F S n q n ) , x n + 1 q β n x n q 2 + ( 1 β n ) S n q n q 2 β n ( 1 β n ) x n S n q n 2 + 2 α n ( g ( x n ) μ F S n q n ) x n + 1 q β n x n q 2 + ( 1 β n ) ( 1 + θ n ) 2 q n q 2 β n ( 1 β n ) x n S n q n 2 + 2 α n ( g ( x n ) + μ F S n q n ) x n + 1 q β n ( 1 + θ n ) 2 ( x n q + α n M 1 ) 2 + ( 1 β n ) ( 1 + θ n ) 2 ( x n q + α n M 1 ) 2 β n ( 1 β n ) x n S n q n 2 + 2 α n ( g ( x n ) + μ F S n q n ) x n + 1 q = ( 1 + θ n ) 2 ( x n q + α n M 1 ) 2 β n ( 1 β n ) x n S n q n 2 + 2 α n ( g ( x n ) + μ F S n q n ) x n + 1 q = ( 1 + θ n ) 2 x n q 2 + ( 1 + θ n ) 2 α n M 1 [ 2 x n q + α n M 1 ] β n ( 1 β n ) x n S n q n 2 + 2 α n ( g ( x n ) + μ F S n q n ) x n + 1 q .
This hence arrives at
β n ( 1 β n ) x n S n q n 2 ( 1 + θ n ) 2 x n q 2 x n + 1 q 2 + ( 1 + θ n ) 2 α n M 1 [ 2 x n q + α n M 1 ] + 2 α n ( g ( x n ) + μ F S n q n ) x n + 1 q ( 1 + θ n ) 2 Φ n Φ n + 1 + ( 1 + θ n ) 2 α n M 1 [ 2 Φ n 1 2 + α n M 1 ] + 2 α n ( g ( x n ) + μ F S n q n ) Φ n + 1 1 2 .
Since 1 > lim sup n β n lim inf n β n > 0 , θ n 0 , α n 0 , Φ n Φ n + 1 0 and lim n Φ n = d < + , from the boundedness of { g ( x n ) } , { S n q n } , we infer that
lim n x n S n q n = 0 .
Thus, it follows that
x n + 1 x n = α n g ( x n ) + ( 1 β n ) ( S n q n x n ) α n μ F S n q n ( 1 β n ) S n q n x n + α n g ( x n ) μ F S n q n S n q n x n + α n ( g ( x n ) + μ F S n q n ) 0 ( n ) .
Since { x n } is bounded, we know that { x n ι } { x n } s.t.
lim sup n ( g μ F ) q , x n q = lim ι ( g μ F ) q , x n ι q .
Noticing the reflexivity of H and boundedness of { x n } , one might suppose that x n ι q ˜ . Hence, using (35), we obtain
lim sup n ( g μ F ) q , x n q = lim ι ( g μ F ) q , x n ι q = ( g μ F ) q , q ˜ q .
Note that w n x n = ϵ n x n x n 1 0 (due to sup n 1 ( ϵ n / α n ) < ). Thus, we obtain
q n w n q n u n + u n x n + x n w n 0 ( n ) .
Noticing x n + 1 x n 0 , u n x n 0 , w n q n 0 and S n x n S n + 1 x n 0 , from Lemma 10, one obtains q ˜ ω w ( { x n } ) Ω . Thus, using (36) and (16), one has
lim sup n ( g μ F ) q , x n q = ( g μ F ) q , q ˜ q 0 ,
which, together with (34), yields
lim sup n ( g μ F ) q , x n + 1 q = lim sup n [ ( g μ F ) q , x n + 1 x n + ( g μ F ) q , x n q ] lim sup n [ ( g μ F ) q x n + 1 x n + ( g μ F ) q , x n q ] 0 .
Since { α n ( ζ δ ) } [ 0 , 1 ] , n = 1 α n ( ζ δ ) = , and
lim sup n [ 2 ( g μ F ) q , x n + 1 q ζ δ + M ζ δ ( ϵ n α n 3 x n x n 1 + θ n α n ) ] 0 ,
by the application of Lemma 4 to (30), one has lim n x n q 2 = 0 .
 Aspect 2. 
Suppose that { Φ n ι } { Φ n } s.t. Φ n ι < Φ n ι + 1 ι N , with N being the set of all natural numbers. The self-mapping φ on N is formulated as
φ ( n ) : = max { ι n : Φ ι < Φ ι + 1 } .
Using Lemma 6, one obtains
Φ φ ( n ) Φ φ ( n ) + 1 and Φ n Φ φ ( n ) + 1 .
Putting q = q , from (27), we have
( 1 β φ ( n ) α φ ( n ) ζ ) ( 1 + θ φ ( n ) ) { ( 1 ν ) ( y φ ( n ) q φ ( n ) 2 + y φ ( n ) u φ ( n ) 2 ) + a ¯ ( 1 b ¯ ) w φ ( n ) W φ ( n ) w φ ( n ) 2 } ( 1 β φ ( n ) α φ ( n ) ζ ) ( 1 + θ φ ( n ) ) { ( 1 ν ) ( y φ ( n ) q φ ( n ) 2 + y φ ( n ) u φ ( n ) 2 ) + σ φ ( n ) ( 1 σ φ ( n ) ) w φ ( n ) W φ ( n ) w φ ( n ) 2 } x φ ( n ) q 2 x φ ( n ) + 1 q 2 + ( α φ ( n ) + θ φ ( n ) ) M 4 = Φ φ ( n ) Φ φ ( n ) + 1 + ( α φ ( n ) + θ φ ( n ) ) M 4 ,
which immediately yields
lim n w φ ( n ) W φ ( n ) w φ ( n ) = lim n y φ ( n ) u φ ( n ) = lim n y φ ( n ) q φ ( n ) = 0 .
Using the similar arguments to those of Aspect 1, one obtains
lim n u φ ( n ) q φ ( n ) = lim n u φ ( n ) x φ ( n ) = lim n x φ ( n ) + 1 x φ ( n ) = 0 ,
and
lim sup n ( g μ F ) q , x φ ( n ) + 1 q 0 .
On the other hand, by (30), one has
α φ ( n ) ( ζ δ ) Φ φ ( n ) Φ φ ( n ) Φ φ ( n ) + 1 + α φ ( n ) ( ζ δ ) [ 2 ( g μ F ) q , x φ ( n ) + 1 q ζ δ + M ζ δ ( ϵ φ ( n ) α φ ( n ) 3 x φ ( n ) x φ ( n ) 1 + θ φ ( n ) α φ ( n ) ) ] α φ ( n ) ( ζ δ ) [ 2 ( g μ F ) q , x φ ( n ) + 1 q ζ δ + M ζ δ ( ϵ φ ( n ) α φ ( n ) 3 x φ ( n ) x φ ( n ) 1 + θ φ ( n ) α φ ( n ) ) ] ,
lim sup n Φ φ ( n ) lim sup n [ 2 ( g μ F ) q , x φ ( n ) + 1 q ζ δ + M ζ δ ( ϵ φ ( n ) α φ ( n ) 3 x φ ( n ) x φ ( n ) 1 + θ φ ( n ) α φ ( n ) ) ] 0 .
Thus, lim n x φ ( n ) q 2 = 0 . In addition, note that
x φ ( n ) + 1 q 2 x φ ( n ) q 2 = 2 x φ ( n ) + 1 x φ ( n ) , x φ ( n ) q + x φ ( n ) + 1 x φ ( n ) 2 2 x φ ( n ) + 1 x φ ( n ) x φ ( n ) q + x φ ( n ) + 1 x φ ( n ) 2 .
Owing to Φ n Φ φ ( n ) + 1 , one obtains
x n q 2 x φ ( n ) + 1 q 2 x φ ( n ) q 2 + 2 x φ ( n ) + 1 x φ ( n ) x φ ( n ) q + x φ ( n ) + 1 x φ ( n ) 2 0 ( n ) .
This means that x n q as n .
In particular, when S is a nonexpansive operator, it is also asymptotically nonexpansive. In this case, the power S n in Algorithm 4 can be simplified into S. In this way, we can obtain the following Theorem 2.
 Theorem 2. 
Suppose that S is of nonexpansivity on H and { x n } is constructed in the modification of Algorithm 4, i.e., for any starting points x 1 , x 0 in H,
w n = x n + ϵ n ( x n x n 1 ) , u n = ( 1 σ n ) w n + σ n W n w n , y n = P C ( u n ς n A u n ) , q n = P C n ( u n ς n A y n ) , x n + 1 = α n g ( x n ) + β n x n + ( ( 1 β n ) I α n μ F ) S q n n 1 ,
with C n and ς n being picked as in Algorithm 4. Then, x n q Ω sup n 1 x n 1 x n < , with q Ω being only a solution of the HFPP: q = P Ω ( I μ F + g ) q .
 Proof. 
We first pick a q Ω arbitrarily. Obviously, the necessity holds. Next, it is sufficient to demonstrate the sufficiency. To this goal, under the condition sup n 1 x n 1 x n < , one divides the remainder of the proof into several claims.    □
 Claim 1. 
One claims the boundedness of { x n } . In fact, using the similar inferences to those of Claim 1 in the proof of the above theorem, one obtains the claim.
 Claim 2. 
One claims that
( 1 β n α n ζ ) { ( 1 ν ) ( y n q n 2 + y n u n 2 ) + σ n ( 1 σ n ) w n W n w n 2 } x n q 2 x n + 1 q 2 + α n M 4 ,
for some M 4 > 0 . In fact, using the similar inferences to those of Step 2 in the proof of the above theorem, one obtains the claim.
 Claim 3. 
One claims that
x n + 1 q 2 [ 1 α n ( ζ δ ) ] x n q 2 + α n ( ζ δ ) { 2 ζ δ ( g μ F ) q , x n + 1 q + 3 M ζ δ · ϵ n α n x n x n 1 }
for some M > 0 . In fact, using the similar inferences to those of Claim 3 in the proof of the above theorem, one obtains the claim.
 Claim 4. 
One claims that x n q Ω , which is only a solution to the HFPP: q = P Ω ( I μ F + g ) q . In fact, setting q = q , by Claim 3, one obtains
x n + 1 q 2 [ 1 α n ( ζ δ ) ] x n q 2 + α n ( ζ δ ) × { 2 ζ δ ( g μ F ) q , x n + 1 q + 3 M ζ δ · ϵ n α n x n x n 1 } .
Setting Φ n = x n q 2 , one demonstrates Φ n 0 ( n ) in both aspects below.
 Aspect 1. 
Suppose that ∃ (integer) n 0 1 s.t. { Φ n } is non-increasing. Then, the limit lim n Φ n = d < and lim n ( Φ n Φ n + 1 ) = 0 . Using the similar inferences to those of Aspect 1 of Claim 4 in the proof of the above theorem, one obtains
lim n w n W n w n = lim n u n y n = lim n u n q n = lim n u n x n = 0 .
From (4) and (23), one has
x n + 1 q 2 = β n ( x n q ) + ( 1 β n ) ( S q n q ) + α n ( g ( x n ) μ F S q n ) 2 β n ( x n q ) + ( 1 β n ) ( S q n q ) 2 + 2 α n g ( x n ) μ F S q n , x n + 1 q β n x n q 2 + ( 1 β n ) S q n q 2 β n ( 1 β n ) x n S q n 2 + 2 α n g ( x n ) μ F S q n , x n + 1 q ( x n q α n M 1 ) 2 β n ( 1 β n ) x n S q n 2 + 2 α n g ( x n ) μ F S q n x n + 1 q .
This hence arrives at
β n ( 1 β n ) x n S q n 2 ( x n q + α n M 1 ) 2 x n + 1 q 2 + 2 α n g ( x n ) μ F S q n x n + 1 q .
Since 1 > lim sup n β n lim inf n β n > 0 , α n 0 and lim n Φ n = d < + , from the boundedness of { g ( x n ) } , { S q n } , we infer that
lim n x n S q n = 0 .
Therefore,
x n + 1 x n = α n g ( x n ) + ( 1 β n ) ( S q n x n ) α n μ F S q n ( 1 β n ) S q n x n + α n g ( x n ) μ F S q n S q n x n + α n ( g ( x n ) + μ F S q n ) 0 ( n ) .
Again utilizing the similar inferences to those of Aspect 1 of Claim 4 in the proof of the above theorem, one obtains lim n x n q 2 = 0 .
 Aspect 2. 
Suppose that { Φ n ι } { Φ n } s.t. Φ n ι < Φ n ι + 1 ι N , with N being the set of all natural numbers. The self-mapping φ on N is formulated as
φ ( n ) : = max { ι n : Φ ι < Φ ι + 1 } .
From Lemma 6, one obtains
Φ φ ( n ) Φ φ ( n ) + 1 and Φ n Φ φ ( n ) + 1 .
Finally, by the similar inferences to those of Aspect 2 of Claim 4 in the proof of the above theorem, one can obtain the claim.
On the other hand, we put forward another modification of a Mann-type subgradient extragradient rule.
It is worth mentioning that (9) and Lemmas 8–10 remain true for Algorithm 5:
Algorithm 5 The 2nd modified Mann-type subgradient extragradient rule
Initial Step: Let l ( 0 , 1 ) , ν ( 0 , 1 ) , γ ( 0 , ) , given any starting points x 1 , x 0 in H.
Iterations: Compute x n + 1 ( n 1 ) below:
Step 1. Set w n = x n + ϵ n ( x n x n 1 ) and u n = ( 1 σ n ) x n + σ n W n w n , and calculate y n = P C ( u n ς n A u n ) , with ς n being picked to be the largest ς { γ , γ l , γ l 2 , } s.t.
ς A u n A y n ν u n y n .
Step 2. Calculate q n = P C n ( u n ς n A y n ) , where C n : = { y H : u n ς n A u n y n , y n y 0 } .
Step 3. Calculate
x n + 1 = α n g ( x n ) + β n u n + ( ( 1 β n ) I α n μ F ) S n q n .
Put n : = n + 1 and return to Step 1.
 Theorem 3. 
Suppose that { x n } is the sequence constructed in Algorithm 5. Then,
x n q Ω S n x n S n + 1 x n 0 , sup n 1 x n 1 x n < ,
with q Ω being only a solution of the HFPP: q = P Ω ( I μ F + g ) q .
 Proof. 
By the similar inferences to those in the proof of the first theorem, one obtains that q Ω , which is only a solution of the HFPP: q = P Ω ( I μ F + g ) q . Obviously, the necessity holds.
In what follows, one claims the sufficiency. To the goal, under the assumption S n x n S n + 1 x n 0 with sup n 1 x n 1 x n < , one divides the claim of the sufficiency into several claims. □
 Claim 1. 
One claims the boundedness of { x n } . In fact, using the similar inferences to those of Claim 1 in the proof of the first theorem, one has that (19) and (20) hold. It is easy to see from (9) that
q n q u n q ( 1 σ n ) x n q + σ n w n q x n q + α n M 1 n 1 .
Hence, using α n + β n < 1 , Lemma 7, and (49), we obtain
x n + 1 q = α n ( g ( x n ) g ( q ) ) + β n ( u n q ) + ( 1 β n ) × [ ( I α n 1 β n μ F ) S n q n ( I α n 1 β n μ F ) q + α n 1 β n ( g μ F ) q ] α n g ( x n ) g ( q ) + β n u n q + ( 1 β n ) × ( I α n 1 β n μ F ) S n q n ( I α n 1 β n μ F ) q + α n 1 β n ( g μ F ) q α n δ x n q + β n u n q + ( 1 β n ) × ( 1 α n 1 β n ζ ) ( 1 + θ n ) q n q + α n ( g μ F ) q α n δ x n q + β n ( x n q + α n M 1 ) + ( 1 β n α n ζ ) × ( x n q + α n M 1 ) + θ n q n q + α n ( g μ F ) q [ α n δ + β n + ( 1 β n α n ζ ) ] x n q + α n M 1 + α n ( ζ δ ) ( x n q + α n M 1 ) 2 + α n ( g μ F ) q [ 1 α n ( ζ δ ) 2 ] x n q + α n ( 2 M 1 + ( g μ F ) q ) = [ 1 α n ( ζ δ ) 2 ] x n q + α n ( ζ δ ) 2 · 2 ( 2 M 1 + ( g μ F ) q ) ζ δ max { x n q , 2 ( 2 M 1 + ( g μ F ) q ) ζ δ } ,
which immediately yields
x n q max { x 1 q , 2 ( 2 M 1 + ( g μ F ) q ) ζ δ } n 1 .
Therefore, we show the boundedness of { x n } . This ensures that the sequences { w n } , { u n } , { y n } , { q n } , { g ( x n ) } , { A y n } , { W n w n } , { S n q n } are bounded.
 Claim 2. 
One claims that
( 1 β n α n ζ ) ( 1 + θ n ) { ( 1 ν ) ( y n q n 2 + y n u n 2 ) + σ n ( 1 σ n ) x n W n w n 2 } x n q 2 x n + 1 q 2 + ( α n + θ n ) M 4 ,
for some M 4 > 0 —in fact, since
x n + 1 q = α n ( g ( x n ) g ( q ) ) β n ( u n q ) + ( 1 β n ) × [ ( I α n 1 β n μ F ) S n q n ( I α n 1 β n μ F ) q ] + α n ( g μ F ) q .
Using the same inferences as those of (24), one has
x n + 1 q 2 α n δ x n q 2 + β n u n q 2 + ( 1 β n α n ζ ) ( 1 + θ n ) q n q 2 + 2 α n ( g μ F ) q , x n + 1 q α n δ x n q 2 + β n u n q 2 + ( 1 β n α n ζ ) ( 1 + θ n ) q n q 2 + α n M 2 ,
with M 2 sup n 1 2 ( g μ F ) q x n q for certain M 2 > 0 . In addition, using (19) and (20), one obtains
w n q 2 ( x n q + α n M 1 ) 2 x n q 2 + α n M 3 ,
with M 3 sup n 1 ( 2 M 1 x n q + α n M 1 2 ) for certain M 3 > 0 . Moreover, using (49), we deduce that
u n q 2 x n q 2 + α n M 3 ,
which, together with (9) and (50), leads to
x n + 1 q 2 α n δ x n q 2 + β n u n q 2 + ( 1 β n α n ζ ) ( 1 + θ n ) [ u n q 2 ( 1 ν ) y n q n 2 ( 1 ν ) y n u n 2 ] + α n M 2 α n δ x n q 2 + β n u n q 2 + ( 1 β n α n ζ ) ( 1 + θ n ) { ( 1 σ n ) x n q 2 + σ n W n w n q 2 σ n ( 1 σ n ) x n W n w n 2 ( 1 ν ) ( y n q n 2 + y n u n 2 ) } + α n M 2 α n δ ( x n q 2 + α n M 3 ) + β n ( x n q 2 + α n M 3 ) + ( 1 β n α n ζ ) ( 1 + θ n ) × { ( 1 σ n ) ( x n q 2 + α n M 3 ) + σ n ( x n q 2 + α n M 3 ) σ n ( 1 σ n ) x n W n w n 2 ( 1 ν ) ( y n q n 2 + y n u n 2 ) } + α n M 2 = [ α n δ + β n + ( 1 β n α n ζ ) ( 1 + θ n ) ] ( x n q 2 + α n M 3 ) ( 1 β n α n ζ ) ( 1 + θ n ) × { ( 1 ν ) ( y n q n 2 + y n u n 2 ) + σ n ( 1 σ n ) x n W n w n 2 } + α n M 2 [ α n δ + β n + ( 1 β n α n ζ ) + θ n ] ( x n q 2 + α n M 3 ) ( 1 β n α n ζ ) ( 1 + θ n ) × { ( 1 ν ) ( y n q n 2 + y n u n 2 ) + σ n ( 1 σ n ) x n W n w n 2 } + α n M 2 = [ 1 α n ( ζ δ ) + θ n ] ( x n q 2 + α n M 3 ) ( 1 β n α n ζ ) ( 1 + θ n ) × { ( 1 ν ) ( y n q n 2 + y n u n 2 ) + σ n ( 1 σ n ) x n W n w n 2 } + α n M 2 [ 1 α n ( ζ δ ) ] x n q 2 + θ n x n q 2 + α n M 3 ( 1 β n α n ζ ) ( 1 + θ n ) × { ( 1 ν ) ( y n q n 2 + y n u n 2 ) + σ n ( 1 σ n ) x n W n w n 2 } + α n M 2 x n q 2 ( 1 β n α n ζ ) ( 1 + θ n ) { ( 1 ν ) ( y n q n 2 + y n u n 2 ) + σ n ( 1 σ n ) x n W n w n 2 } + ( α n + θ n ) M 4 ,
where M 4 sup n 1 ( x n q 2 + M 3 + M 2 ) for certain M 4 > 0 . Thus, we obtain
( 1 β n α n ζ ) ( 1 + θ n ) { ( 1 ν ) ( y n q n 2 + y n u n 2 ) + σ n ( 1 σ n ) x n W n w n 2 } x n q 2 x n + 1 q 2 + ( α n + θ n ) M 4 .
 Claim 3. 
One claims that
x n + 1 q 2 [ 1 α n ( ζ δ ) ] x n q 2 + α n ( ζ δ ) { 2 ζ δ ( g μ F ) q , x n + 1 q + M ζ δ ( ϵ n α n 3 x n x n 1 + θ n α n ) }
for certain M > 0 . In fact, one has
w n q 2 x n q 2 + ϵ n x n x n 1 ( 2 x n q + ϵ n x n x n 1 ) ,
and hence
u n q 2 ( 1 σ n ) x n q 2 + σ n W n w n q 2 ( 1 σ n ) x n q 2 + σ n { x n q 2 + ϵ n x n x n 1 ( 2 x n q + ϵ n x n x n 1 ) } x n q 2 + ϵ n x n x n 1 ( 2 x n q + ϵ n x n x n 1 ) .
From (49), (50) and (53), one obtains
x n + 1 q 2 α n δ x n q 2 + β n u n q 2 + ( 1 β n α n ζ ) q n q 2 + θ n q n q 2 + 2 α n ( g μ F ) q , x n + 1 q α n δ x n q 2 + ( 1 α n ζ ) [ x n q 2 + ϵ n x n x n 1 ( 2 x n q + ϵ n x n x n 1 ) ] + θ n q n q 2 + 2 α n ( g μ F ) q , x n + 1 q [ 1 α n ( ζ δ ) ] x n q 2 + ( ϵ n x n x n 1 3 + θ n ) M + 2 α n ( g μ F ) q , x n + 1 q = [ 1 α n ( ζ δ ) ] x n q 2 + α n ( ζ δ ) [ 2 ( g μ F ) q , x n + 1 q ζ δ + M ζ δ ( ϵ n α n 3 x n x n 1 + θ n α n ) ] ,
where M sup n 1 { x n q , ϵ n x n x n 1 , q n q 2 } for certain M > 0 .
 Claim 4. 
One claims that x n q Ω , which is only a solution to the HFPP: q = P Ω ( I μ F + g ) q . In fact, using (54) with q = q , one obtains
x n + 1 q 2 [ 1 α n ( ζ δ ) ] x n q 2 + α n ( ζ δ ) [ 2 ( g μ F ) q , x n + 1 q ζ δ + M ζ δ ( ϵ n α n 3 x n x n 1 + θ n α n ) ] .
Setting Φ n = x n q 2 , one demonstrates Φ n 0 ( n ) in both aspects below.
 Aspect 1. 
Suppose that ∃ (integer) n 0 1 s.t. { Φ n } is non-increasing. Then, the limit lim n Φ n = d < and lim n ( Φ n Φ n + 1 ) = 0 . Using (52) with q = q and { σ n } [ a ¯ , b ¯ ] ( 0 , 1 ) , one obtains
( 1 β n α n ζ ) ( 1 + θ n ) { ( 1 ν ) ( y n q n 2 + y n u n 2 ) + a ¯ ( 1 b ¯ ) x n W n w n 2 } ( 1 β n α n ζ ) ( 1 + θ n ) { ( 1 ν ) ( y n q n 2 + y n u n 2 ) + σ n ( 1 σ n ) x n W n w n 2 } Φ n Φ n + 1 + ( α n + θ n ) M 4 .
Noticing lim inf n ( 1 β n ) > 0 , α n 0 , θ n 0 and Φ n Φ n + 1 0 , one has
lim n x n W n w n = lim n y n u n = lim n y n q n = 0 .
Hence, one obtains
u n q n u n y n + y n q n 0 ( n ) .
Since w n x n = ϵ n ( x n x n 1 ) and u n x n = σ n ( W n w n x n ) , we obtain
lim n w n x n = lim n u n x n = 0 .
Moreover, noticing x n + 1 q = β n ( u n q ) + ( 1 β n ) ( S n q n q ) + α n ( g ( x n ) μ F S n q n ) , we obtain from (49) that
x n + 1 q 2 = β n ( u n q ) + ( 1 β n ) ( S n q n q ) + α n ( g ( x n ) μ F S n q n ) 2 β n u n q 2 + ( 1 β n ) ( 1 + θ n ) 2 q n q 2 γ n ( 1 γ n ) u n S n q n 2 + 2 α n g ( x n ) μ F S n q n , x n + 1 q ( 1 + θ n ) 2 ( x n q + α n M 1 ) 2 β n ( 1 β n ) u n S n q n 2 + 2 α n ( g ( x n ) + μ F S n q n ) x n + 1 q = ( 1 + θ n ) 2 x n q 2 + ( 1 + θ n ) 2 α n M 1 [ 2 x n q + α n M 1 ] β n ( 1 β n ) u n S n q n 2 + 2 α n ( g ( x n ) + μ F S n q n ) x n + 1 q .
This hence arrives at
β n ( 1 β n ) u n S n q n 2 ( 1 + θ n ) 2 x n q 2 x n + 1 q 2 + ( 1 + θ n ) 2 α n M 1 [ 2 x n q + α n M 1 ] + 2 α n ( g ( x n ) + μ F S n q n ) x n + 1 q ( 1 + θ n ) 2 Φ n Φ n + 1 + ( 1 + θ n ) 2 α n M 1 [ 2 Φ n 1 2 + α n M 1 ] + 2 α n ( g ( x n ) + μ F S n q n ) Φ n + 1 1 2 .
Since 1 > lim sup n β n lim inf n β n > 0 , θ n 0 , α n 0 , Φ n Φ n + 1 0 and lim n Φ n = d < + , from the boundedness of { g ( x n ) } , { S n q n } , we infer that
lim n u n S n q n = 0 .
Thus, it follows from Algorithm 5 that
x n + 1 x n = α n g ( x n ) + β n ( u n x n ) + ( 1 β n ) ( S n q n x n ) α n μ F S n q n = α n g ( x n ) + ( u n x n ) + ( 1 β n ) ( S n q n u n ) α n μ F S n q n u n x n + S n q n u n + α n ( g ( x n ) + μ F S n q n ) 0 ( n ) .
Utilizing the same inferences as those of (38), one obtains
lim sup n ( g μ F ) q , x n + 1 q 0 .
Since { α n ( ζ δ ) } [ 0 , 1 ] , n = 1 α n ( ζ δ ) = , and
lim sup n [ 2 ( g μ F ) q , x n + 1 q ζ δ + M ζ δ ( ϵ n α n 3 x n x n 1 + θ n α n ) ] 0 .
Therefore, by the application of Lemma 4 to (55), one has lim n x n q 2 = 0 .
 Aspect 2.  
Suppose that { Φ n ι } { Φ n } s.t. Φ n ι < Φ n ι + 1 ι N , with N being the set of all natural numbers. The self-mapping φ on N is formulated as
φ ( n ) : = max { ι n : Φ ι < Φ ι + 1 } .
From Lemma 6, one obtains
Φ φ ( n ) Φ φ ( n ) + 1 and Φ n Φ φ ( n ) + 1 .
Finally, by the similar inferences to those of Aspect 2 of Claim 4 in the proof of the first theorem, one can derive the claim.
In particular, when S is a nonexpansive operator, it is also asymptotically nonexpansive. In this case, the power S n in Algorithm 5 can be simplified into S. In this way, we can obtain the following Theorem 3.
 Theorem 4. 
Suppose that S is of nonexpansivity on H and { x n } is constructed in the modification of Algorithm 5, i.e., for any starting points x 1 , x 0 in H,
w n = x n + ϵ n ( x n x n 1 ) , u n = ( 1 σ n ) x n + σ n W n w n , y n = P C ( u n ς n A u n ) , q n = P C n ( u n ς n A y n ) , x n + 1 = α n g ( x n ) + β n u n + ( ( 1 β n ) I α n μ F ) S q n n 1 ,
with C n and ς n being picked as in Algorithm 5. Then, x n q Ω sup n 1 x n 1 x n < , with q Ω being only a solution of the HFPP: q = P Ω ( I μ F + g ) q .
 Proof. 
We first pick a q Ω arbitrarily. Obviously, the necessity holds. Next, it is sufficient to demonstrate the sufficiency. To the goal, under the condition sup n 1 x n 1 x n < , one divides the surplus of the proof into several claims. □
 Claim 1. 
One claims the boundedness of { x n } . In fact, using the similar inferences to those of Claim 1 in the proof of the third theorem, one obtains the claim.
 Claim 2. 
One claims that
( 1 β n α n ζ ) { ( 1 ν ) ( y n q n 2 + y n u n 2 ) + σ n ( 1 σ n ) x n W n w n 2 } x n q 2 x n + 1 q 2 + α n M 4 ,
for certain M 4 > 0 . In fact, using the similar inferences to those of Claim 2 in the proof of the third theorem, one obtains the claim.
 Claim 3. 
One claims that
x n + 1 q 2 [ 1 α n ( ζ δ ) ] x n q 2 + α n ( ζ δ ) { 2 ζ δ ( g μ F ) q , x n + 1 q + 3 M ζ δ · ϵ n α n x n x n 1 }
for certain M > 0 . In fact, using the similar inferences to those of Claim 3 in the proof of the third theorem, one obtains the claim.
 Claim 4. 
One claims that x n q Ω , which is only a solution to the HFPP: q = P Ω ( I μ F + g ) q . In fact, setting q = q , by Claim 3, one obtains
x n + 1 q 2 [ 1 α n ( ζ δ ) ] x n q 2 + α n ( ζ δ ) × { 2 ζ δ ( g μ F ) q , x n + 1 q + 3 M ζ δ · ϵ n α n x n x n 1 } .
Putting Φ n = x n q 2 , one shows Φ n 0 ( n ) in both aspects below.
 Aspect 1. 
Suppose that ∃ (integer) n 0 1 s.t. { Φ n } is non-increasing. Then, the limit lim n Φ n = d < + and lim n ( Φ n Φ n + 1 ) = 0 . Using the similar inferences to those of Aspect 1 of Claim 4 in the proof of the third theorem, one obtains
lim n x n W n w n = lim n u n y n = lim n u n q n = lim n u n x n = 0 .
From (4) and (49), one has
x n + 1 q 2 = β n ( u n q ) + ( 1 β n ) ( S q n q ) + α n ( g ( x n ) μ F S q n ) 2 β n ( u n q ) + ( 1 β n ) ( S q n q ) 2 + 2 α n g ( x n ) μ F S q n , x n + 1 q β n u n q 2 + ( 1 β n ) S q n q 2 β n ( 1 β n ) u n S q n 2 + 2 α n g ( x n ) μ F S q n , x n + 1 q ( x n q + α n M 1 ) 2 β n ( 1 β n ) u n S q n 2 + 2 α n g ( x n ) μ F S q n x n + 1 q ,
which immediately yields
β n ( 1 β n ) u n S q n 2 ( x n q + α n M 1 ) 2 x n + 1 q 2 + 2 α n g ( x n ) μ F S q n x n + 1 q .
Since 1 > lim sup n β n lim inf n β n > 0 , α n 0 and lim n Φ n = d < + , from the boundedness of { g ( x n ) } , { S q n } , we infer that
lim n u n S q n = 0 .
Therefore,
x n + 1 x n = α n g ( x n ) + β n ( u n x n ) + ( 1 β n ) ( S q n x n ) α n μ F S q n = α n g ( x n ) + ( u n x n ) + ( 1 β n ) ( S q n u n ) α n μ F S q n u n x n + S q n u n + α n g ( x n ) μ F S q n u n x n + S q n u n + α n ( g ( x n ) + μ F S q n ) 0 ( n ) .
Again utilizing the similar inferences to those of Aspect 1 of Claim 4 in the proof of the third theorem, one obtains lim n x n q 2 = 0 .
 Aspect 2. 
Suppose that { Φ n ι } { Φ n } s.t. Φ n ι < Φ n ι + 1 ι N , with N being the set of all natural numbers. The self-mapping φ on N is formulated as
φ ( n ) : = max { ι n : Φ ι < Φ ι + 1 } .
Using Lemma 6, one obtains
Φ φ ( n ) Φ φ ( n ) + 1 and Φ n Φ φ ( n ) + 1 .
Finally, by the similar inferences to those of Aspect 2 of Claim 4 in the proof of the third theorem, one can obtain the claim.
It is remarkable that, in comparison with the associated theorems in Xie et al. [9], Ceng and Shang [25], and Thong and Hieu [17], our theorems ameliorate and develop them in the aspects below.
(i)
The issue for one to find a point in VI ( C , A ) (see [9]) is developed into the issue for us to find a point in VI ( C , A ) ( i = 0 Fix ( S i ) ) with both each S i being of nonexpansivity and S 0 = S being of asymptotical nonexpansivity. The modified inertial extragradient rule with a linear-search process for settling the VIP in [9] is developed into our modified Mann-type subgradient extragradient rule with a linear-search process for settling the CFPP and VIP, which is on the basis of the Mann iteration method, subgradient extragradient approach with a linear-search process, and the hybrid deepest-descent technique.
(ii)
The issue for ones to find a point in VI ( C , A ) Fix ( S ) with a quasi-nonexpansive operator S in [17] is developed into the issue for us to find a point in VI ( C , A ) ( i = 0 Fix ( S i ) ) with both S i being of nonexpansivity and S 0 = S being of asymptotical nonexpansivity. The inertial subgradient extragradient rule with a linear-search process for settling the VIP and FPP in [17] is developed into our modified Mann-type subgradient extragradient rule with a linear-search process for settling the CFPP and VIP, which is on the basis of the Mann iteration method, subgradient extragradient approach with a linear-search process, and the hybrid deepest-descent technique.
(iii)
The issue for one to find a point in VI ( C , A ) ( i = 0 N Fix ( S i ) ) with finite nonexpansive operators { S i } i = 1 N (see [25]) is developed into the issue for us to find a point in VI ( C , A ) ( i = 0 Fix ( S i ) ) with countable nonexpansive operators { S i } i = 1 . The hybrid inertial subgradient extragradient rule with a linear-search process in [25] is developed into our modified Mann-type subgradient extragradient rule with a linear-search process, e.g., the original inertial step w n = S n x n + ϵ n ( S n x n S n x n 1 ) is developed into the modified Mann iteration step: w n = x n + α n ( x n x n 1 ) and u n = ( 1 σ n ) w n + σ n W n w n . In addition, it was shown in [25] that, under the condition S n q n S n + 1 q n 0 , the relation holds:
x n q Ω x n y n + x n x n + 1 0 with q = P Ω ( I μ F + g ) q .
In this paper, using Lemma 6, we show that, under the condition S n x n S n + 1 x n 0 , the relation holds:
x n q Ω sup n 1 x n 1 x n < with q = P Ω ( I μ F + g ) q .

4. Implementability and Applicability of Rules

In what follows, we provide an illustrated instance to demonstrate the implementability and applicability of proposed rules. Put μ = 2 , γ = 1 , ν = l = 1 2 , σ n = 1 3 , ϵ n = α n = 1 3 ( n + 1 ) and β n = n 3 ( n + 1 ) . First, we construct an example of Ω = VI ( C , A ) ( i = 0 Fix ( S i ) ) with S 0 : = S , where A : H H is of both pseudomonotonicity and Lipschitz continuity, S : H H is of asymptotical nonexpansivity and each S i : H H is of nonexpansivity. We put H = R and use the r , s = r s and · = | · | to denote its inner product and induced norm, respectively. Moreover, we set C = [ 2 , 5 ] . The starting points x 1 , x 0 are arbitrarily picked in [ 2 , 5 ] . Let g ( x ) = F ( x ) = 1 2 x x H with
δ = 1 2 < ζ = 1 1 μ ( 2 η μ κ 2 ) = 1 1 2 ( 2 · 1 2 2 ( 1 2 ) 2 ) = 1 .
Let A : H H and S , S i : H H be formulated by A x = 1 / ( 1 + | sin x | ) 1 / ( 1 + | x | ) , S x = 3 sin x / 5 and S i x = T x = sin x x H , i 1 , respectively. We now claim that A is pseudomonotone and Lipschitz continuous. In fact, one has
A x A y y x ( 1 + y ) ( 1 + x ) + sin y sin x ( 1 + sin y ) ( 1 + sin x ) 2 x y x , y H
This means that A is of Lipschitz continuity. In addition, one shows that A is of pseudomonotonicity. It can be readily seen that
A x , y x = ( 1 / ( 1 + | sin x | ) 1 / ( 1 + | x | ) ) ( y x ) 0 A y , y x = ( 1 / ( 1 + | sin y | ) 1 / ( 1 + | y | ) ( y x ) 0 x , y H .
Meanwhile, it is easily known that S is of asymptotical nonexpansivity with θ n = ( 3 5 ) n n 1 , such that S n + 1 x n S n x n 0 as n . Indeed, we observe that
S n x S n y 3 5 S n 1 x S n 1 y ( 3 5 ) n x y ( 1 + θ n ) x y ,
and
S n + 1 x n S n x n ( 3 5 ) n 1 S 2 x n S x n = ( 3 5 ) n 1 3 5 sin ( S x n ) 3 5 sin x n 2 ( 3 5 ) n 0 .
It is clear that Fix ( S ) = { 0 } and
lim n θ n α n = lim n ( 3 / 5 ) n 1 / 3 ( n + 1 ) = 0 .
In addition, it is easy to see that S i = T is of nonexpansivity and Fix ( S i ) = { 0 } . Thus, Ω = VI ( C , A ) Fix ( T ) Fix ( S ) = { 0 } .
 Example 1. 
Noticing W n = T and ( 1 β n ) I α n μ F = ( 1 n 3 ( n + 1 ) ) I 1 3 ( n + 1 ) 2 · 1 2 I = 2 3 I , we rewrite Algorithm 4 as follows:
w n = x n + 1 3 ( n + 1 ) ( x n x n 1 ) , u n = 2 3 w n + 1 3 T w n , y n = P C ( u n ς n A u n ) , q n = P C n ( u n ς n A y n ) , x n + 1 = 1 3 ( n + 1 ) · 1 2 x n + n 3 ( n + 1 ) x n + 2 3 S n q n ,
with C n and ς n being picked as in Algorithm 4 for every n. Hence, using Theorem 1, one has that x n 0 Ω = VI ( C , A ) Fix ( S ) Fix ( T ) if and only if sup n 1 | x n x n 1 | < .
 Example 2. 
From the nonexpansivity of S x : = 3 5 sin x , one obtains the following modification of Algorithm 4:
w n = x n + 1 3 ( n + 1 ) ( x n x n 1 ) , u n = 2 3 w n + 1 3 T w n , y n = P C ( u n ς n A u n ) , q n = P C n ( u n ς n A y n ) , x n + 1 = 1 3 ( n + 1 ) · 1 2 x n + n 3 ( n + 1 ) x n + 2 3 S q n ,
with C n and ς n being picked in the above way. Thus, using Theorem 2, one knows that x n 0 Ω = VI ( C , A ) Fix ( S ) Fix ( T ) if and only if sup n 1 | x n x n 1 | < .
 Example 3. 
Noticing W n = T and ( 1 β n ) I α n μ F = ( 1 n 3 ( n + 1 ) ) I 1 3 ( n + 1 ) 2 · 1 2 I = 2 3 I , we rewrite Algorithm 5 as follows:
w n = x n + 1 3 ( n + 1 ) ( x n x n 1 ) , u n = 2 3 x n + 1 3 T w n , y n = P C ( u n ς n A u n ) , q n = P C n ( u n ς n A y n ) , x n + 1 = 1 3 ( n + 1 ) · 1 2 x n + n 3 ( n + 1 ) u n + 2 3 S n q n ,
with C n and ς n being picked as in Algorithm 5 for every n. Hence, using Theorem 3, one has that x n 0 Ω = VI ( C , A ) Fix ( S ) Fix ( T ) if and only if sup n 1 | x n x n 1 | < .
 Example 4. 
From the nonexpansivity of S x : = 3 5 sin x , one obtains the following modification of Algorithm 5:
w n = x n + 1 3 ( n + 1 ) ( x n x n 1 ) , u n = 2 3 x n + 1 3 T w n , y n = P C ( u n ς n A u n ) , q n = P C n ( u n ς n A y n ) , x n + 1 = 1 3 ( n + 1 ) · 1 2 x n + n 3 ( n + 1 ) u n + 2 3 S q n ,
with C n and ς n being picked in the above way. Thus, using Theorem 4, one knows that x n 0 Ω = VI ( C , A ) Fix ( S ) Fix ( T ) if and only if sup n 1 | x n x n 1 | < .
It is noteworthy that the above two modified Mann-type subgradient extragradient algorithms with a linear-search process (i.e., Algorithms 4 and 5) are both applied for finding a point in the common solution set Ω = VI ( C , A ) ( i = 0 Fix ( S i ) ) with countable nonexpansive operators { S i } i = 1 and asymptotically nonexpansive operator S. Under the same conditions imposed on the parameter sequences, we show the strong convergence of these two different algorithms to an element q Ω , which is also a unique solution of the HFPP: q = P Ω ( I μ F + g ) q ; see Theorems 1 and 3 for more details. Note that Algorithm 4 is very similar to Algorithm 5 because these two different algorithms belong to the same class of modified Mann-type subgradient extragradient rules with a linear-search process. It is not difficult to find that Algorithm 4 is extended to develop Algorithm 5, e.g., (i) the original Mann iterative step u n = ( 1 σ n ) w n + σ n W n w n in Algorithm 4 is developed into the modified Mann iterative step u n = ( 1 σ n ) x n + σ n W n w n in Algorithm 5, and (ii) the original viscosity hybrid deepest-descent step x n + 1 = α n g ( x n ) + β n x n + ( ( 1 β n ) I α n μ F ) S n q n in Algorithm 4 is developed into the modified viscosity hybrid deepest-descent step x n + 1 = α n g ( x n ) + β n u n + ( ( 1 β n ) I α n μ F ) S n q n in Algorithm 5. In the above Examples 1 and 3, the iterative schemes (66) and (68) are numerical examples of Algorithms 4 and 5, respectively, and both are applied for finding 0 Ω = VI ( C , A ) Fix ( S ) Fix ( T ) . Compared with scheme (66), the scheme (68) improves and develops it in the following aspects:
(i)
The original Mann iterative step u n = 2 3 w n + 1 3 T w n in (66) is developed into the modified Mann iterative step u n = 2 3 x n + 1 3 T w n in (68);
(ii)
The original viscosity hybrid deepest-descent step x n + 1 = 1 3 ( n + 1 ) · 1 2 x n + n 3 ( n + 1 ) x n + 2 3 S n q n in (66) is developed into the modified viscosity hybrid deepest-descent step x n + 1 = 1 3 ( n + 1 ) · 1 2 x n + n 3 ( n + 1 ) u n + 2 3 S n q n in (68).
Finally, applying Theorems 1 and 3 to schemes (66) and (68), respectively, we obtain that x n 0 Ω = VI ( C , A ) Fix ( S ) Fix ( T ) if and only if sup n 1 | x n x n 1 | < .

5. Conclusions

In real Hilbert spaces, we have designed two modified Mann-type subgradient extragradient rules with a linear-search process for settling the variational inequality problem (VIP) for a Lipschitz continuity and pseudomonotonicity operator A, and the common fixed-point problem (CFPP) for countable nonexpansivity operators { S i } i = 1 and an asymptotical nonexpansivity operator S 0 : = S . Under the lack of the sequential weak continuity and Lipschitz constant of the cost operator A, we have demonstrated the strong convergence of the constructed algorithms to a common element of the solution set of the VIP and the common fixed-point set of operators { S i } i = 0 , which is only a solution of a certain hierarchical fixed-point problem (HFPP). In addition, an illustrated example is provided to demonstrate the implementability and applicability of our proposed rules.
It is worth pointing out that there are our contributions to the research area of finding a common solution of the VIP and CFPP in three aspects below:
First, we extend the problem considered in [25], that is, the problem of finding a point in VI ( C , A ) ( i = 0 N Fix ( S i ) ) with finite nonexpansive operators { S i } i = 1 N is developed into the problem of finding a point in VI ( C , A ) ( i = 0 Fix ( S i ) ) with countable nonexpansive operators { S i } i = 1 .
Second, we improve the rules proposed in [25], that is, the hybrid inertial subgradient extragradient rule with a linear-search process in [25] is developed into our modified Mann-type subgradient extragradient rule with a linear-search process, e.g., the original inertial step w n = S n x n + ϵ n ( S n x n S n x n 1 ) is developed into the modified Mann iteration step: w n = x n + α n ( x n x n 1 ) and u n = ( 1 σ n ) w n + σ n W n w n .
Finally, we weaken the convergence criteria presented in [25]. Indeed, it was shown in [25] that, under the condition S n q n S n + 1 q n 0 , the relation holds:
x n q Ω x n y n + x n x n + 1 0 with q = P Ω ( I μ F + g ) q .
In this article, using Lemma 6 (i.e., Maingé’s lemma [34]), we show that, under the condition S n x n S n + 1 x n 0 , the relation holds:
x n q Ω sup n 1 x n 1 x n < with q = P Ω ( I μ F + g ) q .
In addition, it is worth mentioning that part of our future research is aimed at acquiring the strong convergence results for the modifications of our proposed rules with a Nesterov inertial extrapolation step and adaptive stepsizes.

Author Contributions

Conceptualization, F.-F.Z. and H.-Y.H.; Data curation, F.-F.Z.; Formal analysis, Y.-L.C., C.-S.W., J.-Y.L. and L.H.; Funding acquisition, L.-C.C.; Investigation, Y.-L.C., L.-C.C., F.-F.Z., C.-S.W., J.-Y.L., H.-Y.H. and L.H.; Methodology, H.-Y.H.; Project administration, L.-C.C.; Resources, Y.-L.C.; Software, C.-S.W. and J.-Y.L.; Supervision, L.-C.C.; Validation, L.H.; Writing—original draft, Y.-L.C. and L.-C.C.; Writing—review & editing, L.-C.C. All authors have read and agreed to the published version of the manuscript.

Funding

This research was supported by the 2020 Shanghai Leading Talents Program of the Shanghai Municipal Human Resources and Social Security Bureau (20LJ2006100), the Innovation Program of Shanghai Municipal Education Commission (15ZZ068) and the Program for Outstanding Academic Leaders in Shanghai City (15XD1503100).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Rashid, S.; Ashraf, R.; Bonyah, E. On analytical solution of time-fractional biological population model by means of generalized integral transform with their uniqueness and convergence analysis. J. Funct. Spaces 2022, 2022, 7021288. [Google Scholar] [CrossRef]
  2. Rezapour, S.; Deressa, C.T.; Hussain, A.; Etemad, S.; George, R.; Ahmad, B. A theoretical analysis of a fractional multi-dimensional system of boundary value problems on the methylpropane graph via fixed point technique. Mathematics 2022, 10, 568. [Google Scholar] [CrossRef]
  3. Turab, A.; Sintunavarat, W. On the solution of the traumatic avoidance learning model approached by the Banach fixed point theorem. J. Fixed Point Theory Appl. 2020, 22, 12. [Google Scholar] [CrossRef]
  4. Korpelevich, G.M. The extragradient method for finding saddle points and other problems. Ekon. Mat. Metod. 1976, 12, 747–756. [Google Scholar]
  5. Yao, Y.; Liou, Y.C.; Kang, S.M. Approach to common elements of variational inequality problems and fixed point problems via a relaxed extragradient method. Comput. Math. Appl. 2010, 59, 3472–3480. [Google Scholar] [CrossRef] [Green Version]
  6. Jolaoso, L.O.; Shehu, Y.; Yao, J.C. Inertial extragradient type method for mixed variational inequalities without monotonicity. Math. Comput. Simul. 2022, 192, 353–369. [Google Scholar] [CrossRef]
  7. Ceng, L.C.; Petrusel, A.; Yao, J.C.; Yao, Y. Hybrid viscosity extragradient method for systems of variational inequalities, fixed points of nonexpansive mappings, zero points of accretive operators in Banach spaces. Fixed Point Theory 2018, 19, 487–501. [Google Scholar] [CrossRef]
  8. Ceng, L.C.; Petrusel, A.; Qin, X.; Yao, J.C. Two inertial subgradient extragradient algorithms for variational inequalities with fixed-point constraints. Optimization 2021, 70, 1337–1358. [Google Scholar] [CrossRef]
  9. Xie, Z.; Cai, G.; Li, X.; Dong, Q.L. Strong convergence of the modified inertial extragradient method with line-search process for solving variational inequality problems in Hilbert spaces. J. Sci. Comput. 2021, 88, 19. [Google Scholar] [CrossRef]
  10. Yao, Y.; Shahzad, N.; Yao, J.C. Convergence of Tseng-type self-adaptive algorithms for variational inequalities and fixed point problems. Carpathian J. Math. 2021, 37, 541–550. [Google Scholar] [CrossRef]
  11. He, L.; Cui, Y.L.; Ceng, L.C.; Zhao, T.Y.; Wang, D.Q.; Hu, H.Y. Strong convergence for monotone bilevel equilibria with constraints of variational inequalities and fixed points using subgradient extragradient implicit rule. J. Inequal. Appl. 2021, 2021, 37. [Google Scholar] [CrossRef]
  12. Zhao, T.Y.; Wang, D.Q.; Ceng, L.C.; He, L.; Wang, C.Y.; Fan, H.L. Quasi-inertial Tseng’s extragradient algorithms for pseudomonotone variational inequalities and fixed point problems of quasi-nonexpansive operators. Numer. Funct. Anal. Optim. 2020, 42, 69–90. [Google Scholar] [CrossRef]
  13. Denisov, S.V.; Semenov, V.V.; Chabak, L.M. Convergence of the modified extragradient method for variational inequalities with non-Lipschitz operators. Cybern. Syst. Anal. 2015, 51, 757–765. [Google Scholar] [CrossRef]
  14. Cai, G.; Shehu, Y.; Iyiola, O.S. Strong convergence results for variational inequalities and fixed point problems using modified viscosity implicit rules. Numer. Algorithms 2018, 77, 535–558. [Google Scholar] [CrossRef]
  15. Yang, J.; Liu, H.; Liu, Z. Modified subgradient extragradient algorithms for solving monotone variational inequalities. Optimization 2018, 67, 2247–2258. [Google Scholar] [CrossRef]
  16. Vuong, P.T. On the weak convergence of the extragradient method for solving pseudo-monotone variational inequalities. J. Optim. Theory Appl. 2018, 176, 399–409. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  17. Thong, D.V.; Hieu, D.V. Inertial subgradient extragradient algorithms with line-search process for solving variational inequality problems and fixed point problems. Numer. Algorithms 2019, 80, 1283–1307. [Google Scholar] [CrossRef]
  18. Shehu, Y.; Iyiola, O.S. Strong convergence result for monotone variational inequalities. Numer. Algorithms 2019, 76, 259–282. [Google Scholar] [CrossRef]
  19. Thong, D.V.; Dong, Q.L.; Liu, L.L.; Triet, N.A.; Lan, N.P. Two fast converging inertial subgradient extragradient algorithms with variable stepsizes for solving pseudo-monotone VIPs in Hilbert spaces. J. Comput. Appl. Math. 2022, 410, 19. [Google Scholar] [CrossRef]
  20. Vuong, P.T.; Shehu, Y. Convergence of an extragradient-type method for variational inequality with applications to optimal control problems. Numer. Algorithms 2019, 81, 269–291. [Google Scholar] [CrossRef]
  21. Shehu, Y.; Dong, Q.L.; Jiang, D. Single projection method for pseudo-monotone variational inequality in Hilbert spaces. Optimization 2019, 68, 385–409. [Google Scholar] [CrossRef]
  22. Thong, D.V.; Hieu, D.V. Modified subgradient extragradient method for variational inequality problems. Numer. Algorithms 2018, 79, 597–610. [Google Scholar] [CrossRef]
  23. Kraikaew, R.; Saejung, S. Strong convergence of the Halpern subgradient extragradient method for solving variational inequalities in Hilbert spaces. J. Optim. Theory Appl. 2014, 163, 399–412. [Google Scholar] [CrossRef]
  24. Ceng, L.C.; Wen, C.F. Systems of variational inequalities with hierarchical variational inequality constraints for asymptotically nonexpansive and pseudocontractive mappings. Rev. R. Acad. Cienc. Exactas Fís. Nat. Ser. A Mat. Racsam 2019, 113, 2431–2447. [Google Scholar] [CrossRef]
  25. Ceng, L.C.; Shang, M.J. Hybrid inertial subgradient extragradient methods for variational inequalities and fixed point problems involving asymptotically nonexpansive mappings. Optimization 2021, 70, 715–740. [Google Scholar] [CrossRef]
  26. Ceng, L.C.; Petrusel, A.; Qin, X.; Yao, J.C. Pseudomonotone variational inequalities and fixed points. Fixed Point Theory 2021, 22, 543–558. [Google Scholar] [CrossRef]
  27. Reich, S.; Thong, D.V.; Dong, Q.L.; Li, X.H.; Dung, V.T. New algorithms and convergence theorems for solving variational inequalities with non-Lipschitz mappings. Numer. Algorithms 2021, 87, 527–549. [Google Scholar] [CrossRef]
  28. Iusem, A.N.; Nasri, M. Korpelevich’s method for variational inequality problems in Banach spaces. J. Global Optim. 2011, 50, 59–76. [Google Scholar] [CrossRef]
  29. Goebel, K.; Reich, S. Uniform Convexity, Hyperbolic Geometry, and Nonexpansive Mappings; Marcel Dekker: New York, NY, USA, 1984. [Google Scholar]
  30. Chang, S.S.; Lee, H.W.J.; Chan, C.K. A new method for solving equilibrium problem fixed point problem and variational inequality problem with application to optimization. Nonlinear Anal. 2009, 70, 3307–3319. [Google Scholar] [CrossRef]
  31. Opial, Z. Weak convergence of the sequence of successive approximations for nonexpansive mappings. Bull. Am. Math. Soc. 1967, 73, 591–597. [Google Scholar] [CrossRef] [Green Version]
  32. Xu, H.K.; Kim, T.H. Convergence of hybrid steepest-descent methods for variational inequalities. J. Optim. Theory Appl. 2003, 119, 185–201. [Google Scholar] [CrossRef]
  33. Ceng, L.C.; Xu, H.K.; Yao, J.C. The viscosity approximation method for asymptotically nonexpansive mappings in Banach spaces. Nonlinear Anal. 2008, 69, 1402–1412. [Google Scholar] [CrossRef]
  34. Maingé, P.E. Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization. Set-Valued Anal. 2008, 16, 899–912. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Cui, Y.-L.; Ceng, L.-C.; Zhang, F.-F.; Wang, C.-S.; Li, J.-Y.; Hu, H.-Y.; He, L. Modified Mann-Type Subgradient Extragradient Rules for Variational Inequalities and Common Fixed Points Implicating Countably Many Nonexpansive Operators. Mathematics 2022, 10, 1949. https://0-doi-org.brum.beds.ac.uk/10.3390/math10111949

AMA Style

Cui Y-L, Ceng L-C, Zhang F-F, Wang C-S, Li J-Y, Hu H-Y, He L. Modified Mann-Type Subgradient Extragradient Rules for Variational Inequalities and Common Fixed Points Implicating Countably Many Nonexpansive Operators. Mathematics. 2022; 10(11):1949. https://0-doi-org.brum.beds.ac.uk/10.3390/math10111949

Chicago/Turabian Style

Cui, Yun-Ling, Lu-Chuan Ceng, Fang-Fei Zhang, Cong-Shan Wang, Jian-Ye Li, Hui-Ying Hu, and Long He. 2022. "Modified Mann-Type Subgradient Extragradient Rules for Variational Inequalities and Common Fixed Points Implicating Countably Many Nonexpansive Operators" Mathematics 10, no. 11: 1949. https://0-doi-org.brum.beds.ac.uk/10.3390/math10111949

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