Hindawi

Abstract and Applied Analysis

Volume 2020, Article ID 7151953, 10 pages
https://doi.org/10.1155/2020/7151953

Research Article
A Cyclic Method for Solutions of a Class of Split Variational
Inequality Problem in Banach Space

Bashir Ali ,1 Aisha A. Adam,2 and Yusuf Ibrahim 1,3

1
Bayero University, Department of Mathematical Sciences, Kano, Nigeria
2
African University of Science and Technology, Department of Mathematical Sciences, Abuja, Nigeria
3
Department of Mathematics, Sa’adatu Rimi College of Education, Kumbotso, Kano, Nigeria

Correspondence should be addressed to Bashir Ali; bashiralik@yahoo.com

Received 15 January 2020; Revised 26 February 2020; Accepted 10 March 2020; Published 10 April 2020

Academic Editor: Micah Osilike

Copyright © 2020 Bashir Ali et al. This is an open access article distributed under the Creative Commons Attribution License,
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
In this paper, a cyclic algorithm for approximating a class of split variational inequality problem is introduced and studied in some
Banach spaces. A strong convergence theorem is proved. Some applications of the theorem are presented. The results presented
here improve, unify, and generalize certain recent results in the literature.

1. Introduction
〈x − y, Tx − Ty〉 ≥ α‖Tx − Ty‖2 , for any x, y ∈ C.
Let C be a nonempty closed and convex subset of a real
Banach space E, with dual E∗ . Then, a mapping T : C ⟶ E (3)
is said to be
(3) Strongly monotone if
(1) Nonexpansive if ‖Tx − Ty‖ ≤‖x − y‖ for any x, y ∈ C.

(2) Demiclosed at zero if whenever a sequence 􏼈vn 􏼉 in C

converges weakly to u and 􏼈vn − Tvn 􏼉 converges 〈x − y, Tx − Ty〉 ≥ α‖x − y‖2 , for any x, y ∈ C. (4)
strongly to 0, then u ∈ F(T).
Problem of the type finding u ∈ C such that
(3) L-Lipschitz continuous on E if there exists L > 0 such 〈v − u, Tu〉 ≥ 0, for all v ∈ C, (5)
that
is called a variational inequality problem, and the set of
solution of such problem is denoted by VI(C, T).
‖Tx − Ty‖ ≤ L‖x − y‖, for all x, y ∈ C. (1) Variational inequality problems have played a crucial
role in the study of several problems arising in physics, fi-
A mapping T : C ⟶ E∗ is said to be nance, economics, network analysis, optimization, medical
image and structural analysis, and so on (see, for example,
(1) Monotone if [1–5]). Variational inequality problems were formulated in
the late 1960’s by Lions and Stampacchia [6]. Since then,
various iterative algorithms for approximating solutions of
〈x − y, Tx − Ty〉 ≥ 0, for all x, y ∈ C. (2)
such problems have been proposed by numerous researchers
(see, for example, [7–12, 27]) and the references therein.
(2) α-inverse strongly monotone if In 1976, Korpelevch [14] introduced the following
extragradient method for solving the variational inequality
2 Abstract and Applied Analysis
problem when the operator T is monotone and L-Lipschitz
continuous in a finite dimensional Euclidean space Rn ,
xn+1 � PC xn − λf PC xn − λTxn 􏼁􏼁􏼁, (6)
for each n ∈ N, λ ∈ (0, (1/L)).
The split feasibility problem in the finite dimensional
Hilbert space was first introduced by Censor and Elfving [15]
for modeling inverse problems which arise from phase re-
trievals and in medical image reconstruction.
Let H1 and H2 be two real Hilbert spaces. Let C and Q be
two nonempty closed convex subset of H1 and H2 , re-
spectively. The split feasibility problem is to find
u ∈ C such that Au ∈ Q. (7)
Assuming that the split feasibility problem is consistent
(i.e., (7) has a solution), it is easy to see that x ∈ C solves (7) if
and only if it solves the fixed point equation:
x � PC 􏼐I + cA∗ 􏼐PQ − I􏼑A􏼑x, x ∈ C, (8)
where PC and PQ are the orthogonal projections onto C and
Q, respectively, c > 0, and A∗ is the adjoint of A. To solve (8),
Byrne [16] proposed the CQ algorithm which generates a
sequence 􏼈xn 􏼉 by
xn+1 � PC 􏼐I + cA∗ 􏼐PQ − I􏼑A􏼑xn , (9)
for each n ∈ N, where c ∈ (0, (2/λ)), λ being the spectral
radius of the operator A∗ A.
In 2010, Censor et al. [17] considered a new variational
problem called split variational inequality problem (SVIP). It
entails finding a solution of one variational inequality
problem whose image under a bounded linear transfor-
mation is a solution of another variational inequality
problem. The SVIP is formulated as
find u ∈ VI(C, f) such that Au ∈ VI(Q, g), (10)
where C and Q are the nonempty closed convex subsets of real
Hilbert spaces H1 and H2 , respectively, and A: H1 ⟶ H2 is
a bounded linear operator. They constructed the following
iterative algorithm to solve such problem and proved a strong
convergence theorem in a Hilbert space:
∗
xn+1 � PC (I − λf)􏼐xn + cA 􏼐PQ (I − λg) − I􏼑Axn 􏼑, n ∈ N,
(11)
where c ∈ (0, (1/L)), L is the spectral radius of the operator
A∗ A, and A∗ is the adjoint of A.
One can easily observe that split variational inequality
has the split feasibility problem as a special case.
Recently, Tian and Jiang [12], based on the work of
Censor et al. [17], considered a class of SVIP which is to find
x ∈ VI(C, f) such that Ax ∈ F(T), (12)
where C is a nonempty closed convex subset of a real Hilbert
space H1 , f : C ⟶ H1 is a monotone and k-Lipschitz
continuous map, A : H1 ⟶ H2 is a bounded linear map,
and T : H2 ⟶ H2 is a nonexpansive map. They proposed
the following algorithm by combining the Korpelevich
extragradient method and Byrne CQ algorithm:
⎪
⎧ x1 � x ∈ C;
⎪
⎪
⎪
⎪
⎨ yn � PC xn − cn A∗ (I − T)Axn 􏼁;
⎪ (13)
⎪ tn � PC yn − λn fyn 􏼁;
⎪
⎪
⎪
⎩
xn+1 � PC yn − λn ftn 􏼁.
They obtained the following result.
Theorem 1 (see [12]). Let H1 and H2 be real Hilbert spaces.
Let C be a nonempty, closed and convex subset of H1 ,
A : H1 ⟶ H2 be a bounded linear operator such that A ≠ 0,
f : C ⟶ H1 be a monotone and k-Lipschitz continuous
map, and T : H2 ⟶ H2 be a nonexpansive map. Setting
Γ � 􏼈z ∈ VI(C, f) : Az ∈ F(T)􏼉, assume that Γ ≠ ∅. Let the
sequence 􏼈xn 􏼉 be generated by (13), where 􏼈cn 􏼉 ⊂ [a, b],
a, b ∈ (0, (1/‖A‖2 )), and λn ∈ (0, (1/k)). Then, the sequence
􏼈xn 􏼉 converges weakly to a point z ∈ Γ.
Remark 1. Inspired by the results of Tian and Jiang [12], the
authors raised the following motivational questions:
Q1. Can the result of Tian and Jiang hold in a more
general setting of Banach space than Hilbert?
Q2. Can the result also be proved for a common fixed
point of finite family of nonexpansive mapping?
Q3. Can strong convergence theorem be proved?
In this paper, the above questions are answered in affir-
mative. We study a cyclic algorithm in the setting of uni-
formly smooth which is also 2-uniformly convex real Banach
space and 2-uniformly smooth real Banach space and prove
its strong convergence to a solution of a variational in-
equality problem for a monotone K-Lipschitz continuous
map whose image under a bounded linear operator is a
common fixed point of a finite family of nonexpansive maps.
Our theorems improve and extend the results of Tian and
Jiang [12].
2. Preliminaries
The duality map of a Banach space E has the following
properties:
(1) If E is a reflexive, strictly convex, and smooth real
Banach space, then J is single-valued and bijective. In
this case, the inverse J− 1 : E∗ ⟶ E is given by
J− 1 � J∗ with J∗ being the duality mapping of E∗ .
(2) In a Hilbert space H, the duality map J and its in-
verse J− 1 are the identity maps on H.
(3) If E is uniformly smooth and uniformly convex, then
the dual space E∗ is also uniformly smooth and
uniformly convex and the normalized duality map J
and its inverse, J− 1 , are both uniformly continuous
on bounded sets.
Let E be a smooth real Banach space and ϕ : E × E ⟶ R
be defined by
ϕ(x, y) � ‖x‖2 − 2〈x, Jy〉 +‖y‖2 , ∀x, y ∈ E. (14)
Abstract and Applied Analysis 3

