Next Article in Journal
Prioritised Learning in Snowdrift-Type Games
Next Article in Special Issue
On Jungck–Branciari–Wardowski Type Fixed Point Results
Previous Article in Journal
Discrete Predictive Models for Stability Analysis of Power Supply Systems
Previous Article in Special Issue
Generalized Almost Periodicity in Lebesgue Spaces with Variable Exponents, Part II
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A New Algorithm for the Common Solutions of a Generalized Variational Inequality System and a Nonlinear Operator Equation in Banach Spaces

College of Mathematics and Computer Science, with College of Xingzhi, Zhejiang Normal University, 268 Yingbin Road, Jinhua 321004, Zhejiang, China
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Mathematics 2020, 8(11), 1944; https://doi.org/10.3390/math8111944
Submission received: 2 September 2020 / Revised: 24 October 2020 / Accepted: 27 October 2020 / Published: 4 November 2020
(This article belongs to the Special Issue Fixed Point Theory and Dynamical Systems with Applications)

Abstract

:
We study a new algorithm for the common solutions of a generalized variational inequality system and the fixed points of an asymptotically non-expansive mapping in Banach spaces. Under some specific assumptions imposed on the control parameters, some strong convergence theorems for the sequence generated by our new viscosity iterative scheme to approximate their common solutions are proved. As an application of our main results, we solve the standard constrained convex optimization problem. The results here generalize and improve some other authors’ recently corresponding results.

1. Introduction

In the paper, we assume that X is a real Banach space and X * is the dual space of X. The normalized duality mapping J : X 2 X * is defined by
J ( v ) = { f X * : v , f = v f , v = f } , v X ,
where · , · denotes the duality pairing between X and X * . As we all know, the mapping J is well defined and J is identity mapping if and only if X is a Hilbert space. In general, J is multiple-valued and nonlinear, j J .
A Banach space X is called strictly convex if x + y 2 < 1 for x = y = 1 and x y . The modulus of convexity of X is defined by
δ X ( ϵ ) = inf 1 1 2 ( v + u ) : v = u 1 , v u = ϵ ,
for all 0 < ϵ 2 . X is said to be uniformly convex if δ X ( ϵ ) > 0 for all 0 < ϵ 2 .
Let ρ X : [ 0 , + ) [ 0 , + ) be the modulus of smoothness of X defined by
ρ X ( ζ ) = sup 1 2 ( v + u + v u ) 1 : v = 1 ; u = ζ .
A Banach space X is called uniformly smooth if ρ X ( ζ ) ζ 0 as ζ 0 . Moreover, X is uniformly smooth if the norm of X is uniformly Fr e ´ chet differentiable.
Suppose C X , T : C C is an operator and the set of fixed points of T is denoted by F i x ( T ) , that is F i x ( T ) = { v C : v = T v } . T is said to be asymptotically non-expansive, if there exists a real sequence { k n } [ 1 , ) with lim n k n = 1 such that
T n v T n u k n v u , v , u C .
If k n 1 , then we call that T is non-expansive. T is said to be uniformly asymptotically regular iff lim n T n + 1 v T n v = 0 , v C . T is said to be a contraction when there exists a number η ( 0 , 1 ) such that T v T u η v u , v , u C .
A mapping B ^ : C X is called inverse strongly accretive if there exists e R + such that
B ^ v B ^ u , j ( v u ) e B ^ v B ^ u 2 , v , u C .
A bounded linear operator B ^ on X is called strongly positive, if there exists a fixed number δ ¯ > 0 such that
B ^ v , j ( v ) δ ¯ v 2 , e 1 I e 2 B ^ = sup v 1 | ( e 1 I e 2 B ^ ) v , j ( v ) | , e 1 [ 0 , 1 ] , e 2 [ 1 , 1 ] , v X .
Assume E , E C X is a convex and closed set. An operator Q : C E is called sunny when Q has the following relation:
Q ( v + α ( v Q ( v ) ) ) = Q ( v ) , v C , α 0 ,
for v + α ( v Q ( v ) ) C . A mapping Q : C E is called retraction if Q v = v , v E . Moreover, Q is called sunny non-expansive retraction from C onto E iff Q is a sunny, retraction, and non-expansive operator from C onto E.
Let C be a nonempty closed convex subset of X and A , B : C X be two nonlinear mappings, respectively. Recall the classical variational inequality problem is to find a point p C such that
A p , j ( v p ) 0 , v C .
The set of the solutions of the variational inequality (1) is denoted by V I ( C , A ) . Lots of problems in physics, optimization, differential equation (inclusion), finance and minimax problem reduce to find an element of (1) and relevant numerical analysis methods can be considered to solve the problems, see [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16].
In 2011, Katchang et al. [17] introduced the following system of general variational inequalities. They considered the problem of finding ( t , s ) C × C such that:
λ A s + t s , j ( v t ) 0 , v C , μ B t + s t , j ( v s ) 0 , v C ,
and proved a strong convergence theorem for the following sequence of problem (2):
u n = Q C ( I μ B ) v n , v n + 1 = α n f ( v n ) + β n v n + γ n [ β S v n + ( 1 β ) Q C ( I λ A ) u n ] ,
where { α n } , { β n } , { γ n } ( 0 , 1 ) , λ and μ are two positive real numbers, 0 < β < 1 , Q C is the sunny non-expansive retraction from X to C, f is a contractive mapping on C and S : C C is a non-expansive mapping.
In 2020, Wang et al. [18] investigated a new general variational inequality system:
( I λ A ) ( b t + ( 1 b ) s ) t , j ( v t ) 0 , v C , ( I μ B ) t s , j ( v s ) 0 , v C ,
and proposed the following iterative method:
w n = Q C ( I μ B ) v n , l n = Q C ( I λ A ) ( b v n + ( 1 b ) l n ) , u n = δ n v n + ( 1 δ n ) l n , v n + 1 = α n f ( v n ) + β n v n + γ n T n u n ,
where { α n } , { β n } , { γ n } , { δ n } ( 0 , 1 ) , λ and μ are two positive real numbers, 0 b 1 , Q C is the sunny non-expansive retraction from X to C, f is a contractive mapping on C and T : C C is an asymptotically non-expansive mapping. Then they proved that v n converges to the common element of the fixed points of an asymptotically non-expansive mapping and the solutions of the general variational inequality system (3).
Inspired by the above mentioned results, we study the following new generalized variational inequality system in uniformly convex and uniformly smooth Banach spaces:
t ( I λ 1 B 1 ) ( b t + ( 1 b ) s ) , j ( v t ) 0 , v C , s ( I λ 2 B 2 ) ( b t + ( 1 b ) w ) , j ( v s ) 0 , v C , w ( I λ 3 B 3 ) t , j ( v w ) 0 , v C .
This is the main problem which we seek to solve in this work and construct the suitable abstract iterative method. The new generalized variational inequality system problem (4) contains (1)–(3) as special cases. We construct a new iterative algorithm to approximate the common solutions of the generalized system of variational inequality (4) and an asymptotically non-expansive mapping. Some strong convergence theorems that depend on some suitable conditions are proved. Eventually, we show an application for solving the standard constrained problem of convex optimization to illustrate the efficiency of our main theorem. Some other outcomes proposed by other authors are also improved, see [9,10,17,18,19,20,21,22].

2. Preliminaries

