mathematics

Article
Variational Inequalities Approaches to Minimization
Problems with Constraints of Generalized Mixed
Equilibria and Variational Inclusions
Lu-Chuan Ceng 1 and Mihai Postolache 2,3,4, * , Ching-Feng Wen 5 and Yonghong Yao 6,7
1 Department of Mathematics, Shanghai Normal University, Shanghai 200234, China; zenglc@hotmail.com
2 Center for General Education, China Medical University, Taichung 40402, Taiwan
3 Romanian Academy, Gh. Mihoc-C. Iacob Institute of Mathematical Statistics and Applied Mathematics,
050711 Bucharest, Romania
4 Department of Mathematics and Informatics, University “Politehnica” of Bucharest,
060042 Bucharest, Romania
5 Center for Fundamental Science, Kaohsiung Medical University, Kaohsiung 807, Taiwan;
cfwen@kmu.edu.tw
6 School of Mathematical Sciences, Tianjin Polytechnic University, Tianjin 300387, China;
yaoyonghong@aliyun.com
7 The Key Laboratory of Intelligent Information and Data Processing of NingXia Province,
North Minzu University, Yinchuan 750021, China
* Correspondence: mihai@mathem.pub.ro




Received: 18 February 2019; Accepted: 13 March 2019; Published: 16 March 2019


Abstract: Multistep composite implicit and explicit extragradient-like schemes are presented for
solving the minimization problem with the constraints of variational inclusions and generalized
mixed equilibrium problems. Strong convergence results of introduced schemes are given under
suitable control conditions.

Keywords: extragradient-like method; minimization problem; variational inclusion; generalized

mixed equilibrium problem

MSC: 49J30; 47H09; 47J20; 49M05

1. Introduction
Let H be a real Hilbert space and ∅ 6= C ⊂ H be a closed convex set. Let A : C → H be a nonlinear
operator. Let us consider the variational inequality problem (VIP) which aims to find x ∗ ∈ C verifying

hA x ∗ , x − x ∗ i ≥ 0, ∀ x ∈ C. (1)

We denote the solution set of VIP (1) by VI(C, A).

In [1], Korpelevich suggested an extragradient method for solving VIP (1). Korpelevich’s method
has been studied by many authors, see e.g., references [2–13] and references therein. In 2011, Ceng,
Ansari and Yao [14] considered the following algorithm

uk+1 = PC [αk γVuk + ( I − αk µF ) Tuk ], ∀k ≥ 0. (2)

They showed that {uk } strongly converges to x † ∈ Fix( T ) which solves the following VIP

h(µF − γV ) x † , x † − x̃ i ≤ 0, ∀ x̃ ∈ Fix( T ). (3)

Mathematics 2019, 7, 270; doi:10.3390/math7030270 www.mdpi.com/journal/mathematics

Mathematics 2019, 7, 270 2 of 20

Ceng, Guu and Yao [15] presented a composite implicit scheme

xt = ( I − θt B) Txt + θt [ Txt − t(µFTxt − γVxt )], (4)

and another composite explicit scheme