It is easy to see from the definition of ϕ that, in a real
Hilbert space H, equation (14) reduces to
ϕ(x, y) � ‖x − y‖2 , ∀x, y ∈ H.
Furthermore, given x, y, z ∈ E and τ ∈ (0, 1), we have
the following properties (see, for example, [18]):
P1: (‖x‖ − ‖y‖)2 ≤ ϕ(x, y) ≤ (‖x‖ + ‖y‖)2 ,
P2: ϕ(x, y) � ϕ(x, z) + ϕ(z, y) + 2〈z − x, Jy − Jz〉,
P3: ϕ(τx + (1 − τ)y, z) ≤ τϕ(x, z) + (1 − τ)ϕ(y, z).
NC (u) � 􏼈w∗ ∈ E∗ : 〈u − z, w∗ 〉 ≥ 0, ∀z ∈ C􏼉. (18)
Then, B is maximal monotone and B− 1 0 � VI(C, f).
Lemma 5 (see [23]). Let E be a uniformly convex and smooth
real Banach space, and let 􏼈xn 􏼉 and 􏼈yn 􏼉 be two sequences of
E. If either 􏼈xn 􏼉 or 􏼈yn 􏼉 is bounded and
limn⟶∞ ϕ(xn , yn ) � 0, then limn⟶∞ ‖xn − yn ‖ � 0.

3. Main Results
Definition 1. Let E be a smooth, strictly convex, and re-
flexive real Banach space and let C be a nonempty, closed, Theorem 2. Let E1 be a uniformly smooth and 2-uniformly
and convex subset of E. The map ΠC : E ⟶ C defined by convex real Banach space and E2 a 2-uniformly smooth real
􏽥 � ΠC (x) ∈ C such that ϕ(􏽥
x x, x) � inf y∈C ϕ(y, x) is called Banach space with smoothness constant d2 ∈ (0, 1). Let C be a
the generalized projection of E onto C. Clearly, in a real nonempty, closed, and convex subset of E1 . Let f : C ⟶ E∗1
Hilbert space H, the generalized projection ΠC coincides be a monotone and k-Lipschitz continuous map, and
with the metric projection PC from H onto C. A : E1 ⟶ E2 be a bounded linear operator with its adjoint
A∗ such that A ≠ 0. Let Ti : E2 ⟶ E2 , i � 1, 2, . . . , m be
Definition 2. Let E1 and E2 be two reflexive, strictly convex, nonexpansive mappings. Setting Γ � 􏼈z ∈ VI(C, f) : Az ∈
and smooth Banach spaces. The collection of mappings ∩m
i�1 F(Ti )} and assuming Γ ≠∅. Let a sequence 􏼈xn 􏼉 be
A : E1 ⟶ E2 is linear, and continuous is a normed linear generated by
space with norm defined by ‖A‖ � sup‖x‖≤1 ‖Ax‖. The dual
⎪
⎧ x1 � x ∈ C � C1 ,
operator A∗ :E∗2 ⟶E∗1 defined by 〈A∗ y∗ ,x〉�〈y∗ ,Ax〉∀x∈ ⎪
⎪
⎪
⎪ − 1 ∗
E1 , y∗ ∈E∗2 is called the adjoint operator of A. The adjoint ⎪ yn � J 􏼐Jxn − cA J2 􏼐I − T[n] 􏼑Axn 􏼑, where [n] � n mod m,
⎪
⎪
⎪
⎪
operator A∗ has the property ‖A∗ ‖�‖A‖. ⎪
⎨ tn � ΠC J− 1 Jyn − λfyn 􏼁,
⎪ z � Π J− 1 Jy − λft 􏼁,
⎪
⎪
⎪ n C n n
Lemma 1 (see [19]). Let C be a nonempty closed and convex ⎪
⎪
⎪
⎪ ∈ ϕ
subset of a smooth, strictly convex, and reflexive real Banach ⎪
⎪
C n+1 � 􏼈 v C n : v, zn 􏼁 ≤ ϕ v, yn 􏼁 ≤ ϕ v, xn 􏼁,􏼉,
⎪
⎩
space E. Then, xn+1 � ΠCn+1 x1 ,

(1) If x ∈ E, then x 􏽥 � Π C x if and only if (19)

〈􏽥x − y, Jx − J􏽥x〉 ≥ 0, for all y ∈ C, where c ∈ [a, b], a, b ∈ (0, (1/d∗2 ‖A‖2 )), d∗2 being the
(2) ϕ(y, x􏽥 ) + ϕ(􏽥
x, x) ≤ ϕ(y, x), for all x ∈ E, y ∈ C. smoothness constant of E∗1 as in Lemma 2, and λ ∈ (0, (α/k)),
α being a positive constant as in Lemma 3. Then, the sequence
􏼈xn 􏼉 converges to a point z ∈ Γ.
Lemma 2 (see [20]). Let E be q-uniformly smooth Banach
space. Then, there exists a constant dq > 0 such that
‖x + y‖q ≤ ‖x‖q + q〈y, jx〉 + dq ‖y‖q . (15)
Proof. We divide the proof into five steps. □

Step 1. We show that Cn is closed and convex for any n ≥ 1.