This section contains the useful lemmas that are indispensable for proving our convergence theorem in the following section. Generally speaking, we suppose that space X is uniformly smooth and uniformly convex in this section.
Lemma 1
([18]). Suppose that X C and C is a closed convex set. Let J be the normalized duality mapping J : X 2 X * and Q : X C be a retraction. Then the followings are equivalent:
(I) 
Q is sunny and non-expansive;
(II) 
v Q v , J ( u Q v ) 0 , v X , u C ;
(III) 
Q v Q u 2 v u , J ( Q v Q u ) , v , u X .
Lemma 2
([23]). Assume X is uniformly convex and V R ( 0 ) is a closed ball of X. Then there exists a continuous strictly increasing convex function m 1 : [ 0 , ) [ 0 , ) with m 1 ( 0 ) = 0 such that
a 1 v 1 + a 2 v 2 + + a n v n 2 = i = 1 n a i v i 2 a x a y m 1 ( v x v y ) ,
for any x , y { 1 , 2 , . . . , n } and for v i V R ( 0 ) : = { v X : v R } , i = 1 , 2 , . . . , n with i = 1 n a i = 1 .
Lemma 3
([24]). Suppose { v n } and { z n } are two bounded sequences of X. Let { μ n } [ 0 , 1 ] be a number sequence with 0 < lim inf n μ n lim sup n μ n < 1 . Assume that v n + 1 = ( 1 μ n ) v n + μ n z n , n 0 and lim sup n ( z n + 1 z n v n + 1 v n ) 0 . Then lim n z n v n = 0 .
Lemma 4
([25]). For v , u X , j ( v + u ) J ( v + u ) , there holds the relation:
v + u 2 v 2 + 2 u , j ( v + u ) .
Lemma 5
([26]). Let { c n } be a nonnegative number sequence satisfying:
c n + 1 ( 1 σ n ) c n + σ n θ n , n 0 ,
where
{ σ n } [ 0 , 1 ] , n = 0 σ n = + ; lim sup n θ n 0 o r n = 1 | σ n θ n | < + .
Then lim n c n = 0 .
Lemma 6
([27]). Suppose that V ¯ is a strongly positive linear bounded operator on X with coefficient δ ¯ > 0 and 0 < ρ V ¯ 1 . Then, I ρ V ¯ 1 ρ δ ¯ .
Lemma 7
([18]). Assume C is a nonempty convex and closed subset of X. Assume mapping B ^ : C X is a b ^ -inverse strongly accretive. Then,
( I λ B ^ ) v ( I λ B ^ ) u 2 v u 2 λ ( 2 b ^ λ ) B ^ v B ^ u 2 , λ > 0 .
If 0 < λ < 2 b ^ , then I λ B ^ is non-expansive.
Lemma 8
([28]). Let C be a closed convex subset of X. Suppose Q C : X C is a sunny non-expansive mapping and B ^ is an accretive operator from C into X. Then,
V I ( C , B ^ ) = F i x ( Q C ( I λ B ^ ) ) , λ > 0 ,
where V I ( C , B ^ ) = { t C : B ^ t , j ( v t ) 0 , v C } .
Lemma 9
([18]). There exists a convex continuous strictly increasing function m 2 : [ 0 , 2 r ] R , m 2 ( 0 ) = 0 such that
m 2 ( v u ) v 2 2 v , j ( u ) + u 2 , r > 0 , v , u B r .
Lemma 10
([9]). Assume C X is a closed convex set. Suppose T : C C is an asymptotically non-expansive mapping and F i x ( T ) . If X has a weakly sequentially continuous duality mapping J , then the mapping I T is demi-closed at zero, where I is the identity mapping, i.e., if v n v and v n T v n 0 , then v = T v .
Lemma 11.
Assume X C is a closed convex set. Let B 1 , B 2 , B 3 : C X be three mappings, respectively. When λ 1 , λ 2 , λ 3 > 0 , b [ 0 , 1 ) , then the following statements are the same:
(i) 
( t , s , w ) C × C × C is a solution of the problem (4);
(ii) 
t is a fixed point of the mapping L, i.e., t F i x ( L ) , where L : C C is defined by
L ( v ) = Q C ( I λ 1 B 1 ) ( b v + ( 1 b ) Q C ( I λ 2 B 2 ) ( b v + ( 1 b ) Q C ( I λ 3 B 3 ) v ) ) , v C ,
and s = Q C ( I λ 2 B 2 ) ( b t + ( 1 b ) w ) , w = Q C ( I λ 3 B 3 ) t .
Proof. 
( i ) ( i i ) . Assume that ( t , s , w ) C × C × C is a solution of (4). For all v C , we have
t ( I λ 1 B 1 ) ( b t + ( 1 b ) s ) , j ( v t ) 0 , s ( I λ 2 B 2 ) ( b t + ( 1 b ) w ) , j ( v s ) 0 , w ( I λ 3 B 3 ) t , j ( v w ) 0 .
From property of Q C , we get
t = Q C ( I λ 1 B 1 ) ( b t + ( 1 b ) s ) , s = Q C ( I λ 2 B 2 ) ( b t + ( 1 b ) w ) , w = Q C ( I λ 3 B 3 ) t .
It implies that
t = Q C ( I λ 1 B 1 ) ( b t + ( 1 b ) Q C ( I λ 2 B 2 ) ( b t + ( 1 b ) Q C ( I λ 3 B 3 ) t ) ) = L ( t ) .
Then t F i x ( L ) , where s = Q C ( I λ 2 B 2 ) ( b t + ( 1 b ) w ) and w = Q C ( I λ 3 B 3 ) t .
( i i ) ( i ) . Let t F i x ( L ) , s = Q C ( I λ 2 B 2 ) ( b t + ( 1 b ) w ) and w = Q C ( I λ 3 B 3 ) t . Since t F i x ( L ) , we have
t = Q C ( I λ 1 B 1 ) ( b t + ( 1 b ) Q C ( I λ 2 B 2 ) ( b t + ( 1 b ) Q C ( I λ 3 B 3 ) t ) ) = Q C ( I λ 1 B 1 ) ( b t + ( 1 b ) s ) .
In combination with s = Q C ( I λ 2 B 2 ) ( b t + ( 1 b ) w ) , w = Q C ( I λ 3 B 3 ) t and the property of Q C , we get
t ( I λ 1 B 1 ) ( b t + ( 1 b ) s ) , j ( v t ) 0 , v C , s ( I λ 2 B 2 ) ( b t + ( 1 b ) w ) , j ( v s ) 0 , v C , w ( I λ 3 B 3 ) t , j ( v w ) 0 , v C .
Then ( t , s , w ) C × C × C is a solution of the problem (4). □

3. Results

