1. Introduction
In ref. [
1], W. Takahashi snd M. Toyoda introduced an iteration process for finding a common element of the set of fixed points of a nonexpansive mapping and the set of solutions of a variational inequality problem for an inverse strongly monotone mapping, and they showed its weak convergence. Such convergence results are of interest from a theoretical point of view but in practice only, a finite number of iterates can be carried out. Therefore, it is important to show that the iteration process generates an approximate solution and to obtain an estimation for a number of iterates that is sufficient to obtain such an approximate solution. This is the goal of the current paper for the iteration process of ref. [
1]. As a matter of fact, we will show that for the iteration process, most of its iterates are approximate common solutions of a finite family of variational inequalities induced by inverse strongly monotone mappings.
Assume that
is a real Hilbert space equipped with an inner product that induces the Euclidean norm
where
is a nonempty, convex, closed set,
, and
satisfies, for each
,
In other words,
A is
-inverse strongly monotone [
1,
2,
3].
For each
and each
, set
Let denote the identity self-mapping of H: , .
The following examples of inverse strongly monotone mappings are given in ref. [
1]. If
, where T is a nonexpansive mapping of K into itself, then A is (1/2) inverse strongly monotone, and
is the set of fixed points of
T.
A mapping
is called strongly monotone if there exists a positive real number
such that
Then, we say that
A is
strongly monotone. If A is
strongly monotone and
is Lipschitz continuous, then A is
inverse strongly monotone. There are many mappings that are inverse strongly monotone but not strongly monotone [
1]. In fact, let
H be real numbers, let
, and define
by
It was shown in [
1] that
A is inverse strongly monotone but not strongly monotone.
The next result is well known in the literature [
4,
5,
6].
Lemma 1. Let D be a nonempty closed convex subset of H. Then, for each , there is a unique point satisfying Moreover, the following assertions hold:
1. and for each and each , 2. If and and if for each then . Proposition 1. Let , . Then, if and only if Proof. By definition,
if and only if
On the other hand, Lemma 1 implies that
if and only if for each
,
This completes the proof of Proposition 1. □
Let
The following algorithm was studied in ref. [
1].
Let
1. Initialization. Choose
2. Iterative step. For each integer
given a current iterate
, set
It was shown in [
1] that the iterates of the algorithm weakly converge to a point of
.
2. The Algorithms
Assume that
is a nonempty convex set,
m is a natural number,
, where
, are nonempty, closed, convex sets,
, and that for each
,
and satisfies, for each
,
Clearly, S is the set of common solutions of the variational inequalities, while is the set of common -approximate solutions of variational inequalities.
In this paper, we study two algorithms. The first of them is associated with the Cimmino algorithm [
7], while the second one is a method with the remotest set control [
8].
Let us consider our first algorithm:
1. Initialization. Choose
2. Iterative step. For each integer
given a current iterate
, choose
such that
and set
Let us consider our second algorithm.
Assume that
and that
1. Initialization. Choose
2. Iterative step. For each integer
given a current iterate
, choose
such that either
or
, and set
These two algorithms are known in the literature, where they are used in order to solve a convex feasibility problem, in other words, to find a point belonging to the intersection of a finite family of convex, closed sets. In the classical Cimmino method, all .
3. Main Results
In this paper, we prove the following two results.
Theorem 1. Assume that and for each integer , Let a positive number ϵ satisfy Moreover, if is an integer and for each integer , then Theorem 2. Assume that (8) holds, and for each integer either or and Let a positive number satisfy Moreover, if is an integer and then Theorems 1 and 2 show that the number of iterates that are not -approximate solutions of our problem is bounded by a constant that depends on , and .
4. Auxiliary Results
Let
Proposition 2. Let and . Then, If , then is nonexpansive.
Proof. Proposition 2 is proved. □
Proof. Proposition 2 implies that for each
,
Lemma 1 and (18) and (19) imply that
It follows from (18), (20), and (22) that
Lemma 1, Proposition 2, the inequality
, and relations (18) and (19) imply that
Together with (23), this implies that
In view of the Cauchy–Schwartz inequality,
Together with the relation above, this implies that
Lemma 2 is proved. □
Lemma 3. Assume that , , , and Proof. Lemma 1 implies that for each
,
By (24) and the relation above, for each
,
and
Lemma 3 is proved. □
5. Proof of Theorem 1
In view of (8), there exists
such that
Let
be an integer and
. Lemma 2 and (9) and (25) imply that
It follows from (11) and (12) and the convexity of the function
that
Let
Q be a natural number. Set
By (8), (10), (31), (33), and (35),
Since
Q is an arbitrary natural number, we conclude that
By (8), (10), (30), (32), and (34),
Since
Q is an arbitrary natural number, we conclude that
Let
be an integer and for every
,
By Lemma 3, (13), and the relations above, for each
and each
,
Theorem 1 is proved.
6. Proof of Theorem 2
In view of (8), there exists
such that (25) and (26) hold. Let
be an integer. Lemma 2, the inequality
, and (14) and (17) imply that
Let
Q be a natural number. Set
By (8), (15), (36), (37), (40), and the definition of
,
Since
Q is an arbitrary natural number, we conclude that
By (8), (15), (36), (37), (39), and (41),
Since
Q is an arbitrary natural number, we conclude that
By (38), (39), the relations above, and the definition of
,
Let
be an integer, and for every
,
Together with (16), this implies that for each
,
By Lemma 3, the choice of
, and the relations above, for each
and each
,
Theorem 2 is proved.