Lemma 3 (see [21]). Let E be a 2-uniformly convex and Since C � C1 , C1 is closed and convex.
smooth real Banach space. Then, there exists a positive Assume Cn is closed and convex for some n ≥ 1. Since for
constant α such that any v ∈ Cn ,
�� ��2 �� ��2
α‖x − y‖2 ≤ ϕ(x, y), ∀ x, y ∈ E. (16) ϕ v, yn 􏼁 ≤ ϕ v, xn 􏼁 ⟺ 2〈v, Jxn − Jyn 〉 ≤ ��xn �� − ��yn �� ,
�� ��2 �� ��2
ϕ v, zn 􏼁 ≤ ϕ v, yn 􏼁 ⟺ 2〈v, Jyn − Jzn 〉 ≤ ��yn �� − ��zn �� ,
Lemma 4 (see [22]). Let C be a nonempty closed and convex (20)
subset of a reflexive space E and f, a monotone, and hem-
icontinuous map of C into E∗ . Let B ⊂ E × E∗ be an operator we have that Cn+1 is closed and convex. Therefore, Cn is
defined by closed and convex for any n ≥ 1.
fu + NC (u), if u ∈ C,
Bu � 􏼨 (17) Step 2. We prove Γ ⊂ Cn for any n ≥ 1.
∅, if u ∉ C,
For n � 1, Γ ⊂ C � C1 .
where NC (u) is defined as Assume Γ ⊂ Cn for some n ≥ 1. Let u ∈ Γ, then
4 Abstract and Applied Analysis

ϕ u, yn 􏼁 � ϕ􏼐u, J− 1 􏼐Jxn − cA∗ J2 􏼐I − T[n] 􏼑Axn 􏼑􏼑

�� ��2
� ‖u‖2 + ���J− 1 􏼐Jxn + cA∗ J2 􏼐T[n] − I􏼑Axn 􏼑��� − 2〈u, Jxn + cA∗ J2 􏼐T[n] − I􏼑Axn 〉 (21)
�� ��2
� ‖u‖2 + ���Jxn + cA∗ J2 􏼐T[n] − I􏼑Axn ��� − 2〈u, Jxn 〉 − 2c〈Au, J2 􏼐T[n] − I􏼑Axn 〉.

From the fact that E∗1 is 2-uniformly smooth, we have

�� ��2
ϕ u, yn 􏼁 ≤ ‖u‖2 + ��Jxn �� + 2c〈xn , A∗ J2 􏼐T[n] − I􏼑Axn 〉
�� ��2
+ d∗2 c2 ‖A‖2 ���􏼐T[n] − I􏼑Axn ��� − 2〈u, Jxn 〉 − 2c〈Au, J2 􏼐T[n] − I􏼑Axn 〉
�� ��2
� ϕ u, xn 􏼁 + d∗2 c2 ‖A‖2 ���􏼐T[n] − I􏼑Axn ��� + 2c〈Axn − Au, J2 􏼐T[n] − I􏼑Axn 〉
�� ��2
� ϕ u, xn 􏼁 + d∗2 c2 ‖A‖2 ���􏼐T[n] − I􏼑Axn ��� (22)

+ 2c〈Axn − T[n] Axn + T[n] Axn − Au, J2 􏼐T[n] − I􏼑Axn 〉

�� ��2 �� ��2
� ϕ u, xn 􏼁 + d∗2 c2 ‖A‖2 ���􏼐T[n] − I􏼑Axn ��� − 2c���􏼐T[n] − I􏼑Axn ���
+ 2c〈T[n] Axn − Au, J2 􏼐T[n] − I􏼑Axn 〉.

Using the fact that E2 is 2-uniformly smooth and T[n] By the fact that u ∈ VI(C, f) and using property P2, we
being nonexpansive, we have have
2〈T[n] Axn − Au, J2 􏼐T[n] − I􏼑Axn 〉 ϕ u, zn 􏼁 ≤ ϕ u, yn 􏼁 − ϕ zn , yn 􏼁 + 2λ〈tn − zn , ftn 〉
�� ��2 �� ��2 � ϕ u, yn 􏼁 − ϕ zn , tn 􏼁 − ϕ tn , yn 􏼁 (26)
≤ d2 ��T[n] Axn − Au�� + ��T[n] Axn − Axn ��
�� ��2 (23) + 2〈zn − tn , Jyn − λftn − Jtn 〉.
− ���􏼐T[n] Axn − Au􏼑 − 􏼐T[n] Axn − Axn 􏼑���
�� ��2 �� ��2 Also from the fact that tn � ΠC J− 1 (Jyn − λfyn ), zn ∈ C,
≤ d2 − 1􏼁��Axn − Au�� + ���􏼐T[n] − I􏼑Axn ��� . the Lipschitz continuity of f, Lemma 1, and Lemma 3, we
obtain that
From (22) and (23), we get
�� ��2 〈zn − tn , Jyn − λftn − Jtn 〉 � 〈zn − tn , Jyn − λfyn − Jtn 〉
ϕ u, yn 􏼁 ≤ ϕ u, xn 􏼁 + c2 d∗2 ‖A‖2 ���􏼐T[n] − I􏼑Axn ���
+ λ〈zn − tn , fyn − ftn 〉
�� ��2 �� ��2
− 2c���􏼐T[n] − I􏼑Axn ��� + c d2 − 1􏼁��Axn − Au��
≤ λ〈zn − tn , fyn − ftn 〉
�� ��2
+ c���􏼐T[n] − I􏼑Axn ��� �� ���� ��
≤ kλ��zn − tn ����yn − tn ��
�� ��2
≤ ϕ u, xn 􏼁 − c􏼐1 − d∗2 c‖A‖2 􏼑���􏼐T[n] − I􏼑Axn ��� (24)
kλ ��� ��2 �� ��2
�� ��2 ≤ 􏼒�zn − tn �� + ��yn − tn �� 􏼓
2
− c 1 − d2 􏼁��Axn − Au��
�� ��2 kλ
≤ ϕ u, xn 􏼁 − c􏼐1 − d∗2 c‖A‖2 􏼑���􏼐T[n] − I􏼑Axn ��� ≤
2α
ϕ zn , tn 􏼁 + ϕ tn , yn 􏼁􏼁.

≤ ϕ u, xn 􏼁. (27)

Also by Lemma 1, we have Thus,

ϕ u, zn 􏼁 ≤ ϕ􏼐u, J− 1 􏼂Jyn − λftn 􏼃􏼑 − ϕ􏼐zn , J− 1 􏼂Jyn − λftn 􏼃􏼑 ϕ u, zn 􏼁 ≤ ϕ u, yn 􏼁 − ϕ tn , yn 􏼁 − ϕ zn , tn 􏼁

�� ��2
� ‖u‖2 − 2〈u, Jyn − λftn 〉 − ��zn �� + 2〈zn , Jyn − λftn 〉 kλ
+ ϕ zn , tn 􏼁 + ϕ tn , yn 􏼁􏼁
� ϕ u, yn 􏼁 − ϕ zn , yn 􏼁 + 2〈u − zn , λftn 〉 α (28)
� ϕ u, yn 􏼁 − ϕ zn , yn 􏼁 + 2λ〈u − tn , ftn 〉 + 2λ〈tn − zn , ftn 〉. kλ
� ϕ u, yn 􏼁 − 􏼠1 − 􏼡 ϕ tn , yn 􏼁 + ϕ zn , tn 􏼁􏼁
(25) α
Abstract and Applied Analysis 5

≤ ϕ u, yn 􏼁. (29) From (24) and (28),

1
Hence, Γ ⊂ Cn for any n ≥ 1. ϕ tn , yn 􏼁 ≤ ϕ u, xn 􏼁 − ϕ u, zn 􏼁􏼁, (36)
(1 − (kλ/α))