Theorem 1.
Suppose X is a uniformly smooth and uniformly convex Banach space and C is a closed convex subset of X. Assume Q C : X C is a sunny non-expansive retraction. Let B ^ , B 1 , B 2 , B 3 : C X be b ^ , b 1 , b 2 , b 3 -inverse strongly accretive, respectively. L is the mapping defined by (5) in Lemma 11 and b [ 0 , 1 ) . Assume V ¯ : X X is a bounded linear strongly positive operator on X with coefficient δ ¯ > 0 and 0 < δ ¯ < V ¯ 1 . Let g be an η ( 0 , 1 ) -contraction mapping on C and T : C C be an asymptotically non-expansive mapping with Ψ = F i x ( T ) F i x ( L ) V I ( C , B ^ ) . Assume { v n } is defined as follows:
v 1 C , u n = β n δ g ( v n ) + ( I β n V ¯ ) L v n , v n + 1 = μ n v n + ν n T n ( ξ n v n + ( 1 ξ n ) v n + 1 ) + ω n Q C ( I λ B ^ ) u n , n 0 ,
where λ ( 0 , 2 b ^ ) , { β n } ( 0 , 1 ) , μ n + ν n + ω n = 1 , and the following coefficient conditions are satisfying:
(i) 
lim n β n = 0 , n = 0 β n = , n = 1 | β n + 1 β n | < ;
(ii) 
0 < h 1 μ n , ν n , ω n h 2 < 1 , n = 1 | μ n + 1 μ n | < , n = 1 | ν n + 1 ν n | < , n = 1 | ω n + 1 ω n | < ;
(iii) 
0 ξ n ξ n + 1 1 , 0 < δ < h 1 δ ¯ 2 η , k n 2 1 = ε β n , 0 < ε < h 1 δ ¯ 2 h 1 δ η ;
(iv) 
ν n k n 2 ( 1 ξ n ) < 1 τ , h 2 < τ < 1 .
Then the sequence { v n } converges strongly to t = Q Ψ ( I V ¯ + δ g ) t Ψ and ( t , s , w ) is a solution of (4), where s = Q C ( I λ 2 B 2 ) ( b t + ( 1 b ) w ) and w = Q C ( I λ 3 B 3 ) t , λ 1 , λ 2 , λ 3 ( 0 , 2 b ¯ ) with b ¯ = m i n { b 1 , b 2 , b 3 } .
Proof. 
Our proof process can be divided into 6 steps.
Step 1: Let B ^ , B 1 , B 2 , B 3 be b ^ , b 1 , b 2 , b 3 -inverse strongly accretive mapping, respectively, and λ ( 0 , 2 b ^ ) , λ 1 , λ 2 , λ 3 ( 0 , 2 b ¯ ) with b ¯ = m i n { b 1 , b 2 , b 3 } . From Lemma 7, we know that ( I λ B ^ ) , ( I λ 1 B 1 ) , ( I λ 2 B 2 ) and ( I λ 3 B 3 ) are non-expansive mappings. Moveover, we attain that Q C ( I λ B ^ ) , Q C ( I λ 1 B 1 ) , Q C ( I λ 2 B 2 ) and Q C ( I λ 3 B 3 ) are non-expansive mapping.
So, we have
L v L u = Q C ( I λ 1 B 1 ) ( b v + ( 1 b ) Q C ( I λ 2 B 2 ) ( b v + ( 1 b ) Q C ( I λ 3 B 3 ) v ) ) Q C ( I λ 1 B 1 ) ( b u + ( 1 b ) Q C ( I λ 2 B 2 ) ( b u + ( 1 b ) Q C ( I λ 3 B 3 ) u ) ) ( b v + ( 1 b ) Q C ( I λ 2 B 2 ) ( b v + ( 1 b ) Q C ( I λ 3 B 3 ) v ) ) ( b u + ( 1 b ) Q C ( I λ 2 B 2 ) ( b u + ( 1 b ) Q C ( I λ 3 B 3 ) u ) ) b v u + ( 1 b ) Q C ( I λ 2 B 2 ) ( b v + ( 1 b ) Q C ( I λ 3 B 3 ) v ) Q C ( I λ 2 B 2 ) ( b u + ( 1 b ) Q C ( I λ 3 B 3 ) u ) b v u + ( 1 b ) ( b v + ( 1 b ) Q C ( I λ 3 B 3 ) v ) ( b u + ( 1 b ) Q C ( I λ 3 B 3 ) u ) b v u + ( 1 b ) ( b v u + ( 1 b ) Q C ( I λ 3 B 3 ) v Q C ( I λ 3 B 3 ) u ) b v u + ( 1 b ) ( b v u + ( 1 b ) v u ) = v u .
Then, L is non-expansive.
Step 2: For any given q Ψ , from (6), we have
T n ( ξ n v n + ( 1 ξ n ) v n + 1 ) q k n ξ n v n + ( 1 ξ n ) v n + 1 q k n ξ n v n q + k n ( 1 ξ n ) v n + 1 q ,
and
u n q = β n δ g ( v n ) + ( I β n V ¯ ) L v n q β n δ g ( v n ) V ¯ q + ( I β n V ¯ ) ( L v n q ) β n δ g ( v n ) δ g ( q ) + β n δ g ( q ) V ¯ q + ( 1 β n δ ¯ ) v n q β n δ η v n q + β n δ g ( q ) V ¯ q + ( 1 β n δ ¯ ) v n q [ 1 β n ( δ ¯ δ η ) ] v n q + β n δ g ( q ) V ¯ q .
Then we compute
v n + 1 q = μ n v n + ν n T n ( ξ n v n + ( 1 ξ n ) v n + 1 ) + ω n Q C ( I λ B ^ ) u n q μ n ( v n q ) + ν n ( T n ( ξ n v n + ( 1 ξ n ) v n + 1 ) q ) + ω n ( Q C ( I λ B ^ ) u n q ) μ n v n q + ν n T n ( ξ n v n + ( 1 ξ n ) v n + 1 ) q + ω n u n q μ n v n q + ν n k n ξ n v n q + ν n k n ( 1 ξ n ) v n + 1 q + ω n [ 1 β n ( δ ¯ δ η ) ] v n q + ω n β n δ g ( q ) V ¯ q ( μ n + ν n k n ξ n + ω n [ 1 β n ( δ ¯ δ η ) ] ) v n q + ν n k n ( 1 ξ n ) v n + 1 q + ω n β n δ g ( q ) V ¯ q .
It follows that
( 1 ν n k n ( 1 ξ n ) ) v n + 1 q ( μ n + ν n k n ξ n + ω n [ 1 β n ( δ ¯ δ η ) ] ) v n q + ω n β n δ g ( q ) V ¯ q .
From conditions ( i i ) , ( i i i ) and ( i v ) in Theorem 1, we get
v n + 1 q μ n + ν n k n ξ n + ω n [ 1 β n ( δ ¯ δ η ) ] 1 ν n k n ( 1 ξ n ) v n q + ω n β n 1 ν n k n ( 1 ξ n ) δ g ( q ) V ¯ q ( 1 ω n β n ( δ ¯ δ η ) ν n ( k n 1 ) 1 ν n k n ( 1 ξ n ) ) v n q + ω n β n 1 ν n k n ( 1 ξ n ) δ g ( q ) V ¯ q ( 1 h 1 β n ( δ ¯ δ η ) ε β n 1 ν n k n ( 1 ξ n ) ) v n q + β n 1 ν n k n ( 1 ξ n ) δ g ( q ) V ¯ q ( 1 β n ( h 1 δ ¯ h 1 δ η ε ) 1 ν n k n ( 1 ξ n ) ) v n q + β n ( h 1 δ ¯ h 1 δ η ε ) 1 ν n k n ( 1 ξ n ) δ g ( q ) V ¯ q h 1 δ ¯ h 1 δ η ε m a x { v n q , δ g ( q ) V ¯ q h 1 δ ¯ h 1 δ η ε } .
By induction, we readily obtain
v n + 1 q max { v 1 q , δ g ( q ) V ¯ q h 1 δ ¯ h 1 δ η ε } .
This implies that { v n } is bounded, and so are { u n } , { g ( v n ) } , { L v n } , { T n ( ξ n v n + ( 1 ξ n ) v n + 1 ) } .
Step 3: By (6) and Lemma 6, we gain that
u n + 1 u n = β n + 1 δ g ( v n + 1 ) + ( I β n + 1 V ¯ ) L v n + 1 ( β n δ g ( v n ) + ( I β n V ¯ ) L v n ) = β n + 1 δ g ( v n + 1 ) β n + 1 δ g ( v n ) + β n + 1 δ g ( v n ) β n δ g ( v n ) + ( I β n + 1 V ¯ ) L v n + 1 ( I β n + 1 V ¯ ) L v n + ( I β n + 1 V ¯ ) L v n ( I β n V ¯ ) L v n = β n + 1 δ [ g ( v n + 1 ) g ( v n ) ] + ( β n + 1 β n ) δ g ( v n ) + ( I β n + 1 V ¯ ) ( L v n + 1 L v n ) ( β n + 1 β n ) V ¯ L v n β n + 1 δ g ( v n + 1 ) g ( v n ) + | β n + 1 β n | δ g ( v n ) V ¯ L v n + I β n + 1 V ¯ L v n + 1 L v n β n + 1 δ η v n + 1 v n + | β n + 1 β n | δ g ( v n ) V ¯ L v n + ( 1 β n + 1 δ ¯ ) v n + 1 v n = ( 1 β n + 1 ( δ ¯ δ η ) ) v n + 1 v n + | β n + 1 β n | δ g ( v n ) V ¯ L v n v n + 1 v n + | β n + 1 β n | δ g ( v n ) V ¯ L v n .
By (6) and (7), we can acquire
v n + 2 v n + 1 = μ n + 1 v n + 1 + ν n + 1 T n + 1 ( ξ n + 1 v n + 1 + ( 1 ξ n + 1 ) v n + 2 ) + ω n + 1 Q C ( I λ B ^ ) u n + 1 [ μ n v n + ν n T n ( ξ n v n + ( 1 ξ n ) v n + 1 ) + ω n Q C ( I λ B ^ ) u n ] = μ n + 1 ( v n + 1 v n ) + ( μ n + 1 μ n ) v n + ν n + 1 ( T n + 1 ( ξ n + 1 v n + 1 + ( 1 ξ n + 1 ) v n + 2 ) T n + 1 ( ξ n v n + ( 1 ξ n ) v n + 1 ) ) + ( ν n + 1 ν n ) T n + 1 ( ξ n v n + ( 1 ξ n ) v n + 1 ) + ν n [ T n + 1 ( ξ n v n + ( 1 ξ n ) v n + 1 ) T n ( ξ n v n + ( 1 ξ n ) v n + 1 ) ] + ω n + 1 [ Q C ( I λ B ^ ) u n + 1 Q C ( I λ B ^ ) u n ] + ( ω n + 1 ω n ) Q C ( I λ B ^ ) u n μ n + 1 v n + 1 v n + | μ n + 1 μ n | v n + ν n + 1 k n + 1 ( ξ n + 1 v n + 1 + ( 1 ξ n + 1 ) v n + 2 ) ( ξ n v n + ( 1 ξ n ) v n + 1 ) ) + | ν n + 1 ν n | T n + 1 v + ν n sup v C T n + 1 v T n v + ω n + 1 Q C ( I λ B ^ ) u n + 1 Q C ( I λ B ^ ) u n + | ω n + 1 ω n | Q C ( I λ B ^ ) u n
μ n + 1 v n + 1 v n + | μ n + 1 μ n | v n + ν n + 1 k n + 1 ξ n v n + 1 v n + ν n + 1 k n + 1 ( 1 ξ n + 1 ) v n + 2 v n + 1 + | ν n + 1 ν n | T n + 1 v + ν n sup v C T n + 1 v T n v + ω n + 1 u n + 1 u n + | ω n + 1 ω n | Q C ( I λ B ^ ) u n μ n + 1 v n + 1 v n + | μ n + 1 μ n | v n + ν n + 1 k n + 1 ξ n v n + 1 v n + ν n + 1 k n + 1 ( 1 ξ n + 1 ) v n + 2 v n + 1 + | ν n + 1 ν n | T n + 1 v + ν n sup v C T n + 1 v T n v + ω n + 1 ( v n + 1 v n + | β n + 1 β n | δ g ( v n ) V ¯ L v n ) + | ω n + 1 ω n | Q C ( I λ B ^ ) u n ( μ n + 1 + ν n + 1 k n + 1 ξ n + ω n + 1 ) v n + 1 v n + ν n + 1 k n + 1 ( 1 ξ n + 1 ) v n + 2 v n + 1 + | μ n + 1 μ n | v n + | ν n + 1 ν n | T n + 1 v + ν n sup v C T n + 1 v T n v + ω n + 1 | β n + 1 β n | δ g ( v n ) V ¯ L v n + | ω n + 1 ω n | Q C ( I λ B ^ ) u n .
Which implies that
[ 1 ν n + 1 k n + 1 ( 1 ξ n + 1 ) ] v n + 2 v n + 1 ( μ n + 1 + ν n + 1 k n + 1 ξ n + ω n + 1 ) v n + 1 v n + | μ n + 1 μ n | v n + | ν n + 1 ν n | T n + 1 v + ν n sup v C T n + 1 v T n v + ω n + 1 | β n + 1 β n | δ g ( v n ) V ¯ L v n + | ω n + 1 ω n | Q C ( I λ B ^ ) u n .
By conditions ( i i ) ( i v ) in Theorem 1, we have
v n + 2 v n + 1 μ n + 1 + ν n + 1 k n + 1 ξ n + ω n + 1 1 ν n + 1 k n + 1 ( 1 ξ n + 1 ) v n + 1 v n + | μ n + 1 μ n | 1 ν n + 1 k n + 1 ( 1 ξ n + 1 ) v n + | ν n + 1 ν n | 1 ν n + 1 k n + 1 ( 1 ξ n + 1 ) T n + 1 v + ν n 1 ν n + 1 k n + 1 ( 1 ξ n + 1 ) sup v C T n + 1 v T n v + ω n + 1 | β n + 1 β n | 1 ν n + 1 k n + 1 ( 1 ξ n + 1 ) δ g ( v n ) V ¯ L v n + | ω n + 1 ω n | 1 ν n + 1 k n + 1 ( 1 ξ n + 1 ) Q C ( I λ B ^ ) u n [ 1 + ν n + 1 ( k n + 1 1 ) ν n + 1 k n + 1 ( ξ n + 1 ξ n ) 1 ν n + 1 k n + 1 ( 1 ξ n + 1 ) ] v n + 1 v n + | μ n + 1 μ n | 1 ν n + 1 k n + 1 ( 1 ξ n + 1 ) v n + | ν n + 1 ν n | 1 ν n + 1 k n + 1 ( 1 ξ n + 1 ) T n + 1 v + ν n 1 ν n + 1 k n + 1 ( 1 ξ n + 1 ) sup v C T n + 1 v T n v + ω n + 1 | β n + 1 β n | 1 ν n + 1 k n + 1 ( 1 ξ n + 1 ) δ g ( v n ) V ¯ L v n + | ω n + 1 ω n | 1 ν n + 1 k n + 1 ( 1 ξ n + 1 ) Q C ( I λ B ^ ) u n [ 1 + ν n + 1 ( k n + 1 1 ) τ ] v n + 1 v n + ω n + 1 | β n + 1 β n | τ δ g ( v n ) V ¯ L v n + | μ n + 1 μ n | τ v n + | ν n + 1 ν n | τ T n + 1 v + ν n τ sup v C T n + 1 v T n v + | ω n + 1 ω n | τ Q C ( I λ B ^ ) u n ( 1 + ε β n + 1 ) v n + 1 v n + M n 1 ,
where
M n 1 = | μ n + 1 μ n | τ v n + | ν n + 1 ν n | τ T n + 1 v + ν n τ sup v C T n + 1 v T n v + ω n + 1 | β n + 1 β n | τ δ g ( v n ) V ¯ L v n + | ω n + 1 ω n | τ Q C ( I λ B ^ ) u n .
We set
v n + 1 = ( 1 μ n ) z n + μ n v n ,
where
z n = v n + 1 μ n v n 1 μ n , n 0 .
Since
v n + 1 μ n v n = ν n T n ( ξ n v n + ( 1 ξ n ) v n + 1 ) + ω n Q C ( I λ B ^ ) u n ,
we attain
z n + 1 z n = v n + 2 μ n v n + 1 1 μ n + 1 v n + 1 μ n v n 1 μ n = ν n + 1 T n + 1 ( ξ n + 1 v n + 1 + ( 1 ξ n + 1 ) v n + 2 ) + ω n + 1 Q C ( I λ B ^ ) u n + 1 1 μ n + 1 ν n T n ( ξ n v n + ( 1 ξ n ) v n + 1 ) + ω n Q C ( I λ B ^ ) u n 1 μ n = ν n + 1 1 μ n + 1 T n + 1 ( ξ n + 1 v n + 1 + ( 1 ξ n + 1 ) v n + 2 ) ν n 1 μ n T n ( ξ n v n + ( 1 ξ n ) v n + 1 ) + ω n + 1 1 μ n + 1 Q C ( I λ B ^ ) u n + 1 ω n 1 μ n Q C ( I λ B ^ ) u n = ν n + 1 1 μ n + 1 T n + 1 ( ξ n + 1 v n + 1 + ( 1 ξ n + 1 ) v n + 2 ) ν n + 1 1 μ n + 1 T n + 1 ( ξ n v n + ( 1 ξ n ) v n + 1 ) + ν n + 1 1 μ n + 1 T n + 1 ( ξ n v n + ( 1 ξ n ) v n + 1 ) ν n 1 μ n T n + 1 ( ξ n v n + ( 1 ξ n ) v n + 1 ) + ν n 1 μ n T n + 1 ( ξ n v n + ( 1 ξ n ) v n + 1 ) ν n 1 μ n T n ( ξ n v n + ( 1 ξ n ) v n + 1 ) + ω n + 1 1 μ n + 1 Q C ( I λ B ^ ) u n + 1 ω n + 1 1 μ n + 1 Q C ( I λ B ^ ) u n + ω n + 1 1 μ n + 1 Q C ( I λ B ^ ) u n ω n 1 μ n Q C ( I λ B ^ ) u n = ν n + 1 1 μ n + 1 ( T n + 1 ( ξ n + 1 v n + 1 + ( 1 ξ n + 1 ) v n + 2 ) T n + 1 ( ξ n v n + ( 1 ξ n ) v n + 1 ) ) + ( ν n + 1 1 μ n + 1 ν n 1 μ n ) T n + 1 ( ξ n v n + ( 1 ξ n ) v n + 1 ) + ν n 1 μ n ( T n + 1 ( ξ n v n + ( 1 ξ n ) v n + 1 ) T n ( ξ n v n + ( 1 ξ n ) v n + 1 ) ) + ω n + 1 1 μ n + 1 ( Q C ( I λ B ^ ) u n + 1 Q C ( I λ B ^ ) u n ) + ( ω n + 1 1 μ n + 1 ω n 1 μ n ) Q C ( I λ B ^ ) u n .
Thus, we acquire
z n + 1 z n ν n + 1 1 μ n + 1 T n + 1 ( ξ n + 1 v n + 1 + ( 1 ξ n + 1 ) v n + 2 ) T n + 1 ( ξ n v n + ( 1 ξ n ) v n + 1 ) + | ν n + 1 1 μ n + 1 ν n 1 μ n | T n + 1 v + ν n 1 μ n T n + 1 v T n v + ω n + 1 1 μ n + 1 Q C ( I λ B ^ ) u n + 1 Q C ( I λ B ^ ) u n + | ω n + 1 1 μ n + 1 ω n 1 μ n | Q C ( I λ B ^ ) u n
ν n + 1 1 μ n + 1 k n + 1 ξ n + 1 v n + 1 + ( 1 ξ n + 1 ) v n + 2 [ ξ n v n + ( 1 ξ n ) v n + 1 ] + | ν n + 1 1 μ n + 1 ν n 1 μ n | T n + 1 v + ν n 1 μ n T n + 1 v T n v + ω n + 1 1 μ n + 1 u n + 1 u n + | ω n + 1 1 μ n + 1 ω n 1 μ n | Q C ( I λ B ^ ) u n ν n + 1 1 μ n + 1 k n + 1 ξ n ( v n + 1 v n ) + ( 1 ξ n + 1 ) ( v n + 2 v n + 1 ) + | ν n + 1 1 μ n + 1 ν n 1 μ n + 1 + ν n 1 μ n + 1 ν n 1 μ n | T n + 1 v + ν n 1 μ n sup v C T n + 1 v T n v + ω n + 1 1 μ n + 1 u n + 1 u n + | ω n + 1 1 μ n + 1 ω n 1 μ n + 1 + ω n 1 μ n + 1 ω n 1 μ n | Q C ( I λ B ^ ) u n ν n + 1 k n + 1 ξ n 1 μ n + 1 v n + 1 v n + ν n + 1 k n + 1 ( 1 ξ n + 1 ) 1 μ n + 1 v n + 2 v n + 1 + | ν n + 1 ν n | 1 μ n + 1 T n + 1 v + ν n | μ n + 1 μ n | ( 1 μ n + 1 ) ( 1 μ n ) T n + 1 v + ν n 1 μ n sup v C T n + 1 v T n v + ω n + 1 1 μ n + 1 u n + 1 u n + | ω n + 1 ω n | 1 μ n + 1 Q C ( I λ B ^ ) u n + ω n | μ n + 1 μ n | ( 1 μ n + 1 ) ( 1 μ n ) Q C ( I λ B ^ ) u n ν n + 1 k n + 1 ξ n 1 μ n + 1 v n + 1 v n + ν n + 1 k n + 1 ( 1 ξ n + 1 ) 1 μ n + 1 v n + 2 v n + 1 + | ν n + 1 ν n | 1 μ n + 1 T n + 1 v + | μ n + 1 μ n | ( 1 μ n + 1 ) ( 1 μ n ) T n + 1 v + ν n 1 μ n sup v C T n + 1 v T n v + ω n + 1 1 μ n + 1 u n + 1 u n + | ω n + 1 ω n | 1 μ n + 1 Q C ( I λ B ^ ) u n + | μ n + 1 μ n | ( 1 μ n + 1 ) ( 1 μ n ) Q C ( I λ B ^ ) u n .
From (7), (8) and condition ( i i ) , ( i i i ) in Theorem 1, we can compute
z n + 1 z n ν n + 1 k n + 1 ξ n 1 μ n + 1 v n + 1 v n + ν n + 1 k n + 1 ( 1 ξ n + 1 ) 1 μ n + 1 [ ( 1 + ε β n + 1 ) v n + 1 v n + M n 1 ] + | ν n + 1 ν n | 1 μ n + 1 T n + 1 v + | μ n + 1 μ n | ( 1 μ n + 1 ) ( 1 μ n ) T n + 1 v + ν n 1 μ n sup v C T n + 1 v T n v + ω n + 1 1 μ n + 1 ( v n + 1 v n + | β n + 1 β n | δ g ( v n ) V ¯ L v n ) + | ω n + 1 ω n | 1 μ n + 1 Q C ( I λ B ^ ) u n + | μ n + 1 μ n | ( 1 μ n + 1 ) ( 1 μ n ) Q C ( I λ B ^ ) u n [ ν n + 1 k n + 1 ξ n 1 μ n + 1 + ν n + 1 k n + 1 ( 1 ξ n + 1 ) 1 μ n + 1 ( 1 + ε β n + 1 ) + ω n + 1 1 μ n + 1 ] v n + 1 v n + ν n + 1 k n + 1 ( 1 ξ n + 1 ) 1 μ n + 1 M n 1 + | ν n + 1 ν n | 1 h 2 T n + 1 v + | μ n + 1 μ n | ( 1 h 2 ) 2 T n + 1 v + ν n 1 h 2 sup v C T n + 1 v T n v + ω n + 1 | β n + 1 β n | 1 h 2 δ g ( v n ) V ¯ L v n + | ω n + 1 ω n | 1 h 2 Q C ( I λ B ^ ) u n + | μ n + 1 μ n | ( 1 h 2 ) 2 Q C ( I λ B ^ ) u n [ ν n + 1 k n + 1 ξ n + ν n + 1 k n + 1 ( 1 ξ n + 1 ) + ω n + 1 1 μ n + 1 + ν n + 1 k n + 1 ( 1 ξ n + 1 ) ε β n + 1 1 μ n + 1 ] v n + 1 v n + ν n + 1 k n + 1 ( 1 ξ n + 1 ) 1 μ n + 1 M n 1 + M n 2 [ 1 + ν n + 1 ( k n + 1 ( ξ n + 1 ξ n + 1 ) 1 ) 1 μ n + 1 + ν n + 1 k n + 1 ( 1 ξ n + 1 ) ε β n + 1 1 μ n + 1 ] v n + 1 v n
+ ν n + 1 k n + 1 ( 1 ξ n + 1 ) 1 μ n + 1 M n 1 + M n 2 [ 1 + ν n + 1 ( k n + 1 1 ) 1 μ n + 1 + ν n + 1 k n + 1 ( 1 ξ n + 1 ) ε β n + 1 1 μ n + 1 ] v n + 1 v n + ν n + 1 k n + 1 ( 1 ξ n + 1 ) 1 μ n + 1 M n 1 + M n 2 [ 1 + ν n + 1 ε β n + 1 1 μ n + 1 + ν n + 1 k n + 1 ε β n + 1 1 μ n + 1 ] v n + 1 v n + ν n + 1 k n + 1 ( 1 ξ n + 1 ) 1 μ n + 1 M n 1 + M n 2 [ 1 + ( k n + 1 + 1 ) ν n + 1 ε β n + 1 1 h 2 ] v n + 1 v n + ν n + 1 k n + 1 ( 1 ξ n + 1 ) 1 h 2 M n 1 + M n 2 ,
where
M n 2 = | ν n + 1 ν n | 1 h 2 T n + 1 v + | μ n + 1 μ n | ( 1 h 2 ) 2 T n + 1 v + ν n 1 h 2 sup x C T n + 1 v T n v + ω n + 1 | β n + 1 β n | 1 h 2 δ g ( v n ) V ¯ L v n + | ω n + 1 ω n | 1 h 2 Q C ( I λ B ^ ) u n + | μ n + 1 μ n | ( 1 h 2 ) 2 Q C ( I λ B ^ ) u n .
So, by conditions ( i ) and ( i i ) in Theorem 1, we gain
lim sup n ( z n + 1 z n v n + 1 v n ) 0 .
Adopting Lemma 3, we gain
lim n z n v n = 0 .
Taking notice of v n + 1 v n = ( 1 μ n ) ( z n v n ) . Then
lim n v n + 1 v n = 0 .
From (7), (9) and condition ( i ) in Theorem 1, we receive
lim n u n + 1 u n = 0 .
Step 4: Again by the definition of u n and Lemma 4, we get
u n q 2 = β n δ g ( v n ) + ( I β n V ¯ ) L v n q 2 = ( L v n q ) + ( β n δ g ( v n ) β n V ¯ L v n ) 2 L v n q 2 + 2 β n δ g ( v n ) V ¯ L v n , j ( u n q ) v n q 2 + 2 β n δ g ( v n ) V ¯ L v n u n q .
By the non-expansiveness of Q C , Lemma 7 and (10), we have
v n + 1 q 2 = μ n v n + ν n T n ( ξ n v n + ( 1 ξ n ) v n + 1 ) + ω n Q C ( I λ B ^ ) u n q 2 μ n v n q 2 + ν n T n ( ξ n v n + ( 1 ξ n ) v n + 1 ) q 2 + ω n Q C ( I λ B ^ ) u n q 2 μ n v n q 2 + ν n k n 2 ( ξ n v n + ( 1 ξ n ) v n + 1 ) q 2 + ω n ( I λ B ^ ) u n ( I λ B ^ ) q 2 μ n v n q 2 + ν n k n 2 ξ n v n q 2 + ν n k n 2 ( 1 ξ n ) v n + 1 q 2 + ω n u n q 2 ω n λ ( 2 b ^ λ ) B ^ u n B ^ q 2 μ n v n q 2 + ν n k n 2 ξ n v n q 2 + ν n k n 2 ( 1 ξ n ) v n + 1 q 2 + ω n v n q 2 + 2 ω n β n δ g ( v n ) V ¯ L v n u n q ω n λ ( 2 b ^ λ ) B ^ u n B ^ q 2 ( μ n + ν n k n 2 ξ n + ω n ) v n q 2 + ν n k n 2 ( 1 ξ n ) v n + 1 q 2 + 2 ω n β n δ g ( v n ) V ¯ L v n u n q ω n λ ( 2 b ^ λ ) B ^ u n B ^ q 2 .
This implies that
ω n λ ( 2 b ^ λ ) B ^ u n B ^ q 2 ( μ n + ν n k n 2 ξ n + ω n ) v n q 2 [ 1 ν n k n 2 ( 1 ξ n ) ] v n + 1 q 2 + 2 ω n β n δ g ( v n ) V ¯ L v n u n q ( 1 ν n + ν n k n 2 ξ n ) v n q 2 [ 1 ν n k n 2 ( 1 ξ n ) ] v n + 1 q 2 + 2 ω n β n δ g ( v n ) V ¯ L v n u n q ( 1 ν n k n 2 + ν n k n 2 ξ n + ν n k n 2 ν n ) v n q 2 [ 1 ν n k n 2 ( 1 ξ n ) ] v n + 1 q 2 + 2 ω n β n δ g ( v n ) V ¯ L v n u n q ( 1 ν n k n 2 ( 1 ξ n ) ) [ v n q 2 v n + 1 q 2 ] + 2 ω n β n δ g ( v n ) V ¯ L v n u n q + ν n ( k n 2 1 ) v n q 2 ( v n q + v n + 1 q ) v n v n + 1 + 2 ω n β n δ g ( v n ) V ¯ L v n u n q + ν n ε β n v n q 2 .
By conditions ( i ) , ( i i ) in Theorem 1 and (9), we can acquire
lim n B ^ u n B ^ q = 0 .
Applying Lemma 2 and (10), we obtain
v n + 1 q 2 = μ n v n + ν n T n ( ξ n v n + ( 1 ξ n ) v n + 1 ) + ω n Q C ( I λ B ^ ) u n q 2 μ n v n q 2 + ν n T n ( ξ n v n + ( 1 ξ n ) v n + 1 ) q 2 + ω n Q C ( I λ B ^ ) u n q 2 μ n ν n m 1 ( v n T n ( ξ n v n + ( 1 ξ n ) v n + 1 ) ) μ n ω n m 1 ( v n Q C ( I λ B ^ ) u n ) μ n v n q 2 + ν n k n 2 ( ξ n v n + ( 1 ξ n ) v n + 1 ) q 2 + ω n u n q 2 μ n ν n m 1 ( v n T n ( ξ n v n + ( 1 ξ n ) v n + 1 ) ) μ n ω n m 1 ( v n Q C ( I λ B ^ ) u n ) μ n v n q 2 + ν n k n 2 ξ n v n q 2 + ν n k n 2 ( 1 ξ n ) v n + 1 q 2 + ω n u n q 2 μ n ν n m 1 ( v n T n ( ξ n v n + ( 1 ξ n ) v n + 1 ) ) μ n ω n m 1 ( v n Q C ( I λ B ^ ) u n ) ( μ n + ν n k n 2 ξ n + ω n ) v n q 2 + ν n k n 2 ( 1 ξ n ) v n + 1 q 2 + 2 ω n β n δ g ( v n ) V ¯ L v n u n q μ n ν n m 1 ( v n T n ( ξ n v n + ( 1 ξ n ) v n + 1 ) ) μ n ω n m 1 ( v n Q C ( I λ B ^ ) u n ) .
Which implies that
μ n ν n m 1 ( v n T n ( ξ n v n + ( 1 ξ n ) v n + 1 ) + μ n ω n m 1 ( v n Q C ( I λ B ^ ) u n ) ( μ n + ν n k n 2 ξ n + ω n ) v n q 2 [ 1 ν n k n 2 ( 1 ξ n ) ] v n + 1 q 2 + 2 ω n β n δ g ( v n ) V ¯ L v n u n q ( 1 ν n + ν n k n 2 ξ n ) v n q 2 [ 1 ν n k n 2 ( 1 ξ n ) ] v n + 1 q 2 + 2 ω n β n δ g ( v n ) V ¯ L v n u n q ( 1 ν n k n 2 + ν n k n 2 ξ n + ν n k n 2 ν n ) v n q 2 [ 1 ν n k n 2 ( 1 ξ n ) ] v n + 1 q 2 + 2 ω n β n δ g ( v n ) V ¯ L v n u n q [ 1 ν n k n 2 ( 1 ξ n ) ] ( v n q 2 v n + 1 q 2 ) + ν n ( k n 2 1 ) v n q 2 + 2 ω n β n δ g ( v n ) V ¯ L v n u n q ( v n q + v n + 1 q ) v n v n + 1 + ν n ε β n v n q 2 + 2 ω n β n δ g ( v n ) V ¯ L v n u n q .
From conditions ( i ) , ( i i ) in Theorem 1 and (9), and the properties of the function m 1 , we acquire
lim n v n T n ( ξ n v n + ( 1 ξ n ) v n + 1 ) = 0 ,
and
lim n v n Q C ( I λ B ^ ) u n = 0 .
Applying Lemma 1, Lemma 9 and (10), we gain
Q C ( I λ B ^ ) u n q 2 ( I λ B ^ ) u n ( I λ B ^ ) q , j ( Q C ( I λ B ^ ) u n q ) u n q , j ( Q C ( I λ B ^ ) u n q ) λ B ^ u n B ^ q , j ( Q C ( I λ B ^ ) u n q ) 1 2 [ u n q 2 + Q C ( I λ B ^ ) u n q 2 m 2 ( u n q ( Q C ( I λ B ^ ) u n q ) ) ] λ B ^ u n B ^ q Q C ( I λ B ^ ) u n q 1 2 [ u n q 2 + Q C ( I λ B ^ ) u n q 2 m 2 ( u n Q C ( I λ B ^ ) u n ) ] λ B ^ u n B ^ q Q C ( I λ B ^ ) u n q 1 2 [ v n q 2 + 2 β n δ g ( v n ) V ¯ L v n u n q + Q C ( I λ B ^ ) u n q 2 m 2 ( u n Q C ( I λ B ^ ) u n ) ] λ B ^ u n B ^ q Q C ( I λ B ^ ) u n q .
It follows that
Q C ( I λ B ^ ) u n q 2 v n q 2 + 2 β n δ g ( v n ) V ¯ L v n u n q m 2 ( u n Q C ( I λ B ^ ) u n ) 2 λ B ^ u n B ^ q Q C ( I λ B ^ ) u n q .
Hence, we know that
v n + 1 q 2 = μ n v n + ν n T n ( ξ n v n + ( 1 ξ n ) v n + 1 ) + ω n Q C ( I λ B ^ ) u n q 2 μ n v n q 2 + ν n T n ( ξ n v n + ( 1 ξ n ) v n + 1 ) q 2 + ω n Q C ( I λ B ^ ) u n q 2 μ n v n q 2 + ν n k n 2 ( ξ n v n + ( 1 ξ n ) v n + 1 ) q 2 + ω n Q C ( I λ B ^ ) u n q 2 μ n v n q 2 + ν n k n 2 ξ n v n q 2 + ν n k n 2 ( 1 ξ n ) v n + 1 q 2 + ω n [ v n q 2 + 2 β n δ g ( v n ) V ¯ L v n u n q m 2 ( u n Q C ( I λ B ^ ) u n ) 2 λ B ^ u n B ^ q Q C ( I λ B ^ ) u n q ] ( μ n + ν n k n 2 ξ n + ω n ) v n q 2 + ν n k n 2 ( 1 ξ n ) v n + 1 q 2 + 2 ω n β n δ g ( v n ) V ¯ L v n u n q ω n m 2 ( u n Q C ( I λ B ^ ) u n ) 2 λ ω n B ^ u n B ^ q Q C ( I λ B ^ ) u n q .
Which implies that
ω n m 2 ( u n Q C ( I λ B ^ ) u n ) ( μ n + ν n k n 2 ξ n + ω n ) v n q 2 [ 1 ν n k n 2 ( 1 ξ n ) ] v n + 1 q 2 + 2 ω n β n δ g ( v n ) V ¯ L v n u n q 2 λ ω n B ^ u n B ^ q Q C ( I λ B ^ ) u n q ( 1 ν n + ν n k n 2 ξ n ) v n q 2 [ 1 ν n k n 2 ( 1 ξ n ) ] v n + 1 q 2 + 2 ω n β n δ g ( v n ) V ¯ L v n u n q 2 λ ω n B ^ u n B ^ q Q C ( I λ B ^ ) u n q ( 1 ν n k n 2 + ν n k n 2 ξ n + ν n k n 2 ν n ) v n q 2 [ 1 ν n k n 2 ( 1 ξ n ) ] v n + 1 q 2 + 2 ω n β n δ g ( v n ) V ¯ L v n u n q 2 λ ω n B ^ u n B ^ q Q C ( I λ B ^ ) u n q [ 1 ν n k n 2 ( 1 ξ n ) ] ( v n q 2 v n + 1 q 2 ) + ν n ( k n 2 1 ) v n q 2 + 2 ω n β n δ g ( v n ) V ¯ L v n u n q 2 λ ω n B ^ u n B ^ q Q C ( I λ B ^ ) u n q [ 1 ν n k n 2 ( 1 ξ n ) ] ( v n q + v n + 1 q ) v n v n + 1 + ν n ( k n 2 1 ) v n q 2 + 2 ω n β n δ g ( v n ) V ¯ L v n u n q 2 λ ω n B ^ u n B ^ q Q C ( I λ B ^ ) u n q ( v n q + v n + 1 q ) v n v n + 1 + ν n ε β n v n q 2 + 2 ω n β n δ g ( v n ) V ¯ L v n u n q 2 λ ω n B ^ u n B ^ q Q C ( I λ B ^ ) u n q .
Similarly, by conditions ( i ) , ( i i ) in Theorem 1 and (9), (11) and the properties of the function m 2 , we attain
lim n u n Q C ( I λ B ^ ) u n = 0 .
Thinking
v n u n v n Q C ( I λ B ^ ) u n + Q C ( I λ B ^ ) u n u n ,
and (13) and (14), we receive
lim n v n u n = 0 .
Adopting condition ( i ) in Theorem 1, we can get
u n L v n = β n δ g ( v n ) + ( I β n V ¯ ) L v n L v n = β n δ g ( v n ) V ¯ L v n 0 , a s n .
and also
v n L v n v n u n + u n L v n 0 , a s n .
Moreover, from (12), (14) and (15), we have
Q C ( I λ B ^ ) u n T n ( ξ n v n + ( 1 ξ n ) v n + 1 ) = Q C ( I λ B ^ ) u n u n + u n T n ( ξ n v n + ( 1 ξ n ) v n + 1 ) = Q C ( I λ B ^ ) u n u n + u n v n + v n T n ( ξ n v n + ( 1 ξ n ) v n + 1 ) 0 a s n .
Since
v n + 1 T n ( ξ n v n + ( 1 ξ n ) v n + 1 ) = μ n v n + ν n T n ( ξ n v n + ( 1 ξ n ) v n + 1 ) + ω n Q C ( I λ B ^ ) u n T n ( ξ n v n + ( 1 ξ n ) v n + 1 ) = μ n [ v n T n ( ξ n v n + ( 1 ξ n ) v n + 1 ) ] + ω n [ Q C ( I λ B ^ ) u n T n ( ξ n v n + ( 1 ξ n ) v n + 1 ) ] μ n v n T n ( ξ n v n + ( 1 ξ n ) v n + 1 ) + ω n Q C ( I λ B ^ ) u n T n ( ξ n v n + ( 1 ξ n ) v n + 1 ) .
By condition ( i i ) in Theorem 1 and (12), (17), we obtain
v n + 1 T n ( ξ n v n + ( 1 ξ n ) v n + 1 ) 0 a s n .
We know that
v n T n v n = v n v n + 1 + v n + 1 T n ( ξ n v n + ( 1 ξ n ) v n + 1 ) + T n ( ξ n v n + ( 1 ξ n ) v n + 1 ) T n v n v n v n + 1 + v n + 1 T n ( ξ n v n + ( 1 ξ n ) v n + 1 ) + T n ( ξ n v n + ( 1 ξ n ) v n + 1 ) T n v n v n v n + 1 + v n + 1 T n ( ξ n v n + ( 1 ξ n ) v n + 1 ) + k n ξ n v n + ( 1 ξ n ) v n + 1 v n v n v n + 1 + v n + 1 T n ( ξ n v n + ( 1 ξ n ) v n + 1 ) + k n ( 1 ξ n ) v n + 1 v n .
By (9) and (18), we acquire
v n T n v n 0 , a s n .
Because T is an asymptotically non-expansive mapping, we attain
v n T v n = v n v n + 1 + v n + 1 T n + 1 v n + 1 + T n + 1 v n + 1 T n + 1 v n + T n + 1 v n T v n v n v n + 1 + v n + 1 T n + 1 v n + 1 + T n + 1 v n + 1 T n + 1 v n + T n + 1 v n T v n v n v n + 1 + v n + 1 T n + 1 v n + 1 + k n + 1 v n + 1 v n + k 1 T n v n v n ( 1 + k n + 1 ) v n v n + 1 + v n + 1 T n + 1 v n + 1 + k 1 T n v n v n .
By (9) and (19), we acquire
v n T v n 0 , a s n .
From (15), (16) and (20), we have
u n T u n u n v n + v n T v n + T v n T u n u n v n + v n T v n + k 1 v n u n 0 , a s n ,
and
u n L u n u n v n + v n L v n + L v n L u n u n v n + v n L v n + v n u n 0 , a s n .
Step 5: We can take a subsequence u n i of { u n } and it is satisfied with
lim i δ g ( t ) V ¯ t , j ( u n i t ) = lim sup n δ g ( t ) V ¯ t , j ( u n t ) .
Since X is a uniformly smooth Banach space and { v n } is bounded, there exists a subsequence v n i v ¯ C as i . By (15) and (23), we know
u n i v ¯ , δ g ( t ) V ¯ t , j ( v ¯ t ) = lim sup n δ g ( t ) V ¯ t , j ( u n t ) .
From (21), (24) and Lemma 10, we can acquire v ¯ F i x ( T ) . It follows that (22), (24) and Lemma 10, we can attain v ¯ F i x ( L ) . By (14), (24), Lemma 10 and Lemma 8, we get v ¯ V I ( C , B ^ ) . So, we attain v ¯ Ψ . From (24) and property of Q C , we get
lim sup n δ g ( t ) V ¯ t , j ( u n t ) = δ g ( t ) V ¯ t , j ( v ¯ t ) 0 .
Step 6: Finally, from Lemma 4 and Lemma 6, we acquire
u n t 2 = β n δ g ( v n ) + ( I β n V ¯ ) L v n t 2 ( I β n V ¯ ) ( L v n t ) 2 + 2 β n δ g ( v n ) V ¯ t , j ( u n t ) ( 1 β n δ ¯ ) 2 v n t 2 + 2 β n δ g ( v n ) g ( t ) , j ( u n t ) + 2 β n δ g ( t ) V ¯ t , j ( u n t ) ( 1 β n δ ¯ ) 2 v n t 2 + 2 β n δ g ( v n ) g ( t ) u n t + 2 β n δ g ( t ) V ¯ t , j ( u n t ) ( 1 β n δ ¯ ) 2 v n t 2 + 2 β n δ η v n t u n t + 2 β n δ g ( t ) V ¯ t , j ( u n t ) ( 1 β n δ ¯ ) 2 v n t 2 + 2 β n δ η v n t ( β n δ g ( v n ) V ¯ t + ( 1 β n δ ¯ ) L v n t ) + 2 β n δ g ( t ) V ¯ t , j ( u n t ) ( 1 β n δ ¯ ) 2 v n t 2 + 2 β n δ η v n t ( β n δ η v n t + β n δ g ( t ) V ¯ t + ( 1 β n δ ¯ ) v n t ) + 2 β n δ g ( t ) V ¯ t , j ( u n t ) ( 1 β n δ ¯ ) 2 v n t 2 + 2 β n 2 δ 2 η 2 v n t 2 + 2 β n 2 δ η δ g ( t ) V ¯ t v n t + 2 β n δ η ( 1 β n δ ¯ ) v n t 2 + 2 β n δ g ( t ) V ¯ t , j ( u n t ) ( 1 β n δ ¯ ) v n t 2 + 2 β n 2 δ ¯ 2 v n t 2 + 2 β n 2 δ ¯ δ g ( t ) V ¯ t v n t + 2 β n δ η v n t 2 + 2 β n δ g ( t ) V ¯ t , j ( u n t ) ,
and
v n + 1 t 2 = μ n v n + ν n T n ( ξ n v n + ( 1 ξ n ) v n + 1 ) + ω n Q C ( I λ B ^ ) u n t 2 μ n v n t 2 + ν n k n 2 ( ξ n v n + ( 1 ξ n ) v n + 1 ) t 2 + ω n Q C ( I λ B ^ ) u n t 2 μ n v n t 2 + ν n k n 2 ξ n v n t 2 + ν n k n 2 ( 1 ξ n ) v n + 1 t 2 + ω n u n t 2 μ n v n t 2 + ν n k n 2 ξ n v n t 2 + ν n k n 2 ( 1 ξ n ) v n + 1 t 2 + ω n [ ( 1 β n δ ¯ ) v n t 2 + 2 β n 2 δ ¯ 2 v n t 2 + 2 β n 2 δ ¯ δ g ( t ) V ¯ t v n t + 2 β n δ η v n t 2 + 2 β n δ g ( t ) V ¯ t , j ( u n t ) ] ( μ n + ν n k n 2 ξ n + ω n ω n β n δ ¯ + 2 β n δ η ω n ) v n t 2 + 2 β n 2 δ ¯ 2 ω n v n t 2 + 2 β n 2 δ ¯ ω n δ g ( t ) V ¯ t v n t + 2 β n ω n δ g ( t ) V ¯ t , j ( u n t ) + ν n k n 2 ( 1 ξ n ) v n + 1 t 2 .
It follows that
( 1 ν n k n 2 ( 1 ξ n ) v n + 1 t 2 ( μ n + ν n k n 2 ξ n + ω n ω n β n ( δ ¯ 2 δ η ) ) v n t 2 + 2 β n 2 δ ¯ 2 ω n v n t 2 + 2 β n 2 δ ¯ ω n δ g ( t ) V ¯ t v n t + 2 β n ω n δ g ( t ) V ¯ t , j ( u n t ) .
That is
v n + 1 t 2 μ n + ν n k n 2 ξ n + ω n ω n β n ( δ ¯ 2 δ η ) 1 ν n k n 2 ( 1 ξ n ) v n t 2 + 2 β n 2 δ ¯ 2 ω n 1 ν n k n 2 ( 1 ξ n ) v n t 2 + 2 β n 2 δ ¯ ω n 1 ν n k n 2 ( 1 ξ n ) δ g ( t ) V ¯ t v n t + 2 β n ω n 1 ν n k n 2 ( 1 ξ n ) δ g ( t ) V ¯ t , j ( u n t ) ( 1 ω n β n ( δ ¯ 2 δ η ) ν n ( k n 2 1 ) 1 ν n k n 2 ( 1 ξ n ) ) v n t 2 + 2 β n 2 δ ¯ 2 ω n 1 ν n k n 2 ( 1 ξ n ) v n t 2 + 2 β n 2 δ ¯ ω n 1 ν n k n 2 ( 1 ξ n ) δ g ( t ) V ¯ t v n t + 2 β n ω n 1 ν n k n 2 ( 1 ξ n ) δ g ( t ) V ¯ t , j ( u n t ) ( 1 h 1 β n ( δ ¯ 2 δ η ) ε β n 1 ν n k n 2 ( 1 ξ n ) ) v n t 2 + 2 β n 2 δ ¯ 2 ω n 1 ν n k n 2 ( 1 ξ n ) v n t 2 + 2 β n 2 δ ¯ ω n 1 ν n k n 2 ( 1 ξ n ) δ g ( t ) V ¯ t v n t + 2 β n ω n 1 ν n k n 2 ( 1 ξ n ) δ g ( t ) V ¯ t , j ( u n t ) ( 1 β n ( h 1 δ ¯ 2 h 1 δ η ε ) 1 ν n k n 2 ( 1 ξ n ) ) v n t 2 + 2 β n 2 δ ¯ 2 1 ν n k n 2 ( 1 ξ n ) v n t 2 + 2 β n 2 δ ¯ 1 ν n k n 2 ( 1 ξ n ) δ g ( t ) V ¯ t v n t + 2 β n 1 ν n k n 2 ( 1 ξ n ) δ g ( t ) V ¯ t , j ( u n t ) ( 1 β n ( h 1 δ ¯ 2 h 1 δ η ε ) 1 ν n k n 2 ( 1 ξ n ) ) v n t 2 + β n ( h 1 δ ¯ 2 h 1 δ η ε ) 1 ν n k n 2 ( 1 ξ n ) [ 2 β n δ ¯ 2 v n t 2 h 1 δ ¯ 2 h 1 δ η ε + 2 β n δ ¯ δ g ( t ) V ¯ t v n t h 1 δ ¯ 2 h 1 δ η ε + 2 δ g ( t ) V ¯ t , j ( u n t ) h 1 δ ¯ 2 h 1 δ η ε ] .
Let
σ n = β n ( h 1 δ ¯ 2 h 1 δ η ε ) 1 ν n k n 2 ( 1 ξ n ) ,
and
θ n = 2 β n δ ¯ 2 v n t 2 h 1 δ ¯ 2 h 1 δ η ε + 2 β n δ ¯ δ g ( t ) V ¯ t v n t h 1 δ ¯ 2 h 1 δ η ε + 2 δ g ( t ) V ¯ t , j ( u n t ) h 1 δ ¯ 2 h 1 δ η ε ,
by conditions ( i ) , ( i i i ) , ( i v ) in Theorem 1 and (25), we can gain
n = 0 σ n = n = 0 β n ( h 1 δ ¯ 2 h 1 δ η ε ) 1 ν n k n 2 ( 1 ξ n ) n = 0 β n ( h 1 δ ¯ 2 h 1 δ η ε ) = + ,
lim sup n θ n = lim sup n [ 2 β n δ ¯ 2 v n t 2 h 1 δ ¯ 2 h 1 δ η ε + 2 β n δ ¯ δ g ( t ) V ¯ t v n t h 1 δ ¯ 2 h 1 δ η ε + 2 δ g ( t ) V ¯ t , j ( u n t ) h 1 δ ¯ 2 h 1 δ η ε ] 0 .
Thus, from Lemma 5, we receive that lim n v n t = 0 . So { v n } converges strongly to t = Q Ψ ( I V ¯ + δ g ) t Ψ , and from Lemma 11, we have ( t , s , w ) is a solution of the problem (4), where s = Q C ( I λ 2 B 2 ) ( b t + ( 1 b ) w ) and w = Q C ( I λ 3 B 3 ) t . The proof is completed.  □
As an application of our main result Theorem 1, we can prove strong convergence theorems for approximating the solution of the standard convex optimization problem.
Assume C is a convex and closed subset of X. The standard constrained convex optimization problem is to find v ˜ C such that
g ˜ ( v ˜ ) = min v C g ˜ ( v ) ,
where g ˜ : C R is a convex, F r ´ echet differentiable function. Φ g ˜ is used to indicate the solution set of (26).
Lemma 12.
([21]) An essential condition of optimality for a point v ˜ C to be a solution of (26) is that v ˜ is a solution of the variational inequality
g ˜ ( v ˜ ) , v v ˜ 0 , v C .
Equivalently, v C is a fixed point of the mapping Q C ( I λ g ˜ ) , λ > 0 . In addition, if g ˜ is convex, then the optimality condition (27) is also sufficient.
Theorem 2.
Assume that space X, mappings Q C , B 1 , B 2 , B 3 , L , V ¯ , g and T are the same as in Theorem 1. Suppose g ˜ : C R is a convex real-valued function with the gradient g ˜ = B ^ is 1 / L g ˜ -inverse strongly accretive. Assume that Ω = F i x ( T ) F i x ( L ) Φ g ˜ . Define the sequence { v n } in X as follows:
v 1 C , u n = β n δ g ( v n ) + ( I β n V ¯ ) L v n , v n + 1 = μ n v n + ν n T n ( ξ n v n + ( 1 ξ n ) v n + 1 ) + ω n Q C ( I λ g ˜ ) u n , n 1 ,
where λ ( 0 , 2 / L g ˜ ) , β n , μ n , ν n , ω n , ξ n and δ satisfy the same coefficient conditions as in Theorem 1. Then { v n } converges strongly to t = Q Ω ( I V ¯ + δ g ) t Ω and ( t , s , w ) is a solution of (4), where s = Q C ( I λ 2 B 2 ) ( b t + ( 1 b ) w ) and w = Q C ( I λ 3 B 3 ) t , λ 1 , λ 2 , λ 3 ( 0 , 2 b ¯ ) with b ¯ = m i n { b 1 , b 2 , b 3 } .
Proof. 
From Lemma 12 and Theorem 1, we can gain Theorem 2, where s = Q C ( I λ 2 B 2 ) ( b t + ( 1 b ) w ) and w = Q C ( I λ 3 B 3 ) t . Then, the proof is completed.  □
Remark 1.
( 1 ) In Theorem 2, we give the iterative approximation method and strong convergence results for the common elements of the solutions Φ g ˜ of the standard constrained convex optimization problem (26) and the fixed points F i x ( T ) of an asymptotically non-expansive mapping T.
( 2 ) As we all know, a Hilbert space H is a uniformly smooth and uniformly convex Banach space and the metric projection P C : H C is sunny non-expansive retractive. So, when Hilbert space H takes the place of Banach space X and the sunny non-expansive retraction Q C becomes to the metric projection P C , the results of Theorem 1 and Theorem 2 still hold. More specifically, if k n 1 and ξ n 1 in Theorem 2, we can attain the major results of Keerti et al. [19].

4. Numerical Examples

Someone may question whether the coefficients in Theorem 1 are complex enough to be not obtained. Now we give a concrete numerical example to show that the coefficients in Theorem 1 can be obtained.
Let R be the real number set and B ^ , B 1 , B 2 , B 3 be a mapping from [ 0 , 20 ] to R defined by B ^ v = v 4 , B 1 v = v 2 , B 2 v = v 4 , B 3 v = v 6 , respectively. Put b = 1 3 , b ^ = 4 , b 1 = 2 , b 2 = 4 , b 3 = 6 , λ 1 = 1 , λ 2 = 2 , λ 3 = 3 , then b ¯ = m i n { b 1 , b 2 , b 3 } = 2 , λ 1 , λ 2 , λ 3 ( 0 , 2 b ¯ ) = ( 0 , 4 ) , the mapping L v = 5 18 v defined by (5) in Lemma 11. We take η = 1 3 , δ = 1 4 , β n = 1 5 n , and let g , V ¯ : R R be defined by g ( v ) = v 3 , V ¯ v = v 4 , respectively. So, { u n } : u n = 100 n + 1 360 n v n is generated by (6). Assume that T is an asymptotically non-expansive mapping defined by T n v = 1 + 1 12 n v . Let v 1 [ 0 , 20 ] , and { v n } is generated by (6) where h 1 = 1 6 , h 2 = 1 2 , λ = 1 ( 0 , 2 b ^ ) = ( 0 , 8 ) , μ n = 3 n 1 12 n , ν n = 1 2 and ω n = 3 n + 1 12 n , ξ n = 1 1 3 n , ε = 5 12 , τ = 3 4 . From the propose definition, the all conditions of Theorem 1 are satisfied. We know 0 F i x ( T ) F i x ( L ) V I ( C , B ^ ) . Then v n is generated by (6) and we simplify the form of (6) to get
v n + 1 = 1440 n 2 480 n + 480 n 3 n ( 12 n + 1 ) 160 3 n ( 12 n + 1 ) + 1 5760 n 2 160 3 n ( 12 n + 1 ) v n 4320 5760 v n .
So, clearly, v n converges strongly to 0 F i x ( T ) F i x ( L ) V I ( C , B ^ ) .

5. Conclusions

In this paper, we present a new generalized variational inequality system problem (4) which contains many special cases. In the case when we put B 2 0 , then the problem (4) reduces to problem (3); If putting b = 0 in (4), we get
t ( I λ 1 B 1 ) s , j ( v t ) 0 , v C , s ( I λ 2 B 2 ) w , j ( v s ) 0 , v C , w ( I λ 3 B 3 ) t , j ( v w ) 0 , v C ,
which is a variational inequality modified system by Ceng et al. [2]. In the sense that if we take B 3 0 in (29), then the problem (29) reduces to problem (2). We study the common elements of the set of solutions of an asymptotically non-expansive operation equation with the L mapping defined by (5) and the solution set of the generalized proposed system problem (4). The convergence analysis of a new way by using the generalized semi-closure principle supplied by us in Wang et al. [9] for finding the propose common elements in Banach spaces are investigated. Under the suitable conditions imposed on parameters, some strong convergence theorems are attained. We locally generalize some corresponding recent results of Keerti et al. [19] from Hilbert spaces to Banach spaces and from non-expansive mapping to asymptotically non-expansive mapping. As an application, we prove the strong convergence theorem of the standard constrained convex optimization problem by our main result. Eventually, we also give a real numerical example to show that the coefficients in Theorem 1 can be obtained and the theorems are reasonable and valid.

Author Contributions

Conceptualization, C.L.; data curation, C.L. and L.L.; formal analysis, Y.W. and C.L.; funding acquisition, Y.W. and C.L.; investigation, Y.W. and L.L.; methodology, Y.W., C.L. and L.L.; project administration, Y.W.; resources, C.L.; Software, L.L.; supervision, Y.W.; validation, L.L.; writing—original draft, C.L. and L.L. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Acknowledgments

This work was supported by the National Natural Science Foundation of China (Grant no. 11671365) and the Natural Science Foundation of Zhejiang Province (Grant no. LY14A010011).

Conflicts of Interest

The authors declare that they have no competing interests.

References

  1. Blum, E.; Oettli, W. From optimization and variational inequalities to equilibrium problems. Math. Stud. 1994, 63, 123–145. [Google Scholar]
  2. Ceng, L.C.; Wang, C.Y.; Yao, J.C. Strong convergence theorems by a relaxed extragradient method for a general system of variational inequalities. Math. Methods Oper. Res. 2008, 67, 375–390. [Google Scholar] [CrossRef]
  3. Imnang, S. Viscosity iterative method for a new general system of variational inequalities in Banach Spaces. J. Inequal. Appl. 2013, 2013, 249. [Google Scholar] [CrossRef] [Green Version]
  4. Zhang, H.C.; Qu, Y.H.; Su, Y.F. Strong convergence theorems for fixed point problems for nonexpansive mappings and zero point problems for accretive operators using viscosity implicit midpoint rules in Banach Spaces. Mathematics 2018, 6, 257. [Google Scholar] [CrossRef] [Green Version]
  5. Noor, M.A. On iterative methods for solving a system of mixed variational inequalities. Appl. Anal. 2008, 87, 99–108. [Google Scholar] [CrossRef]
  6. Qin, X.; Cho, S.Y.; Kang, S.M. Convergence of an iterative algorithm for systems of variational inequalities and nonexpansive mappings with applications. J. Comput. Appl. Math. 2009, 233, 231–240. [Google Scholar] [CrossRef] [Green Version]
  7. 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]
  8. Yao, Y.; Maruster, S. Strong convergence of an iterative algorithm for variational inequalities in Banach spaces. Math. Comput. Model. 2011, 54, 325–329. [Google Scholar] [CrossRef]
  9. Pan, C.J.; Wang, Y.H. Generalized viscosity implicit iterative process for asymptotically non-expansive mappings in Banach spaces. Mathematics 2019, 7, 379. [Google Scholar] [CrossRef] [Green Version]
  10. Xu, H.K. Viscosity approximation methods for nonexpansive mappings. J. Math. Anal. Appl. 2004, 298, 279–291. [Google Scholar] [CrossRef] [Green Version]
  11. Kim, K.S. Convergence to common solutions of various problems for nonexpansive mappings in Hilbert spaces. Fixed Point Theory Appl. 2012, 2012, 185. [Google Scholar] [CrossRef] [Green Version]
  12. Liu, Y. Weak convergence of a new projection algorithm for variational inequalities in Banach spaces. Nonlinear Funct. Anal. Appl. 2016, 21, 121–129. [Google Scholar]
  13. Matveev, S.A.; Stadnichuk, V.I.; Tyrtyshnikov, E.E.; Smirnov, A.P.; Ampilogova, N.V.; Brilliantov, N.V. Anderson acceleration method of finding steady-state particle size distribution for a wide class of aggregation-fragmentation models. Comput. Phys. Commun. 2018, 224, 154–163. [Google Scholar] [CrossRef]
  14. Timokhin, I.V.; Matveev, S.A.; Siddharth, N.; Tyrtyshnikov, E.E.; Smirnov, A.P.; Brilliantov, N.V. Newton method for stationary and quasi-stationary problems for Smoluchowski-type equations. J. Comput. Phys. 2019, 382, 124–137. [Google Scholar] [CrossRef]
  15. Brezinski, C.; Redivo-Zaglia, M. The Simplified Topological epsion-Algorithms for Accelerating Sequences in a Vector Space. SIAM J. Sci. Comput. 2014, 36, A2227–A2247. [Google Scholar] [CrossRef] [Green Version]
  16. Walker, H.F.; Ni, P. Anderson acceleration for fixed point iterations. SIAM J. Numer. Anal. 2011, 49, 1715–1735. [Google Scholar] [CrossRef] [Green Version]
  17. Katchang, P.; Kumam, P. Convergence of iterative algorithm for finding common solution of fixed points and general system of variational inequalities for two accretive operators. Thai J. Math. 2011, 9, 343–360. [Google Scholar]
  18. Wang, Y.H.; Pan, C.J. Viscosity approximation methods for a general variational inequality system and fixed point problems in Banach spaces. Symmetry 2020, 12, 36. [Google Scholar] [CrossRef] [Green Version]
  19. Keerati, S.; Atid, K. A new general system of variational inequalities for convergence theorem and application. J. Appl. Math. 2019, 81, 99–123. [Google Scholar]
  20. Noor, M.A. Some algorithms for general monotone mixed variational inequalities. Math. Comput. Model. 1999, 29, 1–9. [Google Scholar] [CrossRef]
  21. Su, M.; Xu, H.K. Remarks on the Gradient-Projection algorithm. J. Nonlinear Anal. Optim 2010, 1, 35–43. [Google Scholar]
  22. Yao, Y.; Postolache, M.; Yao, J.C. An iterative algorithm for solving the generalized variational inequalities and fixed points problems. Mathematics 2019, 7, 61. [Google Scholar] [CrossRef] [Green Version]
  23. Zegeye, H.; Ofoedu, E.; Shahzad, N. Convergence theorems for equilibrium problem, variational inequality problem and countably infinite relatively quasi-nonexpansive mappings. Appl. Math. Comput. 2010, 216, 3439–3449. [Google Scholar] [CrossRef]
  24. He, Z.; Du, W.-S. Strong convergence theorems for equilibrium problems and fixed point problems: A new iterative method, some comments and applications. Fixed Point Theory Appl. 2011, 2011, 15. [Google Scholar] [CrossRef]
  25. He, Z.; Du, W.-S. Viscosity Iterative Schemes for Finding Split Common Solutions of Variational Inequalities and Fixed Point Problems. Abstr. Appl. Anal. 2012, 2012, 25. [Google Scholar] [CrossRef]
  26. He, Z.; Du, W.-S. On hybrid split problem and its nonlinear algorithms. Fixed Point Theory Appl. 2013, 2013, 47. [Google Scholar] [CrossRef] [Green Version]
  27. Cai, G.; Hu, C.S. Strong convergence theorems of a general iterative process for a finite family of λi-strict pseudo-contractions in q-uniformly smooth Banach spaces. Comput. Math. Appl. 2010, 59, 149–160. [Google Scholar] [CrossRef] [Green Version]
  28. Aoyama, K.; Iiduka, H.; Takahashi, W. Weak convergence of an iterative sequence for accretive operators in Banach spaces. Fixed Point Theory Appl. 2006, 2006, 35390. [Google Scholar] [CrossRef] [Green Version]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Wang, Y.; Li, C.; Lu, L. A New Algorithm for the Common Solutions of a Generalized Variational Inequality System and a Nonlinear Operator Equation in Banach Spaces. Mathematics 2020, 8, 1944. https://doi.org/10.3390/math8111944

AMA Style

Wang Y, Li C, Lu L. A New Algorithm for the Common Solutions of a Generalized Variational Inequality System and a Nonlinear Operator Equation in Banach Spaces. Mathematics. 2020; 8(11):1944. https://doi.org/10.3390/math8111944

Chicago/Turabian Style

Wang, Yuanheng, Cancan Li, and Lirong Lu. 2020. "A New Algorithm for the Common Solutions of a Generalized Variational Inequality System and a Nonlinear Operator Equation in Banach Spaces" Mathematics 8, no. 11: 1944. https://doi.org/10.3390/math8111944

APA Style

Wang, Y., Li, C., & Lu, L. (2020). A New Algorithm for the Common Solutions of a Generalized Variational Inequality System and a Nonlinear Operator Equation in Banach Spaces. Mathematics, 8(11), 1944. https://doi.org/10.3390/math8111944

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