(
yn = ( I − αn µF ) Txn + αn γVxn ,
(5)
xn+1 = ( I − β n B) Txn + β n yn , ∀n ≥ 0.

Ceng, Guu and Yao proved that { xt } and { xn } converge strongly to the same point x † ∈ Fix( T ),
which solves the following VIP

h(B − I ) x † , x † − x̃ i ≤ 0, ∀ x̃ ∈ Fix( T ). (6)

In [2], Peng and Yao considered the generalized mixed equilibrium problem (GMEP) which aims
to find x † ∈ C verifying

ϕ(y) − ϕ( x † ) + Θ( x † , y) + hA x † , y − x † i ≥ 0, ∀y ∈ C, (7)

where ϕ : C → R is a real-valued function and Θ : C × C → R is a bifunction. The set of solutions of

GMEP (7) is denoted by GMEP(Θ, ϕ, A).
It is clear that GMEP (7) includes optimization problems, VIP and Nash equilibrium problems as
special cases.
Special cases:
(i) Letting ϕ = 0, GMEP (7) reduces to find x † ∈ C verifying

( GEP) : Θ( x † , y) + hA x † , y − x † i ≥ 0, ∀y ∈ C,

which was studied in [13,16].

(ii) Letting A = 0, GMEP (7) reduces to find x † ∈ C verifying

( MEP) : Θ( x † , y) + ϕ(y) − ϕ( x † ) ≥ 0, ∀y ∈ C,

which was considered in [17].

(iii) Letting ϕ = 0 and A = 0, GMEP (7) reduces to find x † ∈ C verifying

( EP) : Θ( x † , y) ≥ 0, ∀y ∈ C,

which was discussed in [18,19].

GMEP (7) has been discussed extensively in the literature; see e.g., [6,7,20–32].
Now, we consider the minimization problem (CMP):

min f ( x ), (8)
x ∈C

where f : C → R is a convex and continuously Fréchet differentiable functional. Use Ξ to denote the
set of minimizers of CMP (8).
For solving (8), an efficient algorithm is the gradient-projection algorithm (GPA) which is defined
by: for given the initial guess x0 ,

zk+1 := PC (zk − µ∇ f (zk )), ∀k ≥ 0, (9)

or a general form,
zn+1 := PC (zk − µk ∇ f (zk )), ∀k ≥ 0. (10)
Mathematics 2019, 7, 270 3 of 20

It is known that S := PC ( I − λ∇ f ) is a contractive operator if ∇ f is α-strongly monotone and

L-Lipschitz and 0 < λ < 2αL2
. In this case, GPA (9) has strong convergence.
Recall that the variational inclusion problem is to find a point x ∈ C verifying

0 ∈ Bx + Rx. (11)

where B : C → H is a single-valued mapping and R is a multivalued mapping with D ( R) = C.

Use I( B, R) to denote the solution set of (11).
Taking B = 0 in (11), it reduces to the problem introduced by Rockafellar [33]. Let R : D ( R) ⊂
H → 2 H be a maximal monotone operator. The resolvent operator JR,λ : H → D ( R) is defined by
JR,λ = ( I + λR)−1 , ∀ x ∈ H. In [34], Huang considered problem (11) under the assumptions that B is
strongly monotone Lipschitz operator and R is maximal monotone. Zeng, Guu and Yao [35] discussed
problem (11) under more general cases. Related work, please refer to [36,37] and the references therein.
In the present paper, we introduce two composite schemes for finding a solution of the CMP (8)
with the constraints of finitely many GMEPs and finitely many variational inclusions for maximal
monotone and inverse strongly monotone mappings in a real Hilbert space H. Strong convergence
of the suggested algorithms are given. Our theorems complement, develop and extend the results
obtained in [6,15,38], having as background [39–46].

2. Preliminaries
Let C be a nonempty closed convex subset of a real Hilbert space H. Recall that the metric
projection PC : H → C is defined by k x − PC x k = infy∈C k x − yk =: d( x, C ). A mapping A : H → H
is called strongly positive if h Ax, x i ≥ γ̄k x k2 , ∀ x ∈ H for γ̄ > 0. A mapping F : C → H is called
Lipschitz if k Fx − Fyk ≤ Lk x − yk, ∀ x, y ∈ C for some L ≥ 0. F is called nonexpansive if L = 1 and it
is called contractive provided L ∈ [0, 1).

Proposition 1. Let x ∈ H and z ∈ C. Then, the following hold

• z = PC x ⇔ h x − z, z − x † i ≥ 0, ∀ x † ∈ C;
• z = PC x ⇔ k x − zk2 + k x † − zk2 ≤ k x − x † k2 , ∀ x † ∈ C;
• h PC x − PC x † , x − x † i ≥ k PC x − PC x † k2 , ∀ x † ∈ H.

Definition 1. A mapping F : C → H is called

• monotone if h Fx − Fx † , x − x † i ≥ 0, ∀ x, x † ∈ C;
• η-strongly monotone if h Fx − Fx † , x − x † i ≥ η k x − x † k2 , ∀ x, y ∈ C for some η > 0;
• α-inverse-strongly monotone (ism) if h Fx − Fx † , x − x † i ≥ αk Fx − Fx † k2 , ∀ x, x † ∈ C for some α > 0.
In this case, we have for all u, u† ∈ C,

k( I − µF )u − ( I − µF )u† k2 ≤ ku − u† k2 + µ(µ − 2α)k Fu − Fu† k2 , (12)

where µ > 0 is a constant.

Definition 2. A mapping T : H → H is called firmly nonexpansive if 2T − I is nonexpansive. Thus, T is

firmly nonexpansive iff T = 12 ( I + S), where S : H → H is nonexpansive.

Let Θ : C × C → R be a bifunction satisfying the following assumptions:

(A1) Θ( x, x ) = 0 for all x ∈ C;

(A2) Θ( x, x † ) + Θ( x † , x ) ≤ 0 for all x, x † ∈ C;
(A3) for x, x † , y ∈ C, lim supt→0+ Θ(ty + (1 − t) x, x † ) ≤ Θ( x, x † );
(A4) Θ( x, ·) is convex and lower semicontinuous for each x ∈ C.
Mathematics 2019, 7, 270 4 of 20

Let ϕ : C → R be a lower semicontinuous and convex function satisfying the following conditions:

(B1) for each x ∈ H and r > 0, there exists a bounded subset Dx ⊂ C and y x ∈ C such that for any
z ∈ C \ Dx ,
1
Θ(z, y x ) + ϕ(y x ) − ϕ(z) + hy x − z, z − x i < 0;
r
(B2) C is a bounded set.
(Θ,ϕ)
Let r > 0. Define a mapping Tr : H → C by the following form: for any x ∈ H,

(Θ,ϕ) 1
Tr ( x ) := { x † ∈ C : Θ( x † , y) + ϕ(y) − ϕ( x † ) + h x † − x, y − x † i ≥ 0, ∀y ∈ C }.
r

If ϕ ≡ 0, then TrΘ ( x ) := { x † ∈ C : Θ( x † , y) + 1r h x † − x, y − x † i ≥ 0, ∀y ∈ C }.

Proposition 2 ([17]). Let a bifunction Θ : C × C → R satisfying assumptions (A1)–(A4). Let a convex

function ϕ : C → R be a proper lower semi-continuous. Assume conditions (B1) or (B2) holds. Then, we have
(Θ,ϕ)
• ∀ x ∈ H, Tr ( x ) 6= ∅ is single-valued;
(Θ,ϕ)
• Tr is firmly nonexpansive;
(Θ,ϕ)
• Fix( Tr ) = MEP(Θ, ϕ);
• MEP(Θ, ϕ) is convex and closed;
(Θ,ϕ) † (Θ,ϕ) † 2 s−t (Θ,ϕ) † (Θ,ϕ) † (Θ,ϕ) †
• ∀s, t > 0, k Ts z − Tt z k ≤ s h Ts z − Tt z , Ts z − z† i for z† ∈ H.

Proposition 3 ([41]). We have the following conclusions:

• A mapping T is nonexpansive iff the complement I − T is 12 -ism.

• If a mapping T is α-ism, then γT is γα -ism where γ > 0.
• A mapping T is averaged iff the complement I − T is α-ism for some α > 1/2.

Lemma 1. Let E be a real inner product space. Then,

k x + x † k2 ≤ k x k2 + 2h x † , x + x † i, ∀ x, x † ∈ E.

Lemma 2. In a real Hilbert space H, we have the following results

• k x − x † k2 = k x k2 − 2h x − x † , x † i − k x † k2 , ∀ x, x † ∈ H;
• kλx + γx † k2 = λk x k2 + γk x † k2 − λγk x − x † k2 , ∀ x, x † ∈ H and λ, γ ∈ [0, 1] with λ + γ = 1;
• {un } ⊂ H is a sequence satisfying un * x. Then,

lim sup kun − x † k2 = lim sup kun − x k2 + k x − x † k2 , ∀ x † ∈ H.

n→∞ n→∞

Lemma 3 ([45]). Let H be a real Hilbert space and ∅ 6= C ⊂ H be a closed convex set. Let T : C → C be a
k-strictly pseudocontractive mapping. Then,

• k Tx − Tyk ≤ 11+ k
−k k x − y k,∀ x, y ∈ C.
• I − T is demiclosed at 0.
• Fix( T ) of T is closed and convex.

Lemma 4 ([39]). Let H be a real Hilbert space and ∅ 6= C ⊂ H be a closed convex set. Let T : C → C be a
k-strictly pseudocontractive mapping. Then,

kγ( x − x † ) + µ( Tx − Tx † )k ≤ (γ + µ)k x − x † k, ∀ x, x † ∈ C,
Mathematics 2019, 7, 270 5 of 20

where γ ≥ 0 and µ ≥ 0 with (γ + µ)k ≤ γ.

Let T : C → C be a nonexpansive operator and the operator F : C → H be κ-Lipschitzian

and η-strongly monotone. Define an operator T λ : C → H by T λ x := Tx − λµF ( Tx ), ∀ x ∈ C,
where λ ∈ (0, 1] and µ > 0 are two constants.

2η
Lemma 5 ([42]). Let 0 < µ < κ2 . Then, for ∀ x, y ∈ C, we have k T λ x − T λ yk ≤ (1 − λτ )k x − yk,
p
where τ = 1 − 1 − µ(2η − µκ 2 ).

Lemma 6 ([46]). Let { an } ⊂ [0, +∞), {ωn } ⊂ [0, 1], {δn } and {rn } ⊂ [0, +∞) be four sequences. If

(i) ∑∞ ∞
n=0 ωn = ∞ and ∑n=1 rn < ∞;
(ii) either lim supn→∞ δn ≤ 0 or ∑∞ n=0 ωn | δn | < ∞;
(iii) an+1 ≤ (1 − ωn ) an + ωn δn + rn , ∀n ≥ 0.

Then, limn→∞ an = 0.

Lemma 7 ([44]). Let bounded linear operator A : H → H be γ̄-strongly positive. Then, k I − ρAk ≤ 1 − ργ̄
provided 0 < ρ ≤ k Ak−1 .

Let LIM be a Banach limit. Then, we have following properties:

• an ≤ cn , n ≥ 1⇒LIMn an ≤ LIMn cn ;
• LIMn an+ N = LIMn an , where N is a fixed positive integer;
• lim infn→∞ an ≤ LIMn an ≤ lim supn→∞ an , ∀{ an } ∈ l ∞ .

Lemma 8 ([40]). Assume that the sequence {sn } ∈ l ∞ satisfy LIMn sn ≤ M, where M is a constant.
If lim supn→∞ (sn+1 − sn ) ≤ 0, then lim supn→∞ sn ≤ M.

Let the operator R : D ( R) ⊂ H → 2 H be maximal monotone. Let λ, µ > 0 be two constants.

Lemma 9 ([43]). There holds the resolvent identity

µ µ
JR,λ x = JR,µ ( x + (1 − ) JR,λ x ), ∀ x ∈ H.
λ λ

Remark 1. The resolvent has the following property

1 1
k JR,λ x − JR,µ x † k ≤ k x − x † k + |λ − µ|( k JR,λ x − x † k + k x − JR,µ x † k), ∀ x, x † ∈ H. (13)
λ µ

Lemma 10 ([34,35]). JR,λ satisfies

h JR,λ x − JR,λ y, x − yi ≥ k JR,λ x − JR,λ yk2 , ∀ x, y ∈ H.

3. Main Results
Let H be a real Hilbert space and ∅ 6= C ⊂ H be a closed convex set. In what follows, we assume:
f : C → R is a convex functional with gradient ∇ f being L-Lipschitz, the operator F : C → H
is η-strongly monotone and κ-Lipschitzian, Ri : C → 2 H is a maximal monotone mapping and
Bi : C → H (i = 1, ..., N ) is ηi -ism, Θ j : C × C → R satisfies (A1)–(A4), ϕ j : C → R ∪ {+∞} is a
proper convex and lower semicontinuous satisfying (B1) or (B2), and A j : C → H is µ j -ism for each
j = 1, ..., M;
V : C → H is a nonexpansive mapping and A : H → H is a γ̄-strongly positive bounded linear
2η p
operator such 1 < γ̄ < 2, 0 < µ < κ2 and 0 ≤ γ < τ with τ = 1 − 1 − µ(2η − µκ 2 );
Mathematics 2019, 7, 270 6 of 20

PC ( I − λt ∇ f ) = st I + (1 − st ) Tt where Tt is nonexpansive, st = 2−4λt L ∈ (0, 12 ) and λt : (0, 1) →

2
(0, with limt→0 λt = L2 ;
L)
The operator ΛtN : C → C is defined by ΛtN x = JR N ,λ N,t ( I − λ N,t BN ) · · · JR1 ,λ1,t ( I − λ1,t B1 ) x, t ∈
(0, 1), for {λi,t } ⊂ [ ai , bi ] ⊂ (0, 2ηi ), i = 1, ..., N;
The operator ΛnN : C → C is defined by ΛnN x = JR N ,λ N,n ( I − λ N,n BN ) · · · JR1 ,λ1,n ( I − λ1,n B1 ) x with
{λi,n } ⊂ [ ai , bi ] ⊂ (0, 2ηi ) and limn→∞ λi,n = λi , for each i = 1, ..., N;
(Θ ,ϕ M ) (Θ ,ϕ1 )
The operator ∆tM : C → C is defined by ∆tM x = Tr M,tM ( I − r M,t A M ) · · · Tr1,t 1 (I −
r1,t A1 ) x, t ∈ (0, 1), for {r j,t } ⊂ [c j , d j ] ⊂ (0, 2µ j ), j = 1, ..., M;
(Θ ,ϕ ) (Θ ,ϕ1 )
The operator ∆nM : C → C is defined by ∆nM x = Tr M,nM M ( I − r M,n A M ) · · · Tr1,n1 ( I − r1,n A1 ) x
with {r j,n } ⊂ [c j , d j ] ⊂ (0, 2µ j ) and limn→∞ r j,n = r j , for each j = 1, ..., M;
Ω := ∩ jM=1 GMEP(Θ j , ϕ j , A j ) ∩ ∩iN=1 I( Bi , Ri ) ∩ Ξ 6= ∅;
{αn } ⊂ [0, 1], {sn } ⊂ (0, min{ 21 , k Ak−1 }) and {st }t∈(0,min{1, 2−γ̄ }) ⊂ (0, min{ 21 , k Ak−1 }).
τ −γ
Next, set

Λit = JRi ,λi,t ( I − λi,t Bi ) JRi−1 ,λi−1,t ( I − λi−1,t Bi−1 ) · · · JR1 ,λ1,t ( I − λ1,t B1 ), ∀t ∈ (0, 1),

Λin = JRi ,λi,n ( I − λi,n Bi ) JRi−1 ,λi−1,n ( I − λi−1,n Bi−1 ) · · · JR1 ,λ1,n ( I − λ1,n B1 ), ∀n ≥ 0,
j (Θ j ,ϕ j ) (Θ j −1 ,ϕ j−1 ) (Θ ,ϕ1 )
∆t = Tr j,t ( I − r j,t A j ) Tr j−1,t ( I − r j−1,t A j−1 ) · · · Tr1,t 1 ( I − r1,t A1 ), ∀t ∈ (0, 1),
and
j (Θ j ,ϕ j ) (Θ j −1 ,ϕ j−1 ) (Θ ,ϕ1 )
∆n = Tr j,n ( I − r j,n A j ) Tr j−1,n ( I − r j−1,n A j−1 ) · · · Tr1,n1 ( I − r1,n A1 ), ∀n ≥ 0,

for j = 1, ..., M and i = 1, ..., N, Λ0t = Λ0n = I and ∆0t = ∆0n = I.

1
By Proposition 3, λ∇ f is λL -ism for λ > 0. In addition, hence, I − λ∇ f is λL2 -averaged. It is
2+ λ t L 2
clear that PC ( I − λt ∇ f ) is 4 -averaged for each λt ∈ (0, L ). Thus, PC ( I − λt ∇ f ) = st I + (1 − st ) Tt ,
where Tt is nonexpansive and st := st (λt ) = 2−4λt L ∈ (0, 12 ) for each λt ∈ (0, L2 ). Similarly, for each
n ≥ 0, PC ( I − λn ∇ f ) is 2+4λn L -averaged for each λn ∈ (0, L2 ) and PC ( I − λn ∇ f ) = sn I + (1 − sn ) Tn .
Please note that Fix( Tt ) = Fix( Tn ) = Ξ. Since {λi,t } ⊂ [ ai , bi ] ⊂ (0, 2ηi ), by (12) and Lemma 10,
we deduce

kΛtN x − ΛtN yk = k JR N ,λ N,t ( I − λ N,t BN )ΛtN −1 x − JR N ,λ N,t ( I − λ N,t BN )ΛtN −1 yk ≤ k x − yk.

On the other hand, since {ri,t } ⊂ [ci , di ] ⊂ (0, 2µi ), according to (12) and Proposition 2, we get

(Θ ,ϕ M ) (Θ ,ϕ M )
k∆tM x − ∆tM yk = k Tr M,tM ( I − r M,t A M )∆tM−1 x − Tr M,tM ( I − r M,t A M )∆tM−1 yk
≤ k( I − r M,t A M )∆tM−1 x − ( I − r M,t A M )∆tM−1 yk
≤ k x − y k.

Next, we present the following net { xt }t∈(0,min{1, 2−γ̄ }) :

τ −γ

(Θ M ,ϕ M ) (Θ (Θ ,ϕ )

,ϕ )
ut = Tr M,t

 ( I − r M,t A M ) Tr M−M1,t−1 M−1 ( I − r M−1,t A M−1 ) · · · Tr1,t 1 1 ( I − r1,t A1 ) xt ,
vt = JR N ,λ N,t ( I − λ N,t BN ) JR N −1 ,λ N −1,t ( I − λ N −1,t BN −1 ) · · · JR1 ,λ1,t ( I − λ1,t B1 )ut , (14)


 x = P [( I − s A) T v + s [Vx − t(µFVx − γT v )].
t C t t t t t t t t

We prove the strong convergence of { xt } as t → 0 to a point x̃ ∈ Ω which solves

h( A − V ) x̃, p − x̃ i ≥ 0, ∀ p ∈ Ω. (15)
Mathematics 2019, 7, 270 7 of 20

Let x0 ∈ C, define a sequence { xn } as follows

(Θ ,ϕ ) (Θ −1 ,ϕ M−1 ) (Θ ,ϕ )



 un = Tr M,nM M ( I − r M,n A M ) Tr M−M1,n ( I − r M−1,n A M−1 ) · · · Tr1,n1 1 ( I − r1,n A1 ) xn ,

R N ,λ N,n ( I − λ N,n B N ) JR N −1 ,λ N −1,n ( I − λ N −1,n B N −1 ) · · · JR1 ,λ1,n ( I − λ1,n B1 ) un ,

v = J
n
(16)


 yn = αn γTn vn + ( I − αn µF )Vxn ,

n+1 = PC [( I − sn A ) Tn vn + sn yn ], ∀ n ≥ 0.
x


We will show the convergence of { xn } as n → ∞ to x̃ ∈ Ω, which solves (15).

Now, for t ∈ (0, min{1, τ2− γ̄ 1 −1
−γ }), and st ∈ (0, min{ 2 , k A k }), let Qt : C → C be defined by
Qt x = PC [( I − st A) Tt ΛtN ∆tM x + st [Vx − t(µFVx − γTt ΛtN ∆tM x )], ∀ x ∈ C. By Lemmas 5 and 7,
we have

k Qt x − Qt yk ≤ k( I − st A) Tt ΛtN ∆tM x − ( I − st A) Tt ΛtN ∆tM yk

+ st k(( I − tµF )Vx + tγTt ΛtN ∆tM x ) − (( I − tµF )Vy + tγTt ΛtN ∆tM y)k
≤ (1 − st γ̄)k x − yk + st [(1 − tτ )k x − yk + tγk x − yk]
= [1 − st (γ̄ − 1 + t(τ − γ))]k x − yk.

It is easy to check that 0 < 1 − st (γ̄ − 1 + t(τ − γ)) < 1. Therefore, Qt : C → C is contraction and
Qt has a unique fixed point, denoted by xt .

Proposition 4. Let { xt } be defined via (14). Then

(i) { xt } is bounded for t ∈ (0, min{1, τ2− γ̄

−γ });
(ii) limt→0 k xt − Tt xt k = 0, limt→0 k xt − ΛtN xt k = 0 and limt→0 k xt − ∆tM xt k = 0 provided
limt→0 λt = L2 ;
(iii) xt , st , λi,t , r j,t are locally Lipschitzian.

j
Proof. (i) Pick up p ∈ Ω. Noting that Fix( Tt ) = Ξ, Λit p = p and ∆t p = p for all i ∈ {1, ..., N } and
j
j ∈ {1, ..., M }, by the nonexpansivity of Tt , Λit and ∆t and Lemmas 5 and 7 we get

k xt − pk ≤ k( I − st A) Tt ΛtN ∆tM xt − ( I − st A) Tt ΛtN ∆tM pk + st k( I − tµF )Vxt + tγTt ΛtN ∆tM xt − Apk
≤ st k( I − tµF )Vxt − ( I − tµF )V p + t(γTt ΛtN ∆tM xt − µFV p) + V p − Apk
+ (1 − st γ̄)k Tt ΛtN ∆tM xt − Tt ΛtN ∆tM pk
≤ [1 − st (γ̄ − 1 + t(τ − γ))]k xt − pk + st (tk(γI − µFV ) pk + k(V − A) pk).

Thus,
k(V − A) pk + k(γI − µFV ) pk
k xt − pk ≤ .
γ̄ − 1
Hence { xt } is bounded and so are {Vxt }, {ut }, {vt }, { Tt vt } and { FVxt }.
(ii) From (14), we obtain

k xt − Tt vt k = k PC [( I − st A) Tt vt + st (( I − tµF )Vxt + tγTt vt )] − PC Tt vt k

(17)
≤ st kVxt − ATt vt k + tkγTt vt − µFVxt k → 0 as t → 0.

From (12), we have

kvt − pk2 ≤ kΛit ut − pk2

= k JRi ,λi,t ( I − λi,t Bi )Λit−1 ut − JRi ,λi,t ( I − λi,t Bi ) pk2 (18)
≤ k xt − pk2 + λi,t (λi,t − 2ηi )k Bi Λit−1 ut − Bi pk2 ,
Mathematics 2019, 7, 270 8 of 20

and
j
k u t − p k2 ≤ k ∆ t x t − p k2
(Θ ,ϕ j ) j −1 (Θ j ,ϕ j )
= k Tr j,t j ( I − r j,t A j )∆t xt − Tr j,t ( I − r j,t A j ) pk2 (19)
j −1
≤ k xt − pk2 + r j,t (r j,t − 2µ j )k A j ∆t x t − A j p k2 .
Simple calculations show that

xt − p = xt − wt + ( I − st A)( Tt vt − Tt p) + st [( I − tµF )Vxt − ( I − tµF )V p

(20)
+ tγ( Tt vt − Tt p) + t(γI − µFV ) p] + st (V − A) p,

where wt = ( I − st A) Tt vt + st (tγTt vt + ( I − tµF )Vxt ). Then, by the nonexpansivity of Tt , Proposition 1,

and Lemmas 5 and 7, from (18)–(20) we obtain that

k xt − pk2 ≤ h( I − st A)( Tt vt − Tt p), xt − pi + st [h( I − tµF )Vxt − ( I − tµF )V p, xt − pi

+ tγh( Tt vt − Tt p), xt − pi + th(γI − µFV ) p, xt − pi] + st h(V − A) p, xt − pi
1 j −1
≤ (1 − st (γ̄ − tγ)) [k xt − pk2 + r j,t (r j,t − 2µ j )k A j ∆t xt − A j pk2
2
+ λi,t (λi,t − 2ηi )k Bi Λit−1 ut − Bi pk2 + k xt − pk2 ] + st [(1 − tτ )k xt − pk2 (21)
+ tk(γI − µFV ) pkk xt − pk] + st k(V − A) pkk xt − pk
1 − st (γ̄ − tγ) j −1
≤ k x t − p k2 − [r j,t (2µ j − r j,t )k A j ∆t xt − A j pk2 + λi,t (2ηi − λi,t )
2
× k Bi Λit−1 ut − Bi pk2 ] + st (tk(γI − µFV ) pk + k(V − A) pk)k xt − pk,

which together with {λi,t } ⊂ [ ai , bi ] ⊂ (0, 2ηi ), i = 1, ..., N and {r j,t } ⊂ [c j , d j ] ⊂ (0, 2µ j ), j = 1, ..., M,
implies that

1 − st (γ̄ − tγ) j −1
[c j (2µ j − d j )k A j ∆t xt − A j pk2 + ai (2ηi − bi )k Bi Λit−1 ut − Bi pk2 ]
2
1 − st (γ̄ − tγ) j −1
≤ [r j,t (2µ j − r j,t )k A j ∆t xt − A j pk2 + λi,t (2ηi − λi,t )k Bi Λit−1 ut − Bi pk2 ]
2
≤ st (tk(γI − µFV ) pk + k(V − A) pk)k xt − pk.

Since limt→0 st = 0 and { xt } is bounded, we have

j −1
lim k Bi Λit−1 ut − Bi pk = 0 and lim k A j ∆t xt − A j pk = 0 (i ∈ {1, ..., N }, j ∈ {1, ..., M}). (22)
t →0 t →0

According to Proposition 2, we have

j j −1 j
k∆t xt − pk2 ≤ h( I − r j,t A j )∆t xt − ( I − r j,t A j ) p, ∆t xt − pi
1 j −1 j j −1 j j −1
≤ (k∆t xt − pk2 + k∆t xt − pk2 − k∆t xt − ∆t xt − r j,t ( A j ∆t xt − A j p)k2 ),
2
which implies that

j j −1
k ∆ t x t − p k2 ≤ k ∆ t x t − p k2 − k ∆ t
j −1
≤ k x t − p k2 − k ∆ t
j −1 j j −1
xt − ∆t xt − r j,t ( A j ∆t xt − A j p)k2
j j −1 j j −1
(23)
xt − ∆t xt k2 + 2r j,t k∆t xt − ∆t xt kk A j ∆t x t − A j p k.

Also, by Lemma 10, we obtain that for each i ∈ {1, ..., N }

Mathematics 2019, 7, 270 9 of 20

kΛit ut − pk2 ≤ h( I − λi,t Bi )Λit−1 ut − ( I − λi,t Bi ) p, Λit ut − pi

1
= (k( I − λi,t Bi )Λit−1 ut − ( I − λi,t Bi ) pk2 + kΛit ut − pk2
2
− k( I − λi,t Bi )Λit−1 ut − ( I − λi,t Bi ) p − (Λit ut − p)k2 )
1
≤ (kut − pk2 + kΛit ut − pk2 − kΛit−1 ut − Λit ut − λi,t ( Bi Λit−1 ut − Bi p)k2 ),
2
which implies

kΛit ut − pk2 ≤ kut − pk2 − kΛit−1 ut − Λit ut − λi,t ( Bi Λit−1 ut − Bi p)k2

(24)
≤ kut − pk2 − kΛit−1 ut − Λit ut k2 + 2λi,t kΛit−1 ut − Λit ut kk Bi Λit−1 ut − Bi pk.

Thus, utilizing Lemma 1, from (21), (23) and (24) we have

1
k xt − pk2 ≤ (1 − st (γ̄ − tγ)) (kΛit ut − pk2 + k xt − pk2 ) + st k(V − A) pkk xt − pk
2
+ st [(1 − tτ )k xt − pk2 + tk(γI − µFV ) pkk xt − pk]
1 j −1 j
≤ (1 − st (γ̄ − tγ)) [k xt − pk2 − k∆t xt − ∆t xt k2
2
j −1 j j −1
+ 2r j,t k∆t xt − ∆t xt kk A j ∆t xt − A j pk − kΛit−1 ut − Λit ut k2
+ 2λi,t kΛit−1 ut − Λit ut kk Bi Λit−1 ut − Bi pk + k xt − pk2 ]
+ st [(1 − tτ )k xt − pk2 + tk(γI − µFV ) pkk xt − pk] + st k(V − A) pkk xt − pk
1 − st (γ̄ − tγ) j −1 j
≤ k x t − p k2 − (k∆t xt − ∆t xt k2 + kΛit−1 ut − Λit ut k2 )
2
j −1 j j −1
+ r j,t k∆t xt − ∆t xt kk A j ∆t xt − A j pk + λi,t kΛit−1 ut − Λit ut kk Bi Λit−1 ut − Bi pk
+ st (tk(γI − µFV ) pk + k(V − A) pk)k xt − pk,

which together with {λi,t } ⊂ [ ai , bi ] ⊂ (0, 2ηi ) and {r j,t } ⊂ [c j , d j ] ⊂ (0, 2µ j ), leads to

1 − st (γ̄ − tγ) j −1 j
(k∆t xt − ∆t xt k2 + kΛit−1 ut − Λit ut k2 )
2
j −1 j j −1
≤ d j k∆t xt − ∆t xt kk A j ∆t xt − A j pk + bi kΛit−1 ut − Λit ut kk Bi Λit−1 ut − Bi pk
+ st (tk(γI − µFV ) pk + k(V − A) pk)k xt − pk.

j −1
Since limt→0 st = 0, limt→0 k A j ∆t xt − A j pk = 0 and limt→0 k Bi Λit−1 ut − Bi pk = 0 (due to
j
(22)), we deduce from the boundedness of { xt }, {Λit ut } and {∆t xt } that

j −1 j
lim kΛit−1 ut − Λit ut k = 0 and lim k∆t xt − ∆t xt k = 0. (25)
t →0 t →0

Hence we get

k xt − ut k ≤ k∆0t xt − ∆1t xt k + k∆1t xt − ∆2t xt k + · · · + k∆tM−1 xt − ∆tM xt k

(26)
→ 0 as t → 0,
Mathematics 2019, 7, 270 10 of 20

and
kut − vt k ≤ kΛ0t ut − Λ1t ut k + kΛ1t ut − Λ2t ut k + · · · + kΛtN −1 ut − ΛtN ut k
(27)
→ 0 as t → 0.
So, taking into account that k xt − vt k ≤ k xt − ut k + kut − vt k, we have

lim k xt − vt k = 0. (28)
t →0

In the meantime, from the nonexpansivity of Tt and ΛtN , it is easy to see that

k xt − Tt xt k ≤ k xt − Tt vt k + k Tt vt − Tt xt k
≤ k xt − Tt vt k + kvt − xt k,

and
k xt − ΛtN xt k ≤ k xt − ΛtN ut k + kΛtN ut − ΛtN xt k
≤ k x t − v t k + k u t − x t k.
Consequently, from (17), (26) and (28) we immediately deduce that

lim k xt − Tt xt k = 0 and lim k xt − ΛtN xt k = 0. (29)

t →0 t →0

(iii) Since ∇ f is L1 -ism, PC ( I − λt ∇ f ) is nonexpansive for λt ∈ (0, L2 ). Then,

k PC ( I − λt ∇ f )vt0 k ≤ k PC ( I − λt ∇ f )vt0 − PC ( I − λt ∇ f ) pk + k pk
≤ k v t0 k + 2 k p k .

This implies that { PC ( I − λt ∇ f )vt0 } is bounded. Also, observe that

4L|λt0 − λt |k PC ( I − λt ∇ f )vt0 k 4L|λt − λt0 |

k Tt vt0 − Tt0 vt0 k ≤ + kvt k
(2 + λt L)(2 + λt0 L) (2 + λt L)(2 + λt0 L) 0
4(2 + λt L)k PC ( I − λt ∇ f )vt0 − PC ( I − λt0 ∇ f )vt0 k
+ (30)
(2 + λt L)(2 + λt0 L)
≤ |λt − λt0 |[ Lk PC ( I − λt ∇ f )vt0 k + 4k∇ f (vt0 )k + Lkvt0 k]
≤M e | λ t − λ t |,
0

where supt { Lk PC ( I − λt ∇ f )vt0 k + 4k∇ f (vt0 )k + Lkvt0 k} ≤ M e for some Me > 0. So, by (30),
we have that
k Tt vt − Tt0 vt0 k ≤ k Tt vt − Tt vt0 k + k Tt vt0 − Tt0 vt0 k
≤ k v t − v t0 k + Me |λt − λt |
0 (31)
4M e
≤ k v t − v t0 k + | s t − s t0 |.
L
Utilizing (12) and (13), we obtain that
Mathematics 2019, 7, 270 11 of 20

kvt − vt0 k ≤ k JR N ,λ N,t ( I − λ N,t BN )ΛtN −1 ut − JR N ,λ N,t ( I − λ N,t0 BN )ΛtN −1 ut k

+ k JR N ,λ N,t ( I − λ N,t0 BN )ΛtN −1 ut − JR N ,λ N,t ( I − λ N,t0 BN )ΛtN0 −1 ut0 k
0

≤ k( I − λ N,t BN )ΛtN −1 ut − ( I − λ N,t0 BN )ΛtN −1 ut k

+ k( I − λ N,t0 BN )ΛtN −1 ut − ( I − λ N,t0 BN )ΛtN0 −1 ut0 k + |λ N,t − λ N,t0 |
1
×( kJ ( I − λ N,t0 BN )ΛtN −1 ut − ( I − λ N,t0 BN )ΛtN0 −1 ut0 k
λ N,t R N ,λ N,t (32)
1
+ k( I − λ N,t0 BN )ΛtN −1 ut − JR N ,λ N,t ( I − λ N,t0 BN )ΛtN0 −1 ut0 k)
λ N,t0 0

≤ |λ N,t − λ N,t |(k BN Λ N −1 ut k + M

0 t
b ) + k Λ N −1 u t − Λ N −1 u t k
t 0 t0
N
e 0 ∑ |λi,t − λi,t | + kut − ut k,
≤M 0 0
i =1

where
1
sup{ k JRi ,λi,t ( I − λi,t0 Bi )Λit−1 ut − ( I − λi,t0 Bi )Λit−
0
1
u t0 k
t λ i,t
1
+ k( I − λi,t0 Bi )Λit−1 ut − JRi ,λi,t ( I − λi,t0 Bi )Λit− 0
1
ut0 k} ≤ M,
b
λi,t0 0

b > 0 and sup {∑ N k Bi Λi−1 ut k + M

for some M b} ≤ M e 0 > 0. Also, utilizing Proposition 2,
e 0 for some M
t i =1 t
we deduce that
(Θ ,ϕ M ) (Θ ,ϕ M )
kut − ut0 k ≤ k Tr M,tM ( I − r M,t BM )∆tM−1 xt − Tr M,tM ( I − r M,t BM )∆tM−1 xt k
0
(Θ ,ϕ M ) (Θ ,ϕ M )
+ k Tr M,tM ( I − r M,t BM )∆tM−1 xt − Tr M,tM ( I − r M,t0 BM )∆tM−1 xt k
0 0

+ k( I − r M,t0 BM )∆tM−1 xt − ( I − r M,t0 BM )∆tM0 −1 xt0 k

1 (Θ ,ϕ )
≤ |r M,t − r M,t0 |[k BM ∆tM−1 xt k + k Tr M,tM M ( I − r M,t BM )∆tM−1 xt
r M,t (33)
− ( I − r M,t BM )∆tM−1 xt k] + · · · + k∆0t xt − ∆0t0 xt0 k
1 (Θ ,ϕ )
+ |r1,t − r1,t0 |[k B1 ∆0t xt k + k Tr1,t 1 1 ( I − r1,t B1 )∆0t xt − ( I − r1,t B1 )∆0t xt k]
r1,t
M
≤M
e1 ∑ |r j,t − r j,t0 | + k xt − xt0 k,
j =1

e 1 > 0 is a constant and

where M

M
j −1 1 (Θ ,ϕ ) j −1 j −1
∑ [k Bj ∆t xt k +
r j,t
k Tr j,t j j ( I − r j,t Bj )∆t xt − ( I − r j,t Bj )∆t xt k] ≤ M
e 1.
j =1

In terms of (31)–(33), we calculate

M N
4M
∑ |r j,t − r j,t0 | + Me 0 ∑ |λi,t − λi,t0 | +
e
k Tt vt − Tt0 vt0 k ≤ k xt − xt0 k + M
e1 | s t − s t0 |,
j =1 i =1
L

and hence
Mathematics 2019, 7, 270 12 of 20

k xt − xt0 k ≤ k( I − st A) Tt vt + st (( I − tµF )Vxt + tγTt vt ) − ( I − st0 A) Tt0 vt0

− st0 (( I − t0 µF )Vxt0 + t0 γTt0 vt0 )k
≤ |st − st0 |k Akk Tt vt k + (1 − st0 γ̄)k Tt vt − Tt0 vt0 k + t0 γk Tt vt − Tt0 vt0 k
+ |st − st0 |[kVxt k + t(γk Tt vt k + µk FVxt k)] + st0 [(γk Tt vt k + µk FVxt k)|t − t0 |
+ (1 − t0 τ )k xt − xt0 k]
M N
e 1 ∑ |r j,t − r j,t | + M
≤ (1 − st0 (γ̄ − 1 + t0 (τ − γ)))(k xt − xt0 k + M e 0 ∑ |λi,t − λi,t |
0 0
j =1 i =1

4M e
+ |st − st0 |) + |st − st0 |[k Akk Tt vt k + kVxt k + t(γk Tt vt k + µk FVxt k)]
L
+ st0 (γk Tt vt k + µk FVxt k)|t − t0 |.

This immediately implies that

k Akk Tt vt k + kVxt k + t(γk Tt vt k + µk FVxt k) + 4LM

e
k x t − x t0 k ≤ | s t − s t0 |
st0 (γ̄ − 1 + t0 (τ − γ))
M
γk Tt vt k + µk FVxt k M
st0 (γ̄ − 1 + t0 (τ − γl )) j∑
e1
+ | t − t0 | + |r j,t − r j,t0 |
γ̄ − 1 + t0 (τ − γ) =1
N
M
∑
e0
+ |λ − λi,t0 |.
st0 (γ̄ − 1 + t0 (τ − γl )) i=1 i,t

Since st , λi,t , r j,t are locally Lipschitzian, we conclude that xt is locally Lipschitzian.

Theorem 1. Assume that limt→0 st = 0. Then, xt defined by (14) converges strongly to x̃ ∈ Ω as t → 0,

which solves (15).

Proof. Let x̃ be the unique solution of (15). Let p ∈ Ω. Then, we have

xt − p = xt − wt + st [( I − tµF )Vxt − ( I − tµF )V p + tγ( Tt vt − Tt p) + t(γI − µFV ) p]

+ ( I − st A)( Tt vt − Tt p) + st (V − A) p,

where wt = ( I − st A) Tt vt + st (( I − tµF )Vxt + tγTt vt ). Then, by Proposition 1 and the nonexpansivity

of Tt , we obtain from (18) that

k xt − pk2 ≤ h( I − st A)( Tt vt − Tt p), xt − pi + st [h( I − tµF )Vxt − ( I − tµF )V p, xt − pi

+ tγh Tt vt − Tt p, xt − pi + th(γI − µFV ) p, xt − pi] + st h(V − A) p, xt − pi
≤ (1 − st γ̄)kvt − pkk xt − pk + st [(1 − tτ )k xt − pk2
+ tγkvt − pkk xt − pk + th(γI − µFV ) p, xt − pi] + st h(V − A) p, xt − pi
≤ [1 − st ((γ̄ − 1) + t(τ − γ))]k xt − pk2 + h(V − A) p, xt − pi + st (th(γI − µFV ) p, xt − pi).

Hence,

1
k x t − p k2 ≤ (h(V − A) p, xt − pi + th(γI − µFV ) p, xt − pi). (34)
γ̄ − 1 + t(τ − γ)

It follows that xtn → x ∗ , where {tn } ∈ (0, min{1, τ2− γ̄

−γ }) such that tn → 0. By Proposition 4,
we get limn→∞ k xtn − Ttn xtn k = 0. Observe that

k PC ( I − λtn ∇ f ) xtn − xtn k = kstn xtn + (1 − stn ) Ttn xtn − xtn k

≤ k Ttn xtn − xtn k,
Mathematics 2019, 7, 270 13 of 20

2− λ t n L
where stn = 4 ∈ (0, 21 ) for λtn ∈ (0, L2 ). Hence we have

2 2
k PC ( I − ∇ f ) xtn − xtn k ≤ k( I − ∇ f ) xtn − ( I − λtn ∇ f ) xtn k + k PC ( I − λtn ∇ f ) xtn − xtn k
L L
2
≤ ( − λtn )k∇ f ( xtn )k + k Ttn xtn − xtn k.
L

By the boundedness of { xtn }, stn → 0 (⇔ λtn → L2 ) and k Ttn xtn − xtn k → 0, we deduce

2 2
k x ∗ − PC ( I − ∇ f ) x ∗ k = lim k xtn − PC ( I − ∇ f ) xtn k = 0.
L n → ∞ L

Therefore, x ∗ ∈ VI(C, ∇ f ) = Ξ.
j
Furthermore, from (25), (26) and (28), we have that ∆tn xtn → x ∗ , Λm ∗
tn utn → x , u tn → x
∗

and vtn → x ∗ . First, we prove that x ∗ ∈ ∩m N I( B , R ). Please note that R + B is maximal

=1 m m m m
monotone. Let (v, g) ∈ G ( Rm + Bm ), i.e., g − Bm v ∈ Rm v. Noting that Λm u
tn tn = JRm ,λm,tn ( I −
m −1
λm,tn Bm )Λtn utn , m ∈ {1, ..., N }, we have

−1 m −1
Λm m
tn utn − λm,tn Bm Λtn utn ∈ ( I + λm,tn Rm ) Λtn utn ,

that is,
1
( Λ m −1 u t n − Λ m m −1 m
tn utn − λm,tn Bm Λtn utn ) ∈ Rm Λtn utn .
λm,tn tn
According to the monotonicity of Rm , we have

1 −1 m −1
hv − Λm
tn utn , g − Bm v − (Λm m
tn utn − Λtn utn − λm,tn Bm Λtn utn )i ≥ 0
λm,tn

and hence
1
hv − Λm m
tn utn , g i ≥ h v − Λtn utn , Bm v + ( Λ m −1 u t n − Λ m m −1
tn utn − λm,tn Bm Λtn utn )i
λm,tn tn
m −1 1
≥ hv − Λm m m
tn utn , Bm Λtn utn − Bm Λtn utn i + h v − Λtn utn , ( Λ m −1 u t n − Λ m
tn utn )i.
λm,tn tn

m −1 m −1
Since kΛmtn utn − Λtn utn k → 0 (due to (25)) and k Bm Λtn utn − Bm Λtn utn k → 0, we deduce from
m

Λm ∗
tn utn → x and { λm,tn } ⊂ [ am , bm ] ⊂ (0, 2ηm ) that

∗
lim hv − Λm
tn utn , g i = h v − x , g i ≥ 0.
n→∞

By the maximal monotonicity of Bm + Rm , we derive 0 ∈ ( Rm + Bm ) x ∗ , i.e., x ∗ ∈ I( Bm , Rm ). Thus,

j (Θ j ,ϕ j )
x∗ ∈ that x ∗ ∈ ∩ jM=1 GMEP(Θ j , ϕ j , A j ). Since ∆tn xtn = Tr j,tn
TN
m=1 I( Bm , Rm ). Next we prove (I −
j −1
r j,tn A j )∆tn xtn , j ∈ {1, ..., M}, we have

j j −1
j j j −1 j j ∆ tn xtn − ∆ tn x tn
Θ j ( ∆ tn xtn , y ) + ϕ j ( y ) − ϕ j ( ∆tn x tn ) + h A j ∆ tn xtn , y − ∆tn x tn i + h y − ∆ tn xtn , i ≥ 0.
r j,tn

By (A2), we have

j j −1
j j −1 j j ∆ tn x tn − ∆ tn xtn j
ϕ j ( y ) − ϕ j ( ∆tn x tn ) + h A j ∆ tn x tn , y − ∆tn xtn i + h y − ∆ tn xtn , i ≥ Θ j (y, ∆tn xtn ).
r j,tn
Mathematics 2019, 7, 270 14 of 20

Let y ∈ C and t ∈ (0, 1]. Set zt = ty + (1 − t) x ∗ . Thus, zt ∈ C. Hence,

j j j j j
h z t − ∆ tn x tn , A j zt i ≥ ϕ j ( ∆tn xtn ) − ϕ j ( z t ) + h z t − ∆ tn xtn , A j zt − A j ∆ tn xtn i + Θ j ( zt , ∆ tn xtn )
j j −1 (35)
j j j −1 j ∆ tn x tn − ∆ tn xtn
+ h zt − ∆ tn xtn , A j ∆ tn xtn − A j ∆ tn xtn i − h zt − ∆ tn xtn , i.
r j,tn

j j −1 j
By (25), we have k A j ∆tn xtn − A j ∆tn xtn k → 0 as n → ∞. Please note that hzt − ∆tn xtn , A j zt −
j
A j ∆tn xtn i ≥ 0. Then,
h z t − x ∗ , A j z t i ≥ ϕ j ( x ∗ ) − ϕ j ( z t ) + Θ j ( z t , x ∗ ). (36)

Applying (A1), (A4) and (36), we obtain

0 = Θ j (zt , zt ) + ϕ j (zt ) − ϕ j (zt )

≤ t[Θ j (zt , y) + ϕ j (y) − ϕ j (zt )] + (1 − t)thy − x ∗ , A j zt i,

and hence
0 ≤ Θ j (zt , y) + ϕ j (y) − ϕ j (zt ) + (1 − t)hy − x ∗ , A j zt i.

Thus,
0 ≤ Θ j ( x ∗ , y ) + ϕ j ( y ) − ϕ j ( x ∗ ) + h y − x ∗ , A j x ∗ i.

So, x ∗ ∈ GMEP(Θ j , ϕ j , A j ) and x ∗ ∈ ∩ jM=1 GMEP(Θ j , ϕ j , A j ). Therefore, x ∗ ∈

∩ jM=1 GMEP(Θ j , ϕ j , A j ) ∩ ∩m=1 I( Bm , Rm ) ∩ Ξ =: Ω.
N

Next, we prove that xt → x̃ as t → 0. First, let us assert that x ∗ is a solution of the VIP (15). As a
matter of fact, since xt = xt − wt + ( I − st A) Tt ΛtN ∆tM xt + st (( I − tµF )Vxt + tγTt ΛtN ∆tM xt ), we have

xt − Tt ΛtN ∆tM xt = xt − wt + st (V − A) Tt ΛtN ∆tM xt + st (Vxt − VTt ΛtN ∆tM xt + t(γTt ΛtN ∆tM xt − µFVxt )).

Since Tt , ΛtN and ∆tM are nonexpansive mappings, I − Tt ΛtN ∆tM is monotone. By the monotonicity of
I − Tt ΛtN ∆tM , we have

0 ≤ h( I − Tt ΛtN ∆tM ) xt − ( I − Tt ΛtN ∆tM ) p, xt − pi

≤ st h(V − A) Tt vt − (V − A) xt , xt − pi + st hVxt − VTt vt , xt − pi
+ st h(V − A) xt , xt − pi + st th(γTt vt − µFVxt ), xt − pi.

Hence,

h( A − V ) xt , xt − pi ≤ k(V − A) Tt vt − (V − A) xt kk xt − pk + kVxt − VTt vt kk xt − pk

+ tkγTt vt − µFVxt kk xt − pk (37)
≤ (2 + k Ak)k Tt vt − xt kk xt − pk + t(γk Tt vt k + µk FVxt k)k xt − pk.

Now, replacing t in (37) with tn and noticing the boundedness of {γk Ttn vtn k + µk FVxtn k} and
the fact that (V − A) Ttn vtn − (V − A) xtn → 0, we deduce

h( A − V ) x ∗ , x ∗ − pi ≤ 0.

Thus, x ∗ ∈ Ω is a solution of (15); hence x ∗ = x̃ by uniqueness. Consequently, xt → x̃ as

t → 0.
Mathematics 2019, 7, 270 15 of 20

Theorem 2. Assume that the sequences {αn } ⊂ [0, 1] and {sn } ⊂ (0, 12 ) satisfy: (C1) limn→∞ αn = 0
and limn→∞ sn = 0. Let the sequence { xn } be defined by (16). Then LIMn h( A − V ) x̃, x̃ − xn i ≤ 0,
where x̃ = limt→0+ xt and xt is defined by

xt = PC [( I − st A) TΛ N ∆ M xt + st (Vxt − t(µFVxt − γTΛ N ∆ M xt ))], (38)

where T, Λ N , ∆ M : C → C are defined by Tx = PC ( I − L2 ∇ f ) x, Λ N x = JR N ,λ N ( I − λ N BN ) · · · JR1 ,λ1 ( I −

(Θ ,ϕ ) (Θ1 ,ϕ1 )
λ1 B1 ) x and ∆ M x = Tr M M M ( I − r M A M ) · · · Tr1 ( I − r1 A1 ) x for λi ∈ [ ai , bi ] ⊂ (0, 2ηi ), i = 1, ..., N
and r j ∈ [c j , d j ] ⊂ (0, 2µ j ), j = 1, ..., M.

Proof. We assume, without loss of generality, that 0 < sn ≤ k Ak−1 for all n ≥ 0. Let limt→0 xt =
x̃ and x̃ is the unique solution of (15). By Proposition 4, we deduce that the nets { xt },
{Vxt }, {∆ M xt }, {Λ N ∆ M xt } and { FVxt } are bounded.
Let p ∈ Ω. Then Tn p = p, ΛnN p = p and ∆nM p = p. Applying Lemmas 5 and 7, we obtain that

k xn+1 − pk ≤ sn [(1 − αn τ )k xn − pk + αn γkvn − pk + αn k(γI − µFV ) pk]

+ (1 − sn γ̄)kvn − pk + sn k(V − A) pk
≤ sn [(1 − αn τ )k xn − pk + αn γk xn − pk + αn k(γI − µFV ) pk]
+ sn k(V − A) pk + (1 − sn γ̄)k xn − pk
k(V − A) pk + k(γI − µFV ) pk
≤ max{ , k xn − pk}.
γ̄ − 1

By induction

k(V − A) pk + k(γI − µFV ) pk

k xn − pk ≤ max{ , k x0 − pk}, ∀n ≥ 0.
γ̄ − 1

Thus, { xn }, {un }, {vn }, { Tn vn }, { FVxn }, {Vxn } and {yn } are all bounded. By (C1), we obtain

k xn+1 − Tn vn k ≤ k( I − sn A) Tn vn + sn yn − Tn vn k = sn kyn − ATn vn k → 0 as n → ∞.

By (31), we also have

2
k TΛ N ∆ M xn − Tn ΛnN ∆nM xn k ≤ kΛ N ∆ M xn − ΛnN ∆nM xn k + M
b| − λ n |, (39)
L

where supn≥0 { Lk PC ( I − L2 ∇ f )vn k + 4k∇ f (vn )k + Lkvn k} ≤ M b > 0. According to (32),

b for some M
we have
N
b 0 ∑ |λi − λi,n | + k∆ M xn − ∆nM xn k,
kΛ N ∆ M xn − ΛnN ∆nM xn k ≤ M (40)
i =1

where
1
sup{ kJ ( I − λi,n Bi )Λi−1 ∆ M xn − ( I − λi,n Bi )Λin−1 un k
n ≥0 λi Ri ,λi
1
+ k( I − λi,n Bi )Λi−1 ∆ M xn − JRi ,λi,n ( I − λi,n Bi )Λin−1 un k} ≤ N,
b
λi,n
N i −1 ∆ M x k + N
n≥0 { ∑i =1 k Bi Λ
b > 0 and sup
for some N n b} ≤ M b 0 > 0. In terms of (33),
b 0 for some M
we have
M
k∆ M xn − ∆nM xn k ≤ M
b1 ∑ |r j − r j,n |, (41)
j =1
Mathematics 2019, 7, 270 16 of 20

(Θ j ,ϕ j )
where supn≥0 {∑ jM=1 [k A j ∆ j−1 xn k + r1 k Tr j ( I − r j A j )∆ j−1 xn − ( I − r j A j )∆ j−1 xn k]} ≤ M
b 1 for some
j
b 1 > 0. In terms of (39)–(41) we calculate
M

M N
2
k TΛ N ∆ M xn − Tn ΛnN ∆nM xn k ≤ M
b1 ∑ |r j − r j,n | + Mb 0 ∑ |λi − λi,n | + Mb | L − λn |.
j =1 i =1

It is clear that

k TΛ N ∆ M xt − xn+1 k ≤ k TΛ N ∆ M xt − TΛ N ∆ M xn k + k TΛ N ∆ M xn − Tn ΛnN ∆nM xn k

+ k Tn ΛnN ∆nM xn − xn+1 k
M N
b 1 ∑ |r j − r j,n | + M
≤ k xt − xn k + M b | 2 − λn |
b 0 ∑ |λi − λi,n | + M (42)
j =1 i =1
L

+ k Tn vn − xn+1 k
= k x t − x n k + en ,

where en = M b 1 ∑ M |r j − r j,n | + Mb 0 ∑ N |λi − λi,n | + M

b | 2 − λn | + k Tn vn − xn+1 k → 0 as n → ∞.
j =1 i =1 L
Please note that
h Axt − Axn , xt − xn i ≥ γ̄k xt − xn k2 . (43)

Furthermore, for simplicity, we write wt = ( I − st A) TΛ N ∆ M xt + st (( I − tµF )Vxt + tγTΛ N ∆ M xt ).

By (38), we get xt = PC wt and

xt − xn+1 = ( I − st A) TΛ N ∆ M xt − ( I − st A) xn+1 + st [( I − tµF )Vxt − ( I − tµF )Vxn+1

+ t(γTΛ N ∆ M xt − µFVxn+1 ) + (V − A) xn+1 ] + xt − wt .

Applying Lemma 1 and Proposition 1, we have

k xt − xn+1 k2 ≤ 2st thγTΛ N ∆ M xt − µFVxn+1 ), xt − xn+1 i + 2st h(V − A) xn+1 , xt − xn+1 i

+ 2st h( I − tµF )Vxt − ( I − tµF )Vxn+1 , xt − xn+1 i
+ k( I − st A) TΛ N ∆ M xt − ( I − st A) xn+1 k2
≤ (1 − st γ̄)2 k TΛ N ∆ M xt − xn+1 k2 + 2st hVxt − Vxn+1 , xt − xn+1 i
− 2st tµh FVxt − FVxn+1 , xt − xn+1 i + 2st h(V − A) xn+1 , xt − xn+1 i (44)
N M
+ 2st tkγTΛ ∆ xt − µFVxn+1 kk xt − xn+1 k
≤ (1 − st γ̄)2 k TΛ N ∆ M xt − xn+1 k2 + 2st hVxt − Vxn+1 , xt − xn+1 i
+ 2st t(µk FVxt − FVxn+1 k + kγTΛ N ∆ M xt − µFVxn+1 k)k xt − xn+1 k
+ 2st h(V − A) xn+1 , xt − xn+1 i.

Using (42) and (43) in (44), we obtain

k xt − xn+1 k2 ≤ (1 − st γ̄)2 (k xt − xn k + en )2 + 2st hVxt − Vxn+1 , xt − xn+1 i

+ 2st t(µκ k xt − xn+1 k + kγTΛ N ∆ M xt − µFVxn+1 k)k xt − xn+1 k
+ 2st h(V − A) xn+1 , xt − xn+1 i
≤ s2t γ̄h A( xt − xn ), xt − xn i + k xt − xn k2 + (1 − st γ̄)2 (2k xt − xn ken + en2 ) (45)
N M
+ 2st t(µκ k xt − xn+1 k + kγTΛ ∆ xt − µFVxn+1 k)k xt − xn+1 k
+ 2st [h(V − A) xt , xt − xn+1 i + h A( xt − xn+1 ), xt − xn+1 i
− h A( xt − xn ), xt − xn i].
Mathematics 2019, 7, 270 17 of 20

Applying the Banach limit LIM to (45), we have

LIMn k xt − xn+1 k2 ≤ s2t γ̄LIMn h A( xt − xn ), xt − xn i + LIMn k xt − xn k2

+ 2st tLIMn (µκ k xt − xn+1 k + kγTΛ N ∆ M xt − µFVxn+1 k)k xt − xn+1 k
(46)
+ 2st [LIMn h(V − A) xt , xt − xn+1 i + LIMn h A( xt − xn+1 ), xt − xn+1 i
− LIMn h A( xt − xn ), xt − xn i].

Using the property LIMn an = LIMn an+1 , we have

LIMn h( A − V ) xt , xt − xn i = LIMn h( A − V ) xt , xt − xn+1 i

st γ̄ 1
≤ LIMn h A( xt − xn ), xt − xn i + [LIMn k xt − xn k2 − LIMn k xt − xn+1 k2 ]
2 2st
+ tLIMn (µκ k xt − xn+1 k + kγTΛ N ∆ M xt − µFVxn+1 k)k xt − xn+1 k
(47)
+ LIMn h A( xt − xn+1 ), xt − xn+1 i − LIMn h A( xt − xn ), xt − xn i
st γ̄
= LIMn h A( xt − xn ), xt − xn i
2
+ tLIMn (µκ k xt − xn+1 k + kγTΛ N ∆ M xt − µFVxn+1 k)k xt − xn+1 k.

Since
st h A( xt − xn ), xt − xn i ≤ st k Akk xt − xn k2 ≤ st k AkK2 → 0 as t → 0, (48)

where k xt − xn k + kγTΛ N ∆ M xt − µFVxn k ≤ K,

tk xt − xn+1 k2 → 0 and tkγTΛ N ∆ M xt − µFVxn+1 kk xt − xn+1 k → 0 as t → 0, (49)

we conclude from (47)–(49) that

LIMn h( A − V ) x̃, x̃ − xn i ≤ lim supLIMn h( A − V ) xt , xt − xn i

t →0
≤ lim suptLIMn (µκ k xt − xn+1 k + kγTΛ N ∆ M xt − µFVxn+1 k)k xt − xn+1 k
t →0
st γ̄
+ lim sup LIMn h A( xt − xn ), xt − xn i
t →0 2
= 0.

This completes the proof.

Theorem 3. Let the sequences {αn } ⊂ [0, 1] and {sn } ⊂ (0, 12 ) satisfy: (C1) limn→∞ αn = 0, limn→∞ sn =
0 and (C2) ∑∞ n=0 sn = ∞. Let the sequence { xn } be defined by (16). If xn+1 − xn * 0, then xn converges
strongly to x̃ ∈ Ω, which solves (15).

2s (γ̄−1)
Proof. We assume, without loss of generality, that αn τ < 1 and n1−sn < 1 for all n ≥ 0. Let xt be
defined by (38). Then, limt→0 xt := x̃ ∈ Ω (due to Theorem 1). We divide the rest of the proof into
several steps.
Step 1. It is easy to show that

k(V − A) pk + k(γI − µFV ) pk

k xn − pk ≤ max{k x0 − pk, }, ∀n ≥ 0.
γ̄ − 1

Hence { xn }, {un }, {vn }, { Tn vn }, { FVxn }, {Vxn } and {yn } are all bounded.
Step 2. We show that lim supn→∞ h(V − A) x̃, xn − x̃ i ≤ 0. To this end, let

an := h( A − V ) x̃, x̃ − xn i, ∀n ≥ 0.
Mathematics 2019, 7, 270 18 of 20

According to Theorem 2, we deduce LIMn an ≤ 0. Choose a subsequence { xn j } of { xn } such that

lim sup( an+1 − an ) = lim sup( an j +1 − an j )

n→∞ j→∞

and xn j * v ∈ H. This indicates that xn j +1 * v. Hence,

w − lim ( x̃ − xn j +1 ) = w − lim ( x̃ − xn j ) = ( x̃ − v),

j→∞ j→∞

and therefore

lim sup( an+1 − an ) = lim h( A − V ) x̃, ( x̃ − xn j +1 ) − ( x̃ − xn j )i = 0.

n→∞ j→∞

Then, by Lemma 8, we derive

lim suph(V − A) x̃, xn − x̃ i = lim suph( A − V ) x̃, x̃ − xn i ≤ 0.

n→∞ n→∞

Step 3. We show that limn→∞ k xn − x̃ k = 0. Set wn = ( I − sn A) Tn vn + sn yn for all n ≥ 0.

Then xn+1 = PC wn . Utilizing (16) and Tn ΛnN ∆nM x̃ = Tn x̃ = x̃, we have

xn+1 − x̃ = sn [( I − αn µF )Vxn − ( I − αn µF )V x̃ + αn γ( Tn vn − Tn x̃ ) + αn (γI − µFV ) x̃ ]

+ ( I − sn A)( Tn vn − Tn x̃ ) + sn (V − A) x̃ + xn+1 − wn .

Thus, utilizing Proposition 1 and Lemma 1, we get

k xn+1 − x̃ k2 ≤ [(1 − sn γ̄)k Tn vn − Tn x̃ k + sn ((1 − αn τ )k xn − x̃ k + αn γk Tn vn − Tn x̃ k)]2

+ 2sn [αn k(γI − µFV ) x̃ kk xn+1 − x̃ k + h( A − V ) x̃, x̃ − xn+1 i]
≤ [1 − sn (γ̄ − 1 + αn (τ − γ))]k xn − x̃ k2
+ 2sn [αn k(γI − µFV ) x̃ kk xn+1 − x̃ k + h( A − V ) x̃, x̃ − xn+1 i]
= [1 − sn (γ̄ − 1 + αn (τ − γ))]k xn − x̃ k2 + sn (γ̄ − 1 + αn (τ − γ))
2
× [αn k(γI − µFV ) x̃ kk xn+1 − x̃ k + h( A − V ) x̃, x̃ − xn+1 i]
γ̄ − 1 + αn (τ − γ)
= (1 − ωn )k xn − x̃ k2 + ωn δn ,

where ωn = sn (γ̄ − 1 + αn (τ − γ)) and

2
δn = [αn k(γI − µFV ) x̃ kk xn+1 − x̃ k + h( A − V ) x̃, x̃ − xn+1 i].
γ̄ − 1 + αn (τ − γ)

It is easy to check that ωn → 0, ∑∞n=0 ωn = ∞ and lim supn→∞ δn ≤ 0. By Lemma 6 with rn = 0,

we deduce that limn→∞ k xn − x̃ k = 0. This completes the proof.

Author Contributions: All the authors have contributed equally to this paper. All the authors have read and
approved the final manuscript.
Funding: This research was partially supported by the Innovation Program of Shanghai Municipal Education
Commission (15ZZ068), Ph.D. Program Foundation of Ministry of Education of China (20123127110002) and
Program for Outstanding Academic Leaders in Shanghai City (15XD1503100).
Conflicts of Interest: The authors declare no conflict of interest.
Mathematics 2019, 7, 270 19 of 20

References and Note

1. Korpelevich, G.-M. The extragradient method for finding saddle points and other problems. Matecon 1976,
12, 747–756.
2. Peng, J.-W.; Yao, J.-C. A new hybrid-extragradient method for generalized mixed equilibrium problems,
fixed point problems and variational inequality problems. Taiwan. J. Math. 2008, 12, 1401–1432.
3. Ceng, L.-C.; Petrusel, A.; Lee, C.; Wong, M.-M. Two extragradient approximation methods for variational
inequalities and fixed point problems of strict pseudo-contractions. Taiwan. J. Math. 2009, 13, 607–632.
4. Ceng, L.-C.; Ansari, Q.-H.; Yao, J.-C. Relaxed extragradient iterative methods for variational inequalities.
Appl. Math. Comput. 2011, 218, 1112–1123.
5. Ceng, L.-C.; Guu, S.-M.; Yao, J.-C. Finding common solutions of a variational inequality, a general system of
variational inequalities, and a fixed-point problem via a hybrid extragradient method. Fixed Point Theory Appl.
2011, 2011, 626159.
6. Ceng, L.-C.; Al-Homidan, S. Algorithms of common solutions for generalized mixed equilibria, variational
inclusions, and constrained convex minimization. Abstr. Appl. Anal. 2014, 2014, 132053.
7. Ceng, L.-C.; Yao, J.-C. A relaxed extragradient-like method for a generalized mixed equilibrium problem,
a general system of generalized equilibria and a fixed point problem. Nonlinear Anal. 2010, 72, 1922–1937.
8. Yao, Y.; Chen, R.; Xu, H.-K. Schemes for finding minimum-norm solutions of variational inequalities.
Nonlinear Anal. 2010, 72, 3447–3456.
9. Yao, Y.; Liou, Y.-C.; Yao, J.-C. Iterative algorithms for the split variational inequality and fixed point problems
under nonlinear transformations. J. Nonlinear Sci. Appl. 2017, 10, 843–854.
10. Yao, Y.; Postolache, M.; Liou, Y.-C.; Yao, Z.-S. Construction algorithms for a class of monotone variational
inequalities. Optim. Lett. 2016, 10, 1519–1528.
11. Yao, Y.; Qin, X.; Yao, J.-C. Projection methods for firmly type nonexpansive operators. J. Nonlinear Convex Anal.
2018, 19, 407–415.
12. Yao, Y.; Postolache, M.; Yao, J.-C. An iterative algorithm for solving the generalized variational inequalities
and fixed points problems. Mathematics 2019, 7, 61, doi:10.3390/math7010061.
13. Ceng, L.-C.; Ansari, Q.-H.; Schaible, S.; Yao, J.-C. Iterative methods for generalized equilibrium problems,
systems of general generalized equilibrium problems and fixed point problems for nonexpansive mappings
in Hilbert spaces. Fixed Point Theory 2011, 12, 293–308.
14. Ceng, L.-C.; Ansari, Q.-H.; Yao, J.-C. Some iterative methods for finding fixed points and for solving
constrained convex minimization problems. Nonlinear Anal. 2011, 74, 5286–5302.
15. Ceng, L.-C.; Guu, S.-M.; Yao, J.-C. A general composite iterative algorithm for nonexpansive mappings in
Hilbert spaces. Comput. Math. Appl. 2011, 61, 2447–2455.
16. Takahashi, S.; Takahashi, W. Strong convergence theorem for a generalized equilibrium problem and a
nonexpansive mapping in a Hilbert space. Nonlinear Anal. 2008, 69, 1025–1033.
17. Ceng, L.-C.; Yao, J.-C. A hybrid iterative scheme for mixed equilibrium problems and fixed point problems.
J. Comput. Appl. Math. 2008, 214, 186–201.
18. Combettes, P.-L. Solving monotone inclusions via compositions of nonexpansive averaged operators.
Optimization 2004, 53, 475–504.
19. Zeng, L.-C.; Yao, J.-C. Modified combined relaxation method for general monotone equilibrium problems in
Hilbert spaces. J. Optim. Theory Appl. 2006, 131, 469–483.
20. Yao, Y.; Postolache, M.; Zhu, Z. Gradient methods with selection technique for the multiple-sets split
feasibility problem. Optimization, in press.
21. Yao, Y.; Shahzad, N. Strong convergence of a proximal point algorithm with general errors. Optim. Lett. 2012,
6, 621–628.
22. Zegeye, H.; Shahzad, N.; Yao, Y.-H. Minimum-norm solution of variational inequality and fixed point
problem in Banach spaces. Optimization 2015, 64, 453–471.
23. Yao, Y.H.; Chen, R.-D.; Yao, J.-C. Strong convergence and certain control conditions for modified Mann
iteration. Nonlinear Anal. 2008, 68, 1687–1693.
24. Yao, Y.; Postolache, M.; Yao, J.-C. Iterative algorithms for the generalized variational inequalities. U.P.B. Sci.
Bull. Ser. A 2019, in press.
Mathematics 2019, 7, 270 20 of 20

25. Yao, Y.; Leng, L.; Postolache, M.; Zheng, X. Mann-type iteration method for solving the split common fixed
point problem. J. Nonlinear Convex Anal. 2017, 18, 875–882.
26. Thakur, B.-S.; Postolache, M. Existence and approximation of solutions for generalized extended nonlinear
variational inequalities. J. Inequal. Appl. 2013, 2013, 590.
27. Dadashi, V.; Postolache, M. Forward-backward splitting algorithm for fixed point problems and zeros of the
sum of monotone operators. Arab. J. Math. 2019, doi:10.1007/s40065-018-0236-2.
28. Dong, Q.-L.; Lu, Y.-Y.; Yang, J. The extragradient algorithm with inertial effects for solving the variational
inequality. Optimization 2016, 65, 2217–2226.
29. Zhao, X.-P.; Ng, K.-F.; Li, C.; Yao, J.-C. Linear regularity and linear convergence of projection-based methods
for solving convex feasibility problems, Appl. Math. Optim. 2018, 78, 613–641.
30. Yao, Y.-H.; Postolache, M.; Liou, Y.-C. Strong convergence of a self-adaptive method for the split feasibility
problem. Fixed Point Theory Appl. 2013, 2013, 201.
31. Yao, Y.; Yao, J.-C.; Liou, Y.-C.; Postolache, M. Iterative algorithms for split common fixed points of
demicontractive operators without priori knowledge of operator norms. Carpathian J. Math. 2018, 34, 459–466.
32. Yao, Y.; Liou, Y.-C.; Postolache, M. Self-adaptive algorithms for the split problem of the demicontractive
operators. Optimization 2018, 67, 1309–1319.
33. Rockafellar, R.-T. Monotone operators and the proximal point algorithms. SIAM J. Control Optim. 1976,
14, 877–898.
34. Huang, N.J. A new completely general class of variational inclusions with noncompact valued mappings.
Comput. Math. Appl. 1998, 35, 9–14.
35. Zeng, L.-C.; Guu, S.-M.; Yao, J.C. Characterization of H-monotone operators with applications to variational
inclusions. Comput. Math. Appl. 2005, 50, 329–337.
36. Ceng, L.-C.; Ansari, Q.-H.; Wong, M.-M.; Yao, J.-C. Mann type hybrid extragradient method for variational
inequalities, variational inclusions and fixed point problems. Fixed Point Theory 2012, 13, 403–422.
37. Ceng, L.-C.; Guu, S.-M.; Yao, J.-C. Iterative algorithm for finding approximate solutions of mixed
quasi-variational-like inclusions. Comput. Math. Appl. 2008, 56, 942–952.
38. Jung, J.-S. A general composite iterative method for strictly pseudocontractive mappings in Hilbert spaces.
Fixed Point Theory Appl. 2014, 2014, 173.
39. 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.
40. Shioji, N.; Takahashi, W. Strong convergence of approximated sequences for nonexpansive mappings in
Banach spaces. Proc. Am. Math. Soc. 1997, 125, 3641–3645.
41. Byrne, C. A unified treatment of some iterative algorithms in signal processing and image reconstruction.
Inverse Probl. 2004, 20, 103–120.
42. Xu, H.-K.; Kim, T.-H. Convergence of hybrid steepest-descent methods for variational inequalities. J. Optim.
Theory Appl. 2003, 119, 185–201.
43. Barbu, V. Nonlinear Semigroups and Differential Equations in Banach Spaces; Springer:
Heidelberg, Germany, 1976.
44. Marino, G.; Xu, H.-K. A general iterative method for nonexpansive mappings in Hilbert spaces. J. Math.
Anal. Appl. 2006, 318, 43–56.
45. Marino, G.; Xu, H.-K. Weak and strong convergence theorems for strict pseudo-contractions in Hilbert
spaces. J. Math. Math. Appl. 2007, 329, 336–346.
46. Xu, H.-K. Iterative algorithms for nonlinear operators. J. Lond. Math. Soc. 2002, 66, 240–256.

c 2019 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access
article distributed under the terms and conditions of the Creative Commons Attribution
(CC BY) license (http://creativecommons.org/licenses/by/4.0/).