Step 3. We shall show that 􏼈xn 􏼉 is a Cauchy sequence. 1

Since Γ ⊂ Cn+1 ⊂ Cn and xn+1 � ΠCn+1 x1 ⊂ Cn , then by ϕ zn , t n 􏼁 ≤ ϕ u, xn 􏼁 − ϕ u, zn 􏼁􏼁, (37)
(1 − (kλ/α))
Lemma 1, we have that ϕ(xn+1 , x1 ) ≤ ϕ(u, x1 ) and also
ϕ(xn , x1 ) ≤ ϕ(xn+1 , x1 ). Hence, ϕ(xn , x1 ) is nondecreasing. (35) and (36), respectively, implies that
So, limn⟶∞ ϕ(xn , x1 ) exists. By property P1, 􏼈xn 􏼉 is
bounded. Also, it follows from (24), (28), and the fact that A lim ϕ tn , yn 􏼁 � 0,
n⟶∞
is a bounded linear operator that 􏼈yn 􏼉, 􏼈zn 􏼉, and 􏼈Axn 􏼉 are (38)
lim ϕ zn , tn 􏼁 � 0.
bounded. n⟶∞
From Lemma 1, we have that
Since 􏼈zn 􏼉 and 􏼈yn 􏼉 are bounded, by Lemma 5, we get
ϕ(xm , xn ) � ϕ(xm , ΠCn x1 ) ≤ ϕ(xm , x1 ) − ϕ(xn , x1 ) ⟶ �� ��
0 as n, m ⟶ ∞. Hence, 􏼈xn 􏼉 is a Cauchy sequence. lim ��tn − yn �� � 0, (39)
n⟶∞

�� ��
Step 4. We show that lim ��zn − tn �� � 0. (40)
�� �� �� �� �� �� n⟶∞
lim ��xn − yn �� � lim ���􏼐T[n] − I􏼑Axn ��� � lim ��zn − tn ��
n⟶∞ n⟶∞ n⟶∞ Thus, (39) and (40) imply
�� �� �� ��
� lim ��zn − yn �� � 0. lim ��zn − yn �� � 0.
n⟶∞
n⟶∞
(41)
(30)
Since xn+1 ∈ Cn+1 ⊂ Cn ,
Step 5. We show that 􏼈xn 􏼉 converges to an element of Γ
ϕ xn , yn 􏼁 � ϕ xn , xn+1 􏼁 + ϕ xn+1 , yn 􏼁 + 2〈xn+1 − xn , Jyn − Jxn+1 〉
Since 􏼈xn 􏼉 is a Cauchy sequence, we may assume that
≤ ϕ xn , xn+1 􏼁 + ϕ xn+1 , xn 􏼁 + 2〈xn+1 − xn , Jyn − Jxn+1 〉 xn ⟶ x∗ .
From the fact that limn⟶∞ ‖xn − yn ‖ � limn⟶∞ ‖xn −
� 2〈xn − xn+1 , Jxn − Jxn+1 〉 − 2〈xn − xn+1 , Jyn − Jxn+1 〉.
zn ‖ � limn⟶∞ ‖tn − yn ‖ � 0, we obtain that yn ⟶ x∗ ,
(31) zn ⟶ x∗ , and tn ⟶ x∗ . Since A is a bounded linear
Taking limit as n ⟶ ∞, we have limn⟶∞ ϕ(xn , yn ) � 0. operator, we have that Axn ⟶ Ax∗ .
Similarly, From (35), we have
�� ��
ϕ xn , zn 􏼁 ≤ 2〈xn − xn+1 , Jxn − Jxn+1 〉 − 2〈xn − xn+1 , Jzn − Jxn+1 〉. lim ���􏼐T[n] − I􏼑Axn ��� � 0. (42)
n⟶∞
(32)
Thus, for i ∈ {1, 2, 3, . . . , m}, limn⟶∞ ‖(Ti − I)Axn ‖ � 0.
Taking limit as n ⟶ ∞, we have limn⟶∞ ϕ(xn , zn ) � 0. Since Ti is nonexpansive for each i ∈ {1, 2, 3, . . . , m}, we
Since 􏼈xn 􏼉 is bounded, it follows from Lemma 5 that have that I − Ti is demiclosed at 0 for i ∈ {1, 2, 3, . . . , m}.
limn⟶∞ ‖xn − yn ‖ � 0 and limn⟶∞ ‖xn − zn ‖ � 0. And therefore, Ax∗ ∈ F(Ti )for each i ∈ {1, 2, 3, . . . , m}.
Now, Thus, Ax∗ ∈ ∩m i�1 F(Ti ). Next, we show that
�� ��2 �� ��2 x∗ ∈ VI(C, f)
ϕ u, xn 􏼁 − ϕ u, yn 􏼁 � ��xn �� − ��yn �� − 2〈u, Jxn − Jyn 〉 Define
�� �� �� �� �� �� �� ��
� 􏼐��xn �� − ��yn ��􏼑􏼐��xn �� + ��yn ��􏼑 + 2〈u, Jxn − Jyn 〉 fv + NC (v), if v ∈ C,
�� �� �� �� �� �� Bv � 􏼨 (43)
≤ ��xn − yn ��􏼐��xn �� + ��yn ��􏼑 + 2〈u, Jxn − Jyn 〉. ∅, if v ∉ C.
(33) By Lemma 4, B is a maximal monotone and 0 ∈ Bv if and
Taking limit as n ⟶ ∞, we have limn⟶∞ (ϕ(u, xn )− only if v ∈ VI(C, f).
ϕ(u, yn )) � 0. Let (v, w) ∈ G(B). (v, w) ∈ G(B) ⟹ w ∈ Bv � fv +
In a similar way, we also have limn⟶∞ (ϕ(u, xn )− NC (v) ⟹ w − fv ∈ NC (v).
ϕ(u, zn )) � 0. Thus, 〈v − p, w − fv〉 ≥ 0, ∀ p ∈ C. Since
From (24), we obtain zn � ΠC J− 1 (Jyn − λftn ) and v ∈ C, we have by Lemma 4
�� ��2 that 〈zn − v, Jyn − λftn − Jzn 〉 ≥ 0.
0 <􏼐c − d∗2 c2 ‖A‖2 􏼑���􏼐T[n] − I􏼑Axn ��� ≤ ϕ u, xn 􏼁 − ϕ u, yn 􏼁. Thus,
(34)
Jzn − Jyn
􏼪v − zn , + ftn 􏼫 ≥ 0, n≥0. (44)
Thus, λ
�� ��2
lim ���􏼐T[n] − I􏼑Axn ��� � 0. (35) Using the fact that zn ∈ C and w − fv ∈ NC (v), we have
n⟶∞
6 Abstract and Applied Analysis

