Hybrid Extragradient-Type Methods for Finding a Common Solution of an Equilibrium Problem and a Family of Strict Pseudo-Contraction Mappings ()
1. Introduction
Let
be a real Hilbert space endowed with an inner product
and a norm
associated with this inner product, respectively. Let C be a nonempty closed convex subset of
, and f be a bifunction from C × C to R such that f(x, x) = 0 for all
. An equilibrium problem in the sense of Blum and Oettli [1] is stated as follows:
(1)
Problem of the form (1) on one hand covers many important problems in optimization as well as in nonlinear analysis such as (generalized) variational inequality, nonlinear complementary problem, nonlinear optimization problem, just to name a few. On the other hand, it is rather convenient for reformulating many practical problems in economic, transportation and engineering (see [1,2] and the references quoted therein).
The existence of solution and its characterizations can be found, for example, in [3], while the methods for solving problem (1) have been developed by many researchers [4-8].
Alternatively, the problem of finding a common fixed point element of a finite family of self-mappings
(p ≥ 1)
is expressed as follows:
(2)
where Fix(Si, C) is the set of the fixed points of the mapping Si (i = 1, ···, p).
Problem of finding a fixed point of a mapping or a family of mappings is a classical problem in nonlinear analysis. The theory and solution methods of this problem can be found in many research papers and mono-graphs (see [9]).
Let us denote by Sol(f, C) and
![](https://www.scirp.org/html/16-7400940\41fbe1c2-4fb2-40e2-940b-623a935e4f3c.jpg)
the solution sets of the equilibrium problem (1) and the fixed-point problem (2), respectively. Our aim in this paper is to address to the problem of finding a common solution of two problems (1) and (2). Typically, this problem is stated as follows:
(3)
Our motivation originates from the following observations. Problem (3) can be on one hand considered as an extension of problem (1) by setting Si = I for all i = 1, ···, p, the identity mapping. On the other hand it is significant in many practical problems. Since the equilibrium problems have found many applications in economic, transportation and engineering, in some practical problems it may happen that the feasible set of those problems result as a fixed point solution set of one or many fixed point problems. In this case, the obtained problem can be reformulated in the form of (3). An important special case of problem (3) is that
![](https://www.scirp.org/html/16-7400940\b7aa100d-d4be-4493-bd82-4d4bf7217171.jpg)
and this problem is reduced to finding a common element of the solution set of variational inequalities and the solution set of a fixed point problem (see [10-12]).
In this paper, we propose a new hybrid iterative-based method for solving problem (3). This method can be considered as an improvement of the viscosity approximation method in [11] and iterative methods in [13]. The idea of the algorithm is to combine the extragradient-type methods proposed in [14] and a fixed point iteration method. Then, the algorithm is modified by projecting on a suitable convex set to obtain a new variant which possesses a better convergence property.
The rest of the paper is organized as follows. Section 2 recalls some concepts and results in equilibrium problems and fixed point problems that will be used in the sequel. Section 3 presents two algorithms for solving problem (3) and some discussion on implementation. Section 4 investigates the convergence of the algorithms presented in Section 3 as the main results of our paper.
2. Preliminaries
Associated with the equilibrium problem (1), the following definition is common used as an essential concept (see [3]).
Definition 2.1. Let C be a nonempty closed convex subset of a real Hilbert space
. A bifunction f: C × C → R is said to be
1) Monotone on C if
for all x and y in C;
2) Pseudo-monotone on C if
implies
for all x, y in C;
3) Lipschitz-type continuous on C with two Lipschitz constants c1 > 0 and c2 > 0 if
(4)
It is clear that every monotone bifunction f is pseudo-monotone. Note that the Lipschitz continuous condition (4) was first introduced by Mastroeni in [7].
The concept of strict pseudo-contraction is considered in [15], which defined as follows.
Definition 2.2. Let C be a nonempty closed convex subset of a real Hilbert space
. A mapping S: C → C is said to be a strict pseudo-contraction if there exists a constant 0 ≤ L < 1 such that
(5)
where I is the identity mapping on
. If L = 0 then S is called non-expansive on C.
The following proposition lists some useful properties of a strict pseudo-contraction mapping.
Proposition 2.3. [15] Let C be a nonempty closed convex subset of a real Hilbert space
, S: C → C be an L-strict pseudo-contraction and for each i = 1, ···, p, Si: C → C is a Li -strict pseudo-contraction for some 0 ≤ Li < 1. Then:
1) S satisfies the following Lipschitz condition:
![](https://www.scirp.org/html/16-7400940\20c683ea-2a79-45fd-a45f-a20b22f611b8.jpg)
2) I − S is demiclosed at 0. That is, if the sequence {xk} contains in C such that
and
then
;
3) The set of fixed points Fix(S) is closed and convex;
4) If
(i = 1, ···, p)
and ![](https://www.scirp.org/html/16-7400940\b34c438c-3b47-4021-b960-ab247a14b6e8.jpg)
then ![](https://www.scirp.org/html/16-7400940\bbc9faf6-79e7-4efc-95a5-a822e684ee74.jpg)
is a
-strict pseudo-contraction with
;
5) If
is chosen as in (d) and
has a common fixed point then:
![](https://www.scirp.org/html/16-7400940\c718fe0e-8308-4823-94cf-1231f5ff89c4.jpg)
Before presenting our main contribution, let us briefly look at the recently literature related to the methods for solving problem (3). In [11], S. Takahashi and W. Takahashi proposed an iterative scheme under the name viscosity approximation methods for finding a common element of set of solutions of (1) and the set of fixed points of non-expansive mapping S in a real Hilbert space
. This method generated an iteration sequence {xk} starting from a given initial point
and computed xk + 1 as
(6)
where g is a contraction of
into itself, the sequences of parameters {rk} and {αk} were chosen appropriately. Under certain choice of {αk} and {rk}, the authors showed that two iterative sequences {xk} and {uk} converged strongly to
where PrC denotes the projection onto C.
Alternatively, the problem of finding a common fixed point of a finite sequence of mappings has been studied by many researchers. For instance, Marino and Xu in [7] proposed an iterative algorithm for finding a common fixed point of p strict pseudo-contraction mapping Si (i = 1, ···, p). The method computed a sequence {xk} starting from
and taking:
(7)
where the sequence of parameters {λk} was chosen in a specific way to ensure the convergence of the iterative sequence {xk}. The authors showed that the sequence {xk} converged weakly to the same point
.
Recently, Chen et al. in [13] proposed a new iterative scheme for finding a common element of the set of common fixed points of a strict pseudo-contraction sequence
and the set of solutions of the equilibrium problem (1) in a real Hilbert space
. This method is briefly described as follows. Given a starting point
and generates three iterative sequences {xk}, {yk} and {zk} using the following scheme:
(8)
Here, two sequences {αk} and {rk} are given as control parameters. Under certain conditions imposed on {αk} and {rk}, the authors showed that the sequences {xk}, {yk} and {zk} converged strongly to the same point x* such that
where S is a mapping of C into itself defined by
![](https://www.scirp.org/html/16-7400940\39c4b23c-5f2f-45ab-b40e-75a5952951c8.jpg)
for all
.
The solution methods for finding a common element of the set of solutions of (1) and
![](https://www.scirp.org/html/16-7400940\dd8c28a9-ae61-45c7-b334-0690990d6545.jpg)
in a real Hilbert space have been recently studied in many research papers (see [8,12,16-23]). Throughout those papers, there are two essential assumptions on the function f have been used: monotonicity and Lipschitztype continuity.
In this paper, we continue studying problem (3) by proposing a new iterative-based algorithm for finding a solution of (3). The essential assumptions that will be used in our development includes: pseudo-monotonicity and Lipschitz-type continuity of the bifunction f and the strict pseudo-contraction of Si (i = 1, ···, p). The algorithm is then modified to obtain a new variant which has a better convergence property.
3. New Hybrid Extragradient Algorithms
In this section we present two algorithms for finding a solution of problem (3). Before presenting algorithmic schemes, we recall the following assumptions that will be used to prove the convergence of the algorithms.
Assumption 3.1. The bifunction f satisfies the following conditions:
1) f is pseudo-monotone and continuous on C;
2) f is Lipschitz-type continuous on C;
3) For each
,
is convex and subdifferentiable on C.
Assumption 3.2. For each i = 1, ···, p, Si is Li-strict pseudo-contraction for some 0 ≤ Li < 1.
Assumption 3.3. The solution set of (3) is nonempty, i.e.
(9)
Note that if
![](https://www.scirp.org/html/16-7400940\f7eab07d-5a83-44e7-8d41-837eb07c8b11.jpg)
where
![](https://www.scirp.org/html/16-7400940\f7307e9f-7cea-4c56-8764-b7d2149cc9c1.jpg)
is the set of relative interior points of the domain of
, then Assumption 3.1 3) is automatically satisfied. The first algorithm is now described as follows.
Algorithm 3.4
Initialization: Given a tolerance ε > 0. Choose three positive sequences {λk}, {λk, i} and {αk} satisfy the conditions:
(10)
Find an initial point
. Set
.
Iteration k: Perform the two steps below:
Step 1: Solve two strongly convex programs:
(11)
Step 2: Set
.
Set
and go back to Step 1.
The main task of Algorithm 3.4 is to solve two strongly convex programming problems at Step 1. Since these problems are strongly convex and C is nonempty, they are uniquely solvable. To terminal the algorithm, we can use the condition on step size by checking
for a given tolerance ε > 0. Step 1 of Algorithm 3.4 is known as an extragradient-type step for solving equilibrium problem (1) proposed in [14]. Step 2 is indeed the iteration (7) of the iterative method proposed in [24].
As we will see in the next section, Algorithm 3.4 generates a sequence {xk} that converges weakly to a solution x* of (3). Recently, a modification of Mann’s algorithm for finding a common element of p strict pseudo-contractions was proposed [15]. The authors proved that this algorithm converged strongly to a common fixed point of the p strict pseudo-contractions. In the next algorithm, we extended the algorithm in [15] for finding a common solution of the set of common fixed points of p strict pseudo-contractions and the equilibrium problems to obtain a strongly convergence algorithm. This algorithm is similar to the iterative scheme (8), where an augmented step will be added to Algorithm 3.4 and obtain a new variant of Algorithm 3.4.
For a given closed, convex set X in
and
, PrX(x) denotes the projection of x onto X. The algorithm is described as follows.
Algorithm 3.5
Initialization: Given a tolerance ε > 0. Choose positive sequences {λk}, {λk, i} and {αk} satisfy the conditions (10) and the following addition condition:
(12)
Find an initial point
. Set
.
Iteration k: Perform the three steps below:
Step 1: Solve two strongly convex programs:
(13)
Step 2: Set
.
Step 3: Compute
(14)
where
![](https://www.scirp.org/html/16-7400940\25f65099-096f-4642-a114-7525d476d9f8.jpg)
(15)
![](https://www.scirp.org/html/16-7400940\44e806ab-dacf-41b2-9471-0513851062f3.jpg)
Set
and go back to Step 1.
The augmented step needed in Algorithm 3.5 is a simple projection on the intersect of two half-planes. The projection is cheap to compute in implementation.
4. The Convergence of the Algorithms
This section investigates the convergence of the algorithms 3.4 and 3.5. For this purpose, let us recall the following technical lemmas which will be used in the sequel.
Lemma 4.1 [25]. Let C be a nonempty closed convex subset of a real Hilbert space
. Suppose that, for all
, the sequence {xk} satisfies
![](https://www.scirp.org/html/16-7400940\244af21b-630b-4a89-9bef-831ddf4c0478.jpg)
Then the sequence ![](https://www.scirp.org/html/16-7400940\2ff03bdd-9433-429a-a22f-9c208ced6a79.jpg)
converges strongly to some
.
Using the well-known necessary and sufficient condition for optimality in convex programming, we have the following result.
Lemma 4.2 [2]. Let C be a nonempty closed convex subset of a real Hilbert space
and g: C → R be subdifferentiable on C. Then x* is a solution to the following convex problem
![](https://www.scirp.org/html/16-7400940\b66ae854-22d1-4d11-a3ab-ff668463d870.jpg)
if and only if
where
denotes the subdifferential of g and
is the (outward) normal cone of C at
.
The next lemma is regarded to the property of a projection mapping.
Lemma 4.3 [9]. Let C be a nonempty closed convex subset of a real Hilbert space
and
. Let the sequence {xk} be bounded such that every weakly cluster point
of {xk} belongs to C and
![](https://www.scirp.org/html/16-7400940\6853f5dc-6af0-4cba-9ed6-c533a7ebff75.jpg)
Then xk converges strongly to PrC(x0) as k → ∞.
Lemma 4.4 (see [14], Lemma 3.1). Let C be a nonempty closed convex subset of a real Hilbert space
. Let
be a pseudomonotone, Lipschitztype continuous bifunction with constants c1 > 0 and c2 > 0. For each
, let
be convex and subdifferentiable on C. Suppose that the sequences {xk}, {yk}, {tk} generated by Scheme (13) and
. Then
![](https://www.scirp.org/html/16-7400940\5d88e8f0-130c-4e34-bbea-48190736d692.jpg)
Now, we prove the main convergence theorem.
Theorem 4.5. Suppose that Assumptions 3.1-3.3 are satisfied. Then the sequences {xk}, {yk} and {zk} generated by Algorithm 3.4 converge weakly to the same point
![](https://www.scirp.org/html/16-7400940\c62b7fa0-52a1-45c4-a296-c42b71caa20b.jpg)
where
(16)
Proof. The proof of this theorem is divided into several steps.
Step 1. We claim that
![](https://www.scirp.org/html/16-7400940\0534197c-e4fe-49ea-a9be-86351771afb2.jpg)
Indeed, for each k ≥ 1, we denote by
.
By statement 4) of Proposition 2.3, we see that
is a
-strict pseudo-contraction on C and then
.
Now, we suppose that
.
Then, using Lemma 4.4 and the relation
for all
and
, we have
(17)
(18)
(19)
Therefore, there exists
.
It follows from (18) that
.
So we have
![](https://www.scirp.org/html/16-7400940\6618af52-7379-45ae-a907-134bbc631545.jpg)
Using this and
![](https://www.scirp.org/html/16-7400940\1246ff48-e2db-4fd7-aff9-54c0afd9a4bf.jpg)
we have
.
Similarly, we also have
.
Then, since
![](https://www.scirp.org/html/16-7400940\5fb405a5-4b1f-4341-8f07-e1304f4ddf14.jpg)
we also have
.
Step 2. We show that
![](https://www.scirp.org/html/16-7400940\d546b18b-7334-47ae-ac64-df6cc46293c3.jpg)
It follows from (17) that
![](https://www.scirp.org/html/16-7400940\51a790a9-4945-4109-889f-d3c730018523.jpg)
Combining this and Lemma 4.4, we get
![](https://www.scirp.org/html/16-7400940\a1600a7f-071d-468b-ac33-5c04d61e0403.jpg)
Then, using (a) of Proposition 2.3 and Step 2, we obtain
![](https://www.scirp.org/html/16-7400940\3fa010d0-3c76-4bfc-900a-cc20d70ee02b.jpg)
In Step 3 and Step 4 of this theorem, we will consider weakly clusters of {xk}. It follows from (19) that the sequence {xk} is bounded and hence there exists a subsequence
converges weakly to
as j → ∞.
Step 3. We show that
.
Indeed, for each i = 1, ···, p, we suppose that
converges
as j → ∞ such that
.
Then we have
![](https://www.scirp.org/html/16-7400940\790c708a-7f7e-49e3-9490-b65bb0574acd.jpg)
Since
from Step 2 and
![](https://www.scirp.org/html/16-7400940\05b99009-0776-4353-a27e-c53e3fb4fbd1.jpg)
we obtain that
![](https://www.scirp.org/html/16-7400940\b40333f4-d979-418e-a971-3802d8bdc4b3.jpg)
By 2) of Proposition 2.3, we have
.
Then, it implies from 5) of Proposition 2.3 that
.
Step 4. When
as j → ∞, we show that
Indeed, since yk is the unique strongly convex problem
![](https://www.scirp.org/html/16-7400940\d50e09d4-5a42-4caf-8899-dce1c5c9fee7.jpg)
and Lemma 4.2, we have
![](https://www.scirp.org/html/16-7400940\35e89227-6c6c-4610-9305-aded36691470.jpg)
This follows that
![](https://www.scirp.org/html/16-7400940\4331a8e6-219f-4f79-a83d-5cf7ead195af.jpg)
where
and
. By the definition of the normal cone NC we imply that
(20)
On the other hand, since
is subdifferentiable on C, by the well known Moreau-Rockafellar theorem, there exists
such that
![](https://www.scirp.org/html/16-7400940\66633343-009f-4539-81ff-6a9610c7f334.jpg)
Combining this with (20), we have
![](https://www.scirp.org/html/16-7400940\ef63227c-b2c1-4795-a4d3-4864492db769.jpg)
Hence
![](https://www.scirp.org/html/16-7400940\5c5e9d2a-9222-4954-ba98-09384017f477.jpg)
Then, using
![](https://www.scirp.org/html/16-7400940\97931a1e-e523-4078-894a-c75bb521d715.jpg)
Step 2,
as j → ∞ and continuity of f, we have
![](https://www.scirp.org/html/16-7400940\357a1192-0cfb-453f-93c5-cf64a394cda1.jpg)
This means that
.
Step 5. We claim that the sequences {xk}, {yk} and {tk} convergence weakly to
as k → ∞, where
![](https://www.scirp.org/html/16-7400940\73707a0a-714d-4251-ab00-b70af12585bb.jpg)
Indeed, since {xk} is bounded, we suppose that there exists two sequences
and
such that
![](https://www.scirp.org/html/16-7400940\c31396c0-ce4f-4663-b2d6-f8fcced4cb6a.jpg)
By Step 3 and Step 4, we have
.
Then, using ![](https://www.scirp.org/html/16-7400940\db2975b8-9278-4215-ba8e-10eb9a363cbc.jpg)
and the following equality (see [7])
![](https://www.scirp.org/html/16-7400940\157866c1-32c9-479a-8640-fcdb51c29734.jpg)
where
as k → ∞, we have
![](https://www.scirp.org/html/16-7400940\0a1f29b5-3933-4626-b042-cc2ff842a85d.jpg)
Hence, we have
. This implies that
![](https://www.scirp.org/html/16-7400940\cb309a0c-6cac-4a52-81de-b46aa0dfe88d.jpg)
Then, it follows from Step 2 that
as k → ∞.
Now, we suppose that
![](https://www.scirp.org/html/16-7400940\fdd73458-8091-48cf-8190-9ffa4b4a32f6.jpg)
and
as k → ∞. By the definition of PrC(·), we have
(21)
It follows from Step 1 that
![](https://www.scirp.org/html/16-7400940\c0ba00fb-abfe-4432-86d5-556f68fbbd36.jpg)
![](https://www.scirp.org/html/16-7400940\863830c5-8e74-4592-9758-2d575bb54c15.jpg)
Then, by Lemma 4.1, we have
(22)
Pass the limit in (21) and combining this with (22), we have
![](https://www.scirp.org/html/16-7400940\0d27b4fa-5b0b-414c-8ba9-dfad7146c893.jpg)
This means that
and
![](https://www.scirp.org/html/16-7400940\863ce212-0820-4452-a2d9-1bf516f149aa.jpg)
It follows from Step 2 that the sequences {xk}, {yk} and {tk} converge weakly to
as k → ∞, where
![](https://www.scirp.org/html/16-7400940\1b0a4431-19a4-48f0-afde-ba80551878d3.jpg)
The proof is completed.![](https://www.scirp.org/html/16-7400940\b7b67501-5057-4bb9-ac65-caa5c54e3acd.jpg)
The next theorem proves the strong convergence of Algorithm 3.5.
Theorem 4.6. Suppose that Assumptions 3.1-3.3 are satisfied. Then the sequences {xk} and {yk} generated by Algorithm 3.5 converge strongly to the same point x*
where ![](https://www.scirp.org/html/16-7400940\d2d0ac79-18b3-4d85-8a83-0993660f8916.jpg)
provided
.
Proof. We also divide the proof of this theorem into several steps.
Step 1. We claim that
![](https://www.scirp.org/html/16-7400940\696eccd7-2ae6-4dd5-8b01-a67de4b5cbd8.jpg)
Indeed, for each
it implies from (17) that
![](https://www.scirp.org/html/16-7400940\2bae6282-dccc-4d5a-935a-8887245ea844.jpg)
where
.
This means that
and hence
![](https://www.scirp.org/html/16-7400940\561e2e69-249e-4324-ade6-cc0ab9c02806.jpg)
for all k ≥ 1. We prove
(23)
by induction. For k = 0, we have
.
As ![](https://www.scirp.org/html/16-7400940\89078332-e0cd-42e8-ab29-a486de1fefd8.jpg)
by the induction assumption and hence
.
Since
![](https://www.scirp.org/html/16-7400940\088f7ab5-30fe-4eba-b21d-0f1956f7960b.jpg)
we have
.
Thus
![](https://www.scirp.org/html/16-7400940\cd4aeac9-a100-4428-8576-1c55b530e149.jpg)
By the definition of Qk + 1, we have
.
Hence (23) holds for all k ≥ 0.
Step 2. We show that
![](https://www.scirp.org/html/16-7400940\4bf3a169-7838-4b8b-92b9-26eee307ef0f.jpg)
Indeed, from ![](https://www.scirp.org/html/16-7400940\d25665a0-428e-42fb-9db5-aedf1d3be498.jpg)
it follows
, i.e.,
![](https://www.scirp.org/html/16-7400940\af225f17-6662-4e4c-82ee-f440f31b3d94.jpg)
Then, we have
![](https://www.scirp.org/html/16-7400940\a226a31b-56d2-45f3-bfb5-8013d385d889.jpg)
the last claim holds by Step 1 of Theorem 4.5. From
it follows that
, i.e.
![](https://www.scirp.org/html/16-7400940\a8997825-c5dc-4e87-8fb6-453a07a8939f.jpg)
Using this and the following equality
![](https://www.scirp.org/html/16-7400940\cca0032f-6fc5-403e-b19a-923c251f4f09.jpg)
we obtain
![](https://www.scirp.org/html/16-7400940\158a30e1-0e54-43e6-baa1-802e5ccba4b8.jpg)
Hence
![](https://www.scirp.org/html/16-7400940\2aef943a-1fd3-40e6-9dd3-a17740b3f8cc.jpg)
Combining this and
![](https://www.scirp.org/html/16-7400940\c4570576-f179-40a9-8a97-8132d1502fd4.jpg)
we have
(24)
Since
is subdifferentiable on C, by the well known Moreau-Rockafellar theorem, there exists
such that
![](https://www.scirp.org/html/16-7400940\f3e4e1f0-4599-4d80-ae89-699dc49792ab.jpg)
With t = x*, this inequality becomes
(25)
By the definition of the normal cone NC we have, from the latter inequality, that
(26)
With t = yk, we have
![](https://www.scirp.org/html/16-7400940\1fe627bb-413d-47fe-99fa-ead98d769bab.jpg)
Combining f(x, x) = 0 for all
, the last inequality and the definition of w,
![](https://www.scirp.org/html/16-7400940\51fa77e7-372f-4d8e-a32e-32f9bca35561.jpg)
we have
(27)
Since yn is the unique solution to the strongly convex problem
![](https://www.scirp.org/html/16-7400940\3f562add-1c01-4ce8-b5bb-ba9eb399cb57.jpg)
we have
(28)
Substituting
, we obtain
(29)
From (29), it follows
(30)
Adding two inequalities (27) and (30), we obtain
![](https://www.scirp.org/html/16-7400940\31567b40-22cb-4cc1-a026-14ee45259e7b.jpg)
Then, since f is Lipschitz-type continuous on C, we have
![](https://www.scirp.org/html/16-7400940\e46fdc8e-2ff7-46d3-921d-6e15572e4183.jpg)
which follows that
![](https://www.scirp.org/html/16-7400940\79945160-d626-47ea-8895-32493efaa7e9.jpg)
From
it follows that
.
Then, we have
(31)
Since (24), (31) and
is Lipschitz continuous, we have
![](https://www.scirp.org/html/16-7400940\8da35bf6-ab41-4320-9ca4-0bf89da96be0.jpg)
Step 3. We show that the sequence {xk} converges strongly to x*, where
![](https://www.scirp.org/html/16-7400940\6157e685-86d4-40c7-9a95-5c5789caf0ff.jpg)
Indeed, as in Step 4 and Step 5 of the proof of Theorem 4.5, we can claim that for every weakly cluster point
of the sequence {xk} satisfies
.
On the other hand, using the definition of Qk, we have
![](https://www.scirp.org/html/16-7400940\a276a0da-b37b-449b-8365-0917bd82f126.jpg)
Combining this with Step 1, we obtain
![](https://www.scirp.org/html/16-7400940\e81f13af-8b57-41f4-9c8b-5b088447e679.jpg)
With x = x*, we have
![](https://www.scirp.org/html/16-7400940\82a531c4-f029-4ac2-a039-40e92c6785c2.jpg)
By Lemma 4.3, we claim that the sequence {xk} converges strongly to x* as k → ∞, where
.
Hence, we also have yk → x* as k → ∞.![](https://www.scirp.org/html/16-7400940\9c000e80-c98a-4e75-8263-a93c196fc99a.jpg)
5. Acknowledgements
The work of the first author was supported by the Vietnam National Foundation for Science Technology Development (NAFOSTED), code 101.02-2011.07.