〈v − zn , w〉 ≥ 〈v − zn , fv〉 ⎪
⎧ x1 � x ∈ C � C 1 ,
⎪
⎪
⎪
⎪ yn � xn − cA∗ 􏼐I − T[n] 􏼑Axn , where [n] � n mod m,
⎪
⎪
Jzn − Jyn ⎪
⎪
≥ 〈v − zn , fv〉 − 〈v − zn , + ftn 〉 ⎪
⎪
λ ⎨ tn � PC yn − λfyn 􏼁,
⎪ z � P y − λft 􏼁,
⎪
� 〈v − zn , fv − fzn 〉 +〈v − zn , fzn − ftn 〉 ⎪
⎪ n C n n
(45) ⎪
⎪ �� �� �� �� �� �� �� ��
⎪
⎪ Cn+1 � 􏽮v ∈ Cn : �yn − v�� ≤ ��xn − v��, ��zn − v�� ≤ ��yn − v��􏽯,
�
⎪
⎪
Jzn − Jyn ⎪
⎩
− 〈v − zn , 〉 xn+1 � PCn+1 x1 ,
λ
(48)
Jz − Jyn
≥ 〈v − zn , fzn − ftn 〉 − 〈v − zn , n 〉. where c ⊂ [a, b], a, b ∈ (0, (1/‖A‖2 )), and λ ∈ (0, (1/k)).
λ
Then, the sequence 􏼈xn 􏼉 converges strongly to a point z ∈ Γ.
Using the fact that J is uniformly continuous on
bounded sets and f is Lipschitz continuous, as n ⟶ ∞, we
have Proof. Setting E1 � H1 and E2 � H2 in Theorem 2, the result
∗ is as follows. □
〈v − x , w〉 ≥ 0. (46)

Since B is a maximal monotone, 0 ∈ Bx∗ , and hence Remark 2. Corollary 2 complements Theorem 1 (the result
x ∈ VI(C, f), therefore x∗ ∈ Γ.
∗
of Tian and Jiang [12]) in the sense that strong convergence
of the sequence generated is obtained to a solution of the
split variational inequality problem involving common fixed
Corollary 1. Let E1 be a uniformly smooth and 2-uniformly
points of finite family of nonexpansive mappings, while
convex real Banach space and E2 a 2-uniformly smooth real
weak convergence of the scheme is obtained in Theorem 1
Banach space with smoothness constant d2 ∈ (0, 1). Let C be a
involving only a single nonexpansive map. Though, addi-
nonempty, closed, and convex subset of E1 . Let f : C ⟶ E∗1
tional condition of projecting the iterates on the half spaces
be a monotone and k-Lipschitz continuous map and
Cn at each step is imposed.
A : E1 ⟶ E2 be a bounded linear operator with its adjoint
A∗ such that A ≠ 0. Let T : E2 ⟶ E2 be a nonexpansive
map. Let Γ � 􏼈z ∈ VI(C, f) : Az ∈ F(T)􏼉 ≠ ∅. Let a se- Lemma 6. Let H be a real Hilbert space and Q be a nonempty
quence 􏼈xn 􏼉 be generated by closed convex subset of H. Let g : Q ⟶ H be an α- inverse
⎪
⎧ x1 � x ∈ C � C1 , strongly monotone mapping, that is,
⎪
⎪ 〈x − y, gx − gy〉 ≥ α‖gx − gy‖2 for any x, y ∈ Q. Let
⎪
⎪
⎪
⎪ yn � J− 1 Jxn − cA∗ J2 (I − T)Axn 􏼁, μ ∈ (0, 2α). Then, the mapping PQ (I − μg) is nonexpansive.
⎪
⎪
⎪
⎪
⎨ tn � ΠC J− 1 Jyn − λfyn 􏼁,
⎪ z � Π J− 1 Jy − λft 􏼁,
⎪
⎪
⎪ n C n n Proof. Letx, y ∈ H:
⎪
⎪
⎪
⎪ Cn+1 � 􏼈v ∈ Cn : ϕ v, yn 􏼁 ≤ ϕ v, xn 􏼁, ϕ v, zn 􏼁 ≤ ϕ v, yn 􏼁􏼉, �� �
⎪
⎪
⎪ ��PQ (x − μgx) − PQ (y − μgy)���2 ≤ ‖(x − μgx) − (y − μgy)‖2
⎩x �Π x ,
n+1 Cn+1 1
(47) � ‖x − y‖2 − 2μ〈x − y, gx − gy〉 + μ2 ‖gx − gy‖2 ≤ ‖x − y‖2

where c ∈ [a, b], a, b ∈ (0, (1/d∗2 ‖A‖2 )), d∗2 being the μ
smoothness constant of E∗1 as in Lemma 2, and λ ∈ (0, (α/k)), − μ􏼒2 − 􏼓〈x − y, gx − gy〉
α
α being a positive constant as in Lemma 3. Then, the sequence
􏼈xn 􏼉 converges to a point z ∈ Γ. ≤ ‖x − y‖2 .
(49)
Proof. The result followed from Theorem 2 by setting
Hence, PQ (I − μg) is nonexpansive. □
T[n] � T, ∀n ∈ N. □

Corollary 2. Let H1 and H2 be real Hilbert spaces. Let C be a
nonempty, closed, and convex subset of H1 . A : H1 ⟶ H2
be a bounded linear operator such that A ≠ 0, f : C ⟶ H1
be a monotone and k-Lipschitz continuous map, and
Ti : H2 ⟶ H2 , i � 1, 2, . . . , m, be a nonexpansive map. Let
Γ � 􏼈z ∈ VI(C, f): Az ∈ F(T)􏼉 ≠ ∅. Let a sequence 􏼈xn 􏼉 be
generated by
Corollary 3. Let H1 and H2 be real Hilbert spaces. Let C and
Q be two nonempty, closed, and convex subset of H1 and H2 ,
respectively. Let A : H1 ⟶ H2 be a bounded linear operator
such that A ≠ 0, f : C ⟶ H1 be a monotone and k-Lipschitz
continuous map, and g: H2 ⟶ H2 be an inverse strongly
monotone mapping. Setting Γ � 􏼈z ∈ VI(C, f) : Az ∈
VI(Q, g)} ≠ ∅. Let a sequence 􏼈xn 􏼉 be defined by
Abstract and Applied Analysis 7

⎪
⎧ yn � xn − cA∗􏼐I − PQ (I − μg)􏼑Axn 􏼑, (1) Tr is single valued;
⎪
⎪
⎪
⎪ (2) Tr is a firmly nonexpansive type, i.e.,
⎪
⎪ tn � PC yn − λfyn 􏼁,
⎪
⎪
⎨
⎪ zn � PC yn − λftn 􏼁,
⎪
⎪ �� �� �� �� �� �� �� �� 〈Tr x − Tr y, JTr x − JTr y〉 ≤ 〈Tr x − Tr y, x − y〉, ∀x, y ∈ E;
⎪
⎪
⎪
⎪ Cn+1 � 􏽮v ∈ Cn : ��yn − v�� ≤ ��xn − v��, ��zn − v�� ≤ ��yn − v��􏽯,
⎪
⎪ (54)
⎩x �P x ,
n+1 Cn+1 1
(50) (3) F(Tr ) � EP(F);
where c ⊂ [a, b], a, b ∈ (0, (1/‖A‖2 )), λ ∈ (0(1/k)), and (4) EP(F) is closed and convex.
μ ∈ (0, 2α) . Then, the sequence 􏼈xn 􏼉 converges to a point
z ∈ Γ. Theorem 3. Let E1 be a uniformly smooth and 2-uniformly
convex real Banach space and E2 a 2-uniformly smooth real
Proof. Since PQ (I − μg) is nonexpansive for μ ∈ (0, 2α) and Banach space with smoothness constant d2 ∈ (0, 1). Let C and
z ∈ VI(Q, g) if and only if z � PQ (I − μg)z for μ > 0, putting Q be two nonempty, closed, and convex subsets of E1 and E2 ,
T � PQ (I − μg) in Corollary 1, we get the desired result. □ respectively. Let A : E1 ⟶ E2 be a bounded linear operator
with its adjoint A∗ such that A ≠ 0, f : C ⟶ E∗1 be a
4. Application to Equilibrium Problem monotone and k-Lipschitz continuous map, and
F : Q × Q ⟶ be a bifunction satisfying conditions
Let C be a nonempty closed convex subset of a real Banach (A1)–(A4). Let Γ � 􏼈z ∈ VI(C, f) : Az ∈ EP(F)􏼉 ≠ ∅. Let a
space E and let F: C × C ⟶ R be a bifunction. sequence 􏼈xn 􏼉 be generated by
The equilibrium problem with respect to F and C is to ⎧
⎪ x1 � x ∈ C � C 1 ,
find z ∈ C such that ⎪
⎪
⎪
⎪ − 1 ∗
⎪
⎪ yn � J Jxn − cA J2 I − Tr 􏼁Axn 􏼁,
F(z, y) ≥ 0, ∀y ∈ C. (51) ⎪
⎪
⎪
⎪
⎨ tn � ΠC J− 1 Jyn − λfyn 􏼁,
The set of solutions of the equilibrium problem men- ⎪
⎪ zn � ΠC J− 1 Jyn − λftn 􏼁,
⎪
⎪
tioned above is denoted by EP(F). For solving the equi- ⎪
⎪
⎪
⎪ Cn+1 � 􏼈v ∈ Cn : ϕ v, yn 􏼁 ≤ ϕ v, xn 􏼁, ϕ v, zn 􏼁 ≤ ϕ v, yn 􏼁􏼉,
librium problem, we assume that F satisfies the following ⎪
⎪
⎪
⎩x �Π x ,
conditions: n+1 Cn+1 1
(A1) F(x, x) � 0 for all x ∈ C; (55)
(A2) F is monotone, i.e., F(x, y) + F(y, x) ≤ 0 ∀x,
where c ∈ [a, b], a, b ∈ (0, (1/d∗2 ‖A‖2 )), d∗2 is the smoothness
y ∈ C;
constant of E∗1 as in Lemma 2, λ ∈ (0, (α/k)), α being a
(A3) for each x, y, z ∈ C, limt↓0 F(tz + (1 − t)x, y) ≤ positive constant as in Lemma 3, and Tr is the resolvent of F
F(x, y); for r > 0. Then, the sequence 􏼈xn 􏼉 converges to a point z ∈ Γ.
(A4) for each x ∈ C, y↦F(x, y) is convex and lower
semicontinous. Proof. Putting T � Tr in Corollary 1, we get the desired
result. □
Lemma 7 (see [24]). Let E be a reflexive, strictly convex, and 5. Application to Maximal Monotone Operator
uniformly smooth Banach space and C be a nonempty closed
convex subset of E. Let F : C × C ⟶ R be a bifunction A set valued mapping B ⊂ E × E∗ with domain
satisfying conditions (A1)–(A4), then for any x ∈ E and r > 0, D(B) � {x ∈ E : Bx ≠ ∅} and range R(B) � ∪{Bx:
there exists a unique point z ∈ C such that x ∈ D(B)} is said to be monotone if 〈x − y, x∗ − y∗ 〉 ≥ 0
1 whenever (x, x∗ ), (y, y∗ ) ∈ B. A monotone operator
F(z, y) + 〈y − z, jz − jx〉 ≥ 0, ∀y ∈ C. (52) B ⊂ E × E∗ is said to be maximal monotone if its graph
r
G(B) � 􏼈(x, y) : y ∈ Bx􏼉 is not properly contained in the
graph of any other monotone mapping. We know that if B is
Lemma 8 (see [24]). Let E be a reflexive, strictly convex, and a maximal monotone, then the zero of B,
smooth Banach space and C be a nonempty closed convex B− 1 (0) � {x ∈ E : 0 ∈ Bx} is closed and convex. If E is a
subset of E. Let F: C × C ⟶ R be a bifunction satisfying smooth, strictly convex, and reflexive Banach space, then a
conditions (A1)–(A4), then for any x ∈ E and r > 0, define a monotone operator B : E ⟶ E∗ is maximal if and only if
mapping Tr : E ⟶ C by R(J + rB) � E∗ for each r > 0. Let E be a smooth, strictly
1 convex, and reflexive Banach space, C be a nonempty closed
Tr x � 􏼚x ∈ C: F(z, y) + 〈y − z, jz − jx〉 ≥ 0 ∀y ∈ C􏼛. convex subset of E, and B ⊂ E × E∗ be a monotone operator
r
satisfying
(53)
D(B) ⊂ C ⊂ J− 1 (J + rB), (56)
Then, the following holds:
8 Abstract and Applied Analysis

for all r > 0. If B is a maximal monotone, then (56) holds for minimization problem. We denote the set of solution of the
C � D(B) and we can define the resolvent Sr : C ⟶ D(B) constraint convex minimization problem by argminx∈C ϕ(x).
by
Sr x � {x ∈ E: Jx ∈ Jz + rBz}, (57) Lemma 9 (see [12]). Let H be a real Hilbert space and C be a
− 1 nonempty closed convex subset of H. Let ϕ be a convex
for all x ∈ C, i.e., Sr � (J + rB) J. We know the following function of H into R. If ϕ is differentiable, then z is a solution
(see [23, 25–27]): of the constraint convex minimization problem if and only if
(1) Sr is single valued, z ∈ VI(C, ▽ϕ).
(2) F(Sr ) � B− 1 0, where F(Sr ) is the set of fixed points
of Sr , Theorem 5. Let H1 and H2 be real Hilbert spaces. Let C and
(3) Sr is a firmly nonexpansive type, i.e., Q be two nonempty, closed, and convex subset of H1 and H2 ,
respectively. Let A : H1 ⟶ H2 be a bounded linear operator
such that A ≠ 0, and f : C ⟶ H1 be a monotone and
〈Sr x − Sr y, JSr x − JSr y〉 ≤ 〈Sr x − Sr y, x − y〉, ∀x, y ∈ E. k-Lipschitz continuous. Let ϕ: H2 ⟶ R be a differentiable
(58) convex function and suppose ▽ϕ is α-inverse strongly
monotone mapping. Setting Γ � 􏼈z ∈ VI(C, f) : Az ∈
argminy∈Q ϕ(y)}, assume that Γ ≠ ∅. Let a sequence
Theorem 4. Let E1 be a uniformly smooth and 2-uniformly
convex real Banach space and E2 a 2-uniformly smooth real ⎪
⎧
⎪ yn � xn − cA∗ 􏼐I − PQ (I − μ▽ϕ)Axn 􏼑,
⎪
⎪
Banach space with smoothness constant d2 ∈ (0, 1). Let C and ⎪
⎪
⎪
⎪ tn � PC yn − λfyn 􏼁,
Q be two nonempty, closed, and convex subsets of E1 and E2 , ⎪
⎨
respectively; A : E1 ⟶ E2 be a bounded linear operator with ⎪ zn � PC yn − λftn 􏼁,
⎪
⎪ �� �� �� �� �� �� �� ��
its adjoint A∗ such that A ≠ 0; f : C ⟶ E∗1 be a monotone ⎪
⎪
⎪
⎪ Cn+1 � 􏽮v ∈ Cn : ��yn − v�� ≤ ��xn − v��, ��zn − v�� ≤ ��yn − v��􏽯,
and k-Lipschitz continuous map; and B : E ⟶ E∗ be a ⎪
⎪
⎩x �P x ,
maximal monotone operator. Let Γ � 􏼈z ∈ VI(C, f): Az ∈ n+1 Cn+1 1
B− 1 (0)} ≠ ∅. Let a sequence 􏼈xn 􏼉 be generated by (61)
2
⎪
⎧ x1 � x ∈ C � C1 , where c ⊂ [a, b], a, b ∈ (0, (1/‖A‖ )), λ ∈ (0, (1/k)), and
⎪
⎪ μ ∈ (0, 2α) . Then, the sequence 􏼈xn 􏼉 converges to a point
⎪
⎪ − 1 ∗
⎪
⎪ yn � J Jxn − cA J2 I − Sr 􏼁Axn 􏼁, z ∈ Γ.
⎪
⎪
⎪
⎪ tn � ΠC J− 1 Jyn − λfyn 􏼁,
⎨
⎪
⎪ zn � ΠC J− 1 Jyn − λftn 􏼁, Proof. Putting T � ▽ϕ in Corollary 3, by Lemma 9 we get
⎪
⎪
⎪
⎪ the desired result. □
⎪
⎪ Cn+1 � 􏼈v ∈ Cn : ϕ v, yn 􏼁 ≤ ϕ v, xn 􏼁, ϕ v, zn 􏼁 ≤ ϕ v, yn 􏼁􏼉,
⎪
⎪
⎪
⎩ xn+1 � ΠCn+1 x1 ,
7. Application to Split Minimization Problem
(59)
Let H1 and H2 be real Hilbert spaces. Let C and Q be two
where c ∈ [a, b], a, b ∈ (0, (1/d∗2 ‖A‖2 )), d∗2 being the nonempty, closed, and convex subset of H1 and H2 , re-
smoothness constant of E∗1 as in Lemma 2, λ ∈ (0, (α/k)), α spectively, and ϕ1 : H1 ⟶ R, ϕ2 : H2 ⟶ R be two convex
being a positive constant as in Lemma 3, and Sr is the re- functions. Let AH1 ⟶ H2 be a bounded linear operator.
solvent of B for r > 0. Then, the sequence 􏼈xn 􏼉 converges to a The problem of finding z satisfying the conditions
point z ∈ Γ.
z ∈ argminx∈C ϕ1 (x) such that Az ∈ argminy∈Q ϕ2 s(y),

Proof. Putting T � Sr in Corollary 1, we get the desired (62)

result. □ is called the split minimization problem.

6. Application to Constrained Convex
Minimization Problem
The problem of finding y ∈ C such that
ϕ(y) � minx∈C ϕ(x),
where C is a nonempty closed convex subset of H and ϕ is a
real-valued convex function is called constraint convex
Theorem 6. Let H1 and H2 be real Hilbert spaces. Let C and
Q be two nonempty, closed, and convex subset of H1 and H2 ,
respectively. Let A: H1 ⟶ H2 be a bounded linear operator
such that A ≠ 0, and ϕ1 : H1 ⟶ R and ϕ2 : H2 ⟶ R be two
(60) differentiable convex functions. Suppose that ▽ϕ1 is k-Lip-
schitz continuous and ▽ϕ2 is α-inverse strongly monotone
mapping, let Γ � 􏼈z ∈ argminx∈C ϕ1 (x): Az ∈ argminy∈Q ϕ2
(y)} ≠ ∅. Let a sequence
Abstract and Applied Analysis 9

n X(n)
Convergence of the sequence x(n) generated by (67)
1 0.0059 1

2 0.0029
0.9
3 0.0015
0.8
4 0.0007
5 0.0004 0.7

Value of the sequence:x(n)

6 0.0002
0.6
7 0.0001
8 0.0000 0.5

9 0.0000 0.4
10 0.0000
0.3
11 0.0000
12 0.0000 0.2
13 0.0000
0.1
14 0.0000
15 0.0000 0
0 5 10 15 20 25
Number of iterations:n
Values of the sequence x(n) generated by (67)
Figure 1: The table and graph of sequence 􏼈xn 􏼉 generated by (67) versus number of iterations n : � {0, 1, . . . , 15} with an initial choice of
x0 � 1.0000.

⎪
⎧ yn � xn − cA∗ 􏼐I − PQ I − μ▽ϕ1 􏼁Axn 􏼑, 1
⎪
⎪ fx � x, ∀x ∈ C. (65)
⎪
⎪ 3
⎪
⎪ tn � PC yn − λ▽ϕ2 yn 􏼁,
⎪
⎪
⎨ Then, f is monotone and VI(C, f) � 0.
⎪ zn � PC yn − λ▽ϕ2 tn 􏼁,
⎪
⎪ �� �� �� �� �� �� �� �� Let A : C ⟶ C be defined by
⎪
⎪
⎪
⎪ Cn+1 � 􏽮v ∈ Cn : ��yn − v�� ≤ ��xn − v��, ��zn − v�� ≤ ��yn − v��􏽯, 1
⎪
⎪ Ax � x, ∀x ∈ C. (66)
⎩x �P x , 2
n+1 Cn+1 1
(63) Then, A is a bounded linear operator and ‖A‖2 � (1/4),
∗
A y � (1/2)y.
where c ⊂ [a, b], a, b ∈ (0, (1/‖A‖2 )), λ ∈ (0, (1/k)), and When z ∈ VI(C, f), Az � 0 ∈ F(T0 ) ∩ F(T1 ).
μ ∈ (0, 2α). Then, the sequence 􏼈xn 􏼉 converges to a point So, Γ � 􏼈z ∈ VI(C, f) : Az ∈ F(T0 ) ∩ F(T1 )􏼉 ≠ ∅.
z ∈ Γ. Clearly, Γ � {0}. Taking λ � (3/n2 ) and c � (4/n2 ). It
follows from Theorem 2 that a sequence 􏼈xn 􏼉 is generated by
Proof. Since ϕ1 is convex, we have ▽ϕ1 is monotone. Putting the following algorithm:
f � ▽ϕ1 and g � ▽ϕ2 in Corollary 3 and by Lemma 9, we
get the desired result. □ ⎪
⎧
⎪ yn � xn − cA∗ 􏼐􏼐I − T[n] 􏼑Axn 􏼑,
⎪
⎪
⎪
⎪
⎪
⎪
⎪
⎪
8. Numerical Example ⎪
⎪ tn � PC yn − λfyn 􏼁,
⎪
⎪
⎪
⎪
In this section, we present a numerical example to show the ⎪
⎪
⎪
⎪
convergence of a sequence generated by our algorithm. Let ⎪ zn � PC yn − λftn 􏼁,
⎨
E1 � E2 � R, C � [0, ∞). ⎪ (67)
⎪
⎪
⎪
⎪ 2 2
Set m � 2 and Let T0 , T1 : C ⟶ C be defined by ⎪ Cn+1 � 􏼨v ∈ Cn : v ≤ xn − zn 􏼩,
⎪
⎪
2 ⎪
⎪ 2xn − 2zn
T0 x � x, ∀x ∈ C, ⎪
⎪
⎪
⎪
3 ⎪
⎪
(64) ⎪
⎪
⎪
⎪ x2 − z2n
1 ⎪
⎩ xn+1 � PCn+1 x1 � n ,
T1 x � x, ∀x ∈ C. 2xn − 2zn
2
Then, T0 and T1 are nonexpansive. converges strongly to 0 ∈ Γ (see Figure 1).
Let f : C ⟶ C be defined by
10
Data Availability
Data sharing not applicable to this article as no datasets were
generated or analysed during the current study.
Conflicts of Interest
The authors declare that they have no conflicts of interest.
Authors’ Contributions
All authors contributed equally and significantly in writing
this paper. All authors read and approved the final
manuscript.
Acknowledgments
This work was supported by ACBF and AfDB research grant
funds to AUST. The authors appreciate the support of their
institution. They thank ACBF and AfDB for their financial
support.
References
[1] L.-C. Zeng and J.-C. Yao, “Strong convergence theorems by an
extragradient method for fixed point problems and variational
inequality problems,” Taiwanese Journal of Mathematics,
vol. 10, no. 5, pp. 1293–1303, 2006.
[2] F. Ganciaruso, G. Marino, L. Muglia, and Y. H. Yao, “On a
two-step algorithm for hierarchical fixed point problems and
variational inequalities,” Journal of Inequalities and Appli-
cations, vol. 2009, no. 1, Article ID 208692, 2009.
[3] A. N. Luxin, “An iterative algorithm for the variational in-
equality problem,” Applied Mathematics and Computation,
vol. 13, pp. 103–114, 1994.
[4] X. Qin and S. Y. Cho, “Convergence analysis of a monotone
projection algorithm in reflexive banach spaces,” Acta
Mathematica Scientia, vol. 37, no. 2, pp. 488–502, 2017.
[5] Y. Yao, R. Chen, and H.-K. Xu, “Schemes for finding mini-
mum-norm solutions of variational inequalities,” Nonlinear
Analysis: Theory, Methods & Applications, vol. 72, no. 7-8,
pp. 3447–3456, 2010.
[6] J. L. Lions and G. Stampacchia, “Variational inequalities,”
Communications on Pure and Applied Mathematics, vol. 20,
no. 3, pp. 493–519, 1967.
[7] A. Antipin, “Methods for solving variationalinequalities with
relaxed constraints,” Computational Mathematics and
Mathematical Physics, vol. 40, pp. 1239–1254, 2000.
[8] V. Berinde, “Iterative approximation of fixed points,” Lecture
Notes in Mathematics, Springer, London, UK, 2007.
[9] N. Buong, “Strong convergence theorem of an iterative
method for variational inequalities and fixed point problems
in Hilbert spaces,” Applied Mathematics and Computation,
vol. 217, no. 1, pp. 322–329, 2010.
[10] Y. Censor, A. Gibali, S. Reich, and S. Sabach, “Common
solutions to variational inequalities,” Set-Valued and Varia-
tional Analysis, vol. 20, no. 2, pp. 229–247, 2012.
[11] A. Gibali, S. Reich, and R. Zalas, “Iterative methods for solving
variational inequalities in Euclidean space,” Journal of Fixed
Point Theory and Applications, vol. 17, no. 4, pp. 775–811,
2015.
[12] M. Tian and B. Jiang, “Weak convergence theorems for a class
of split variational inequality problem and applications in a
Abstract and Applied Analysis
Hilbert space,” Journal of Inequalities and Application,
vol. 2017, no. 1, p. 123, 2017.
[13] C. E. Chidume, A. Adamu, and L. Okereke, “A Krasnoselskii-
type algorithm for approximating solutions of variational
inequality problems and convex feasibility problems,” Journal
of Nonlinear and Variational Analysis, vol. 2, no. 2,
pp. 203–218, 2018.
[14] G. M. Korpelevch, “An extragradient method for solving
saddle points and for other problems,” Ekon. Mat. Metody,
vol. 12, pp. 747–756, 1976.
[15] Y. Censor and T. Elfving, “A multiprojection algorithm using
Bregman projections in a product space,” Numerical Algo-
rithms, vol. 8, no. 2, pp. 221–239, 1994.
[16] C. Byrne, “A unified treatment of some iterative algorithms in
signal processing and image reconstruction,” Inverse Prob-
lems, vol. 20, no. 1, pp. 103–120, 2004.
[17] Y. Censor, A. Gibali, and S. Reich, The Split Variational In-
equality Problem, The Technion-Israel Institute of Technol-
ogy, Haifa, Israel, 2010.
[18] W. Nilsrakoo and S. Saejung, “Strong convergence theorems
by Halpern-Mann iterations for relatively nonexpansive
mappings in banach spaces,” Applied Mathematics and
Computation, vol. 217, no. 14, pp. 6577–6586, 2011.
[19] Y. Alber, “Metric and generalized projection operators in
Banach spaces, properties and applications,” in Theory and
Application of Nonlinear Operators of Accretive and Monotone
Type, Lecture Notes in Pure Applied Mathematics,
A. G. Kartsatos, Ed., vol. 178, pp. 15–50, Marcel Dekker, New
York, USA, 1996.
[20] C. E. Chidume, “Geometric properties of banach spaces and
nonlinear iterations,” Vol. 1905 of Lecture Notes in Mathe-
matics, Springer, London, UK, 2009.
[21] H.-K. Xu, “Inequalities in banach spaces with applications,”
Nonlinear Analysis: Theory, Methods & Applications, vol. 16,
no. 12, pp. 1127–1138, 1991.
[22] R. T. Rockafellar, “On the maximality of sums of nonlinear
monotone operators,” Transactions of the American Mathe-
matical Society, vol. 149, no. 1, p. 75, 1970.
[23] S. Kamimura and W. Takahashi, “Strong convergence of a
proximal-type Algorithm in a banach space,” SIAM Journal on
Optimization, vol. 13, no. 3, pp. 938–945, 2002.
[24] X. Qin, Y. J. Cho, and S. M. Kang, “Convergence theorems of
common elements for equilibrium problems and fixed point
problems in Banach spaces,” Journal of Computational and
Applied Mathematics, vol. 225, no. 1, pp. 20–30, 2009.
[25] F. Kohsaka and W. Takahashi, “Existence and approximation
of fixed points of firmly nonexpansive type mappings in
banach spaces,” SIAM Journal on Optimization, vol. 19, no. 2,
pp. 824–835, 2009.
[26] S. Kamimura, “The proximal point algorithm in a Banach
space,” in Proceedings of the Third International Conference on
Nonlinear Analysis and Convex Analysis, W. Takahashi and
T. Tanaka, Eds., Yokohama Publishers, Tokyo, Japan,
pp. 143–148, 2004.
[27] S.-Y. Matsushita and W. Takahashi, “Weak and strong con-
vergence theorems for relatively nonexpansive mappings in
Banach spaces,” Fixed Point Theory and Applications,
vol. 2004, no. 1, p. 829453, 2004.