Preprint
Article

An Averaged Halpern Type Algorithm for Solving Fixed Point Problems and Variational Inequality Problems

Altmetrics

Downloads

106

Views

24

Comments

0

A peer-reviewed article of this preprint also exists.

This version is not peer-reviewed

Submitted:

06 October 2024

Posted:

07 October 2024

You are already at the latest version

Alerts
Abstract
In this paper we propose and study in the setting of a Hilbert space an averaged Halpern type algorithm for approximating the solution of a common fixed point problem for a couple of nonexpansive and demicontractive mappings with a variational inequality constraint. The strong convergence of the sequence generated by the algorithm is established under feasible assumptions on the parameters involved. In particular, we also obtain the common solution of the fixed point problem for nonexpansive or demicontractive mappings and of a variational inequality problem. Our results extend and generalize various important related results in literature that were established for the pairs (nonexpansive, nonspreading) or (nonexpansive, strongly quasi-nonexpansive) mappings. Numerical tests to illustrate the superiority of our algorithm over the ones existing in literature are also reported.
Keywords: 
Subject: Computer Science and Mathematics  -   Analysis

1. Introduction

Let H be a real Hilbert space with norm · and inner product · , · . Let D H be a closed convex set, and consider the self-mapping G : D D . Throughout this paper the set of all fixed points of G in D is denoted by
F i x ( G ) = { u D : G u = u } .
The mapping G is said to be
(a)
nonexpansive if
G u G v u v , for all u , v D ;
(b)
quasi-nonexpansive if F i x ( G ) and
G u v u v , for all u D and v F i x ( G ) ;
(c)
β-demicontractive if F i x ( G ) and there exists a positive number β < 1 such that
G u v 2 u v 2 + β u G u 2 ,
for all u D and v F i x ( G ) .
(d)
strongly quasi-nonexpansive if F i x ( G ) , G is quasi-nonexpansive and u p G u p 0 whenever { u p } is a bounded sequence such that u p u * G u p u * 0 for some u * F i x ( G ) .
By the previous definitions, it is obvious that any nonexpansive mapping G with F i x ( G ) is quasi-nonexpansive, any strongly quasi-nonexpansive is quasi-nonexpansive, and that any quasi-nonexpansive mapping is demicontractive, too, but the reverses are no more true, as illustrated by the next example.
Example 1
([4]). Let H be the real line with the usual norm and D = [ 0 , 1 ] . Define F on D as
F ( u ) = 7 / 8 , i f 0 u < 1 1 / 4 , if u = 1 .
Then F is 2 3 -demicontractive but F is neither nonexpansive nor quasi-nonexpasive (and hence not strongly quasi-nonexpansive).
There are several papers in literature which are devoted to the approximation of common fixed points of nonexpansive type mappings. For example, in order to approximate the common fixed points of a pair of nonexpansive self mappings ( T 1 , T 2 ) with F i x ( T 1 ) F i x ( T 2 ) , Takahashi and Tamura [21] considered the following iterative procedure:
x 1 C , x n + 1 = ( 1 α n ) x n + α n T 1 ( 1 β n ) x n + β n T 2 x n , n 1 ,
for which they established a weak convergence theorem.
Moudafi [15] considered a slightly different Krasnoselsij-Mann iterative procedure for the same problem, that he called "hierarchical fixed-point problem":
x 1 C , x n + 1 = ( 1 α n ) x n + α n ( 1 β n ) T 2 x n + β n T 1 x n , n 1 ,
where F i x ( T 1 ) and F i x ( T 2 ) are assumed to be nonempty.
Further, Iemoto and Takahashi [21] considered the problem of approximating the common fixed points of a nonexpansive mapping T and of a nonspreading mappings S in a Hilbert space, and utilized the iterative scheme
x 1 C , x n + 1 = ( 1 α n ) x n + α n ( 1 β n ) T x n + β n S x n , n 1 ,
for which they formulated and proved some weak convergence theorems.
Starting from this background, our aim in this paper is to solve the common fixed point problem in the setting of Hilbert spaces for the case of the larger class of demicontractive mappings, thus extending and unifying the main results in Cianciaruso et al. [7], Falset et al. [8], Iemoto and Takahashi [9] and many others.
Our main result (Theorem 1) provides a convergence theorem for an averaged iterative Halpern type algorithm used to approximate a solution of the common fixed point problem for a pair consisting of a nonexpansive mapping and a demicontractive mapping, which also solves a certain variational inequality problem.

2. Preliminaries

We recall some important lemmas used in the proofs of our main results. The following two lemmas are taken from Berinde [3].
Lemma 1.
[3] Let H be a real Hilbert space and D H a closed and convex set. If G : D D is β-demicontractive, then the Krasnoselskij perturbation G ν = ( 1 ν ) I + ν G of G is ( 1 + β / ν 1 / ν ) -demicontractive.
Lemma 2.
[3] Let H be a real Hilbert space and D H a closed and convex set. If G : D D is β-demicontractive, then for any ν ( 0 , 1 β )
G ν = ( 1 ν ) I + ν G
is quasi-nonexpansive.
Lemma 3
(Zhou [30]). Let C be a nonempty subset of a real Hilbert space and let T : C C be a k-strictly pseudocontractive mapping. Then the averaged mapping T λ = ( 1 λ ) I + λ T is nonexpansive for any λ ( 0 , 1 k ) .
Lemma 4.
Let H be a real Hilbert space, D H a closed and convex set and F : D D a mapping. Then, for any ν ( 0 , 1 ) , we have F i x ( F ν ) = F i x ( F ) .
Lemma 5.
[24] Let { α n } be a sequence of nonnegative numbers such that
α n ( 1 c n ) α n + c n μ n + δ n , n 0 ,
where { c n } is a sequence in [ 0 , 1 ] and { μ n } is a sequence in R such that
n = 1 c n = , lim sup n μ n 0 , δ n 0 , and n = 1 δ n < .
Then lim n α n = 0 .
Lemma 6.
Let { γ p } be a sequence of real numbers that has a subsequence { γ p k } which satisfies γ p k < γ p k + 1 for all k N . There exists an increasing sequence of integers { τ ( p ) } p p 0 satisfying:
lim p τ ( p ) = , γ τ ( p ) γ τ ( p ) + 1 , γ p γ τ ( p ) + 1 , p p 0 .

3. Fixed Points and Variational Inequalities

In this section we state and prove our main results. To do this, we first consider the following property.
A mapping G satisfies Condition A if u p G u p 0 whenever { u p } is a bounded sequence such that
u p u * ( 1 ν ) u p + ν G u p u * 0
for some u * F i x ( G ) and ν [ 0 , 1 ] .
Theorem 1.
Let H be a Hilbert space and C be a closed convex subset of H . Let F : C C be a nonexpansive mapping and G : C C be a β-demicontractive mapping satisfying Condition A such that I G is demiclosed at 0 . Assume that F i x ( F ) F i x ( G ) . Let { a p } and { b p } be sequences in [ 0 , 1 ] such that a p 0 and p = 1 a p = . Let { u p } be the sequence generated in the following manner:
x , u 1 C , u p + 1 = a p x + ( 1 a p ) [ b p F u p + ( 1 b p ) ( ( 1 α ) u p + α G u p ) ] , p 1 .
Then, the following assertions hold.
(I)
If p = 1 ( 1 b p ) < and p = 1 | a p = a p + 1 | < , then { u p } strongly converges to u * F i x ( F ) which is the unique point in F i x ( F ) that solves the variational inequality
u * x , u u * 0 , u F i x ( F ) ,
i.e. u * = P F i x ( F ) x .
(II)
If p = 1 ( 1 b p ) < and b p a p 0 , then { u p } converges strongly to v * F i x ( G ) which is the unique point in F i x ( G ) that solves the variational inequality
u * x , u v * 0 , u F i x ( G ) ,
i.e. v * = P F i x ( G ) x .
(III)
If lim inf p b p ( 1 b p ) > 0 , then { u p } strongly converges to u ¯ F i x ( F ) F i x ( G ) that is the unique solution of the variational inequality
u ¯ x , u u ¯ 0 , u F i x ( F ) F i x ( G ) ,
i.e. u ¯ = P F i x ( F ) F i x ( G ) x .
Proof. 
Since G is a β -demicontractive mapping, by Lemma 2 it follows that the averaged mapping G α = ( 1 α ) I + α G is quasi-nonexpansive, for α ( 0 , 1 β ) . Clearly, G α I is demiclosed at zero. One can also see that G α is strongly quasi-nonexpansive from the fact that G satisfies Condition A. Now we can write
u p + 1 = a p x + ( 1 a p ) [ b p F u p + ( 1 b p ) G α u p ] , p N .
Let w be a common fixed point of F and G α . Define
T p = b p F + ( 1 b p ) G α , p N .
For all p N ,
u p + 1 w = a p x + ( 1 a p ) T p u p w ( 1 a p ) u p w + a p x w max { u p w , x w } max { u 1 w , x w } ,
that is, { u p } is a bounded sequence.
Furthermore, since a p 0 as p , we have
u p + 1 T p u p = a p ( x T p u p ) 0 , as p .
To prove (I), for all p N compute
u p + 1 u p = ( 1 a p ) ( T p u p T p 1 u p 1 ) ( a p a p 1 ) T p 1 u p 1 + ( a p a p 1 ) x = ( 1 a p ) ( T p u p T p 1 u p 1 ) + ( a p 1 a p ) [ T p 1 u p 1 x ] = ( a p 1 a p ) [ T p 1 u p 1 x ] = + ( 1 a p ) [ b p F u p + ( 1 b p ) G α F u p b p 1 F u p 1 ( 1 b p 1 ) G α u p 1 ] = ( a p 1 a p ) [ T p 1 u p 1 x ] + ( 1 a p ) [ b p ( F u p F u p 1 ) = + ( 1 b p ) ( G α u p G α u p 1 ) + ( b p b p 1 ( F u p 1 G α u p 1 ) ] ] | a p 1 a p | T p 1 u p 1 x + ( 1 a p ) [ b p u p u p 1 = + ( 1 b p ) G α u p G α u p 1 + | b p b p 1 | F u p 1 G α u p 1 ] = ( 1 c p ) u p u p 1 + μ p ,
where c p = 1 b p + a p b p and
μ p = | a p 1 a p | T p 1 u p 1 x + ( 1 a p ) [ ( 1 b p ) + | b p b p 1 | F u p 1 G α u p 1 ] .
We see that c p 0 , p = 1 c p = and p = 1 μ p < . Hence, by Lemma 5 we conclude that u p + 1 u p 0 . This and (12) imply that
u p T p u p 0 .
Moreover,
u p T p u p = u p b p F u p ( 1 b p ) u p b p F u p ( 1 b p ) G α u p , u p b p F u p u p T p u p + ( 1 b p ) G α u p ,
and thus, from the hypothesis that p = 1 ( 1 b p ) < , we also have
u p b p F u p 0 .
We can conclude that u p F u p 0 . Hence, any weak limit of { u p } is in F i x ( F ) .
Let { u p k } be a subsequence of { u p } such that
lim sup p u p u * , x u * = lim k u p k u * , x u *
and u p k y . Thus, y F i x ( F ) and
lim sup p u p u * , x u * = y u * , x u * ,
which is nonpositive by the definition of u * . We obtain
lim sup p T p u p u * , x u * = lim sup p [ u p u * , x u * + T p u p u p , x u * ] = lim sup p u p u * , x u * 0 .
Finally,
u p + 1 u * 2 = ( 1 a p ) ( T p u p u * ) + a p ( x u * ) 2 = ( 1 a p ) 2 T p u p u * 2 + a p 2 x u * 2 = + 2 a p ( 1 a p ) ( T p u p u * ) , x u * = ( 1 a p ) 2 b p ( F u p u * ) + ( 1 b n ) ( G α u p u * ) 2 + a p 2 x u * 2 = + 2 a p T p u p u * , x u * 2 a p 2 T p u p u * , x u * ( 1 a p ) 2 b p u p u * + ( 1 b p ) G α u p u * 2 + a p 2 x u * 2 = + 2 a p T p u p u * , x u * ( 1 a p ) 2 u p u * 2 + ( 1 b p ) G α u p u * ) 2 + a p x u * 2 = + 2 a p T p u p u * , x u * = ( 1 t p ) u p u * 2 + t p r p + s p ,
where
t p = 2 a p a p 2 , r p = a p x u * 2 + 2 T p u p u * , x u * , s p = ( 1 b p ) G α u p u * 2 .
Now, Lemma 5 implies that u p u * .
To prove (II), let v * be the unique solution of the variational inequality (10) and compute
u p + 1 v * 2 = a n x + ( 1 a n ) T p u p v * + a p v * a p v * 2 = a p ( x v * ) + ( 1 a n ) ( T p u p v * ) 2 ( 1 a n ) 2 ( T p u p v * ) 2 + 2 a p x v * , u p + 1 v * = ( 1 a n ) 2 b p ( F u p v * ) + ( 1 b p ) ( G α u p v * ) 2 = + 2 a p x v * , u p + 1 v * ( 1 a p ) 2 u p v * 2 + b p F u p v * 2 = = + 2 a p x v * , u p + 1 v *
We have two cases, namely, the sequence { u p v * } is eventually not increasing or not eventually not increasing.
Case (II) 1. There exists p 0 N such that u p + 1 v * u p v * for all p p 0 . Put
φ p = 2 u p + 1 v * , x v * , and μ p = ( 1 b p ) ( G α u p v * ) 2 .
Since ( 1 a p ) 2 ( 1 a p ) , we have
u p + 1 v * 2 ( 1 a p ) u p v * 2 + a p φ p + μ p .
Since { u p v * } is not eventually increasing, lim p u p v * exists. Thus,
0 = lim p ( u p + 1 v * u p v * ) lim inf p ( a p x v * + ( 1 a n ) T p u p v * u p v * ) = lim inf p ( T p u p v * u p v * ) = lim inf p ( b p ( F u p v * ) + ( 1 b p ) ( G α u p v * ) u p v * ) = lim inf p ( G α u p v * u p v * ) = lim sup p ( u p v * u p v * ) = 0
Hence,
lim p ( G α u p v * u p v * ) = 0 .
From the strong quasi-nonexpansiveness of G α , we conclude that
G α u p u p 0 .
The rest of the proof is similar to the proof of (I).
Case (II) 2. The sequence { u p v * } is not eventually not increasing. There exists a subsequence { u p k v * } such that u p k v * < u p k + 1 v * for all k N . By Lemma 6, there exists an increasing sequence of integers { τ ( p ) } satisfying
lim p τ ( p ) = , u τ ( p ) v * u τ ( p ) + 1 v * u p v * u τ ( p ) + 1 v * , p p 0 .
Thus,
0 lim inf p ( u τ ( p ) + 1 v * u τ ( p ) v * ) .
Using (16) with τ ( p ) instead of p , we obtain
lim p G α u τ ( p ) v * u τ ( p ) v * = 0 .
The strong quasi-nonexpasiveness of G α implies
G α u τ ( p ) u τ ( p ) 0 ,
Since I G α is demiclosed at 0 , we conclude that
lim sup p u τ ( p ) + 1 v * , x v * 0 .
One may observe that
u τ ( p ) + 1 u τ ( p ) = a τ ( p ) x u τ ( p ) + ( 1 a τ ( p ) ) b τ ( p ) O ( 1 ) = + ( 1 a τ ( p ) ) G α u τ ( p ) τ ( p ) ,
where O ( 1 ) represents a bounded sequence. Thus, from (18) it follows that
u τ ( p ) + 1 u τ ( p ) 0 .
Replacing p by τ ( p ) in (15) yields
u τ ( p ) + 1 v * ( 1 a τ ( p ) ) 2 u τ ( p ) v * 2 = + 2 a τ ( p ) u τ ( p ) + 1 v * , x v * + b τ ( p ) F u τ ( p ) v * 2 ( 1 a τ ( p ) ) 2 u τ ( p ) + 1 v * 2 = + 2 a τ ( p ) u τ ( p ) + 1 v * , x v * + b τ ( p ) F u τ ( p ) v * 2 .
As a consequent, we have
2 a τ ( p ) u τ ( p ) + 1 v * 2 ( a τ ( p ) ) 2 u τ ( p ) + 1 v * 2 = + 2 a τ ( p ) u τ ( p ) + 1 v * , x v * + b τ ( p ) F u τ ( p ) v * 2 .
Dividing by a τ ( p ) gives
0 2 u τ ( p ) + 1 v * 2 a τ ( p ) u τ ( p ) + 1 v * 2 = + 2 a τ ( p ) u τ ( p ) + 1 v * , x v * + b τ ( p ) a τ ( p ) F u τ ( p ) v * 2 .
Since b p / a p 0 , by (19) we obtain
lim p u τ ( p ) v * lim p u τ ( p ) + 1 v * = 0 .
From (17), we obtain that u p v * .
To prove (III), let u ¯ be the unique point in F i x ( F ) F i x ( G ) that satisfies the variational inequality (11). We have
T p u p u ¯ 2 = b p ( F u p u ¯ ) + ( 1 b p ) ( G u p u ¯ 2 = b p F u p u ¯ 2 + ( 1 b p ) G α u p u ¯ 2 b p ( 1 b p ) F u p G α u p 2 u p u ¯ 2 b p ( 1 b p ) F u p G α u p 2 ,
u p + 1 u ¯ 2 = a p ( x u ¯ ) + ( 1 a p ) ( T p u p u ¯ 2 ( 1 a p ) 2 T p u p u ¯ 2 + a p 2 x u ¯ 2 + a p ( x u ¯ ) ( T p u p u ¯ ) u p u ¯ 2 b p ( 1 b p ) F u p G α u p 2 = = + a p 2 x u ¯ 2 + a p ( x u ¯ ) ( T p u p u ¯ ) .
Similar to (II), we have two cases.
Case (III) 1.  { u p u ¯ } is eventually not increasing. There exists p 0 N such that u p + 1 u ¯ u p u ¯ , for all n n 0 . Thus, lim p u p u ¯ exists. We have
b p ( 1 b p ) F u p G u p u p u ¯ 2 u p + 1 u ¯ 2 + a p 2 x u ¯ 2 + a p ( x u ¯ ) ( T p u p u ¯ ) .
Since lim inf p b p ( 1 b p ) > 0 , we have
F u p G α u p 0 .
Moreover,
0 = lim p ( u p + 1 u ¯ u p u ¯ ) lim inf p ( a p x u ¯ + ( 1 a p ) T p u p u ¯ u p u ¯ ) = lim inf p ( T p u p u ¯ u p u ¯ ) = lim inf p ( b p ( F u p u ¯ + ( 1 b p ) ( G α u p u ¯ ) u p u ¯ ) lim inf p ( b p ( F u p u ¯ u p u ¯ ) + ( 1 b p ) ( G α u p u ¯ u p u ¯ ) ) lim sup p ( b p ( F u p u ¯ u p u ¯ ) + ( 1 b p ) ( G α u p u ¯ u p u ¯ ) ) 0
Therefore
lim p ( b p ( F u p u ¯ u p u ¯ ) + ( 1 b p ) ( G α u p u ¯ u p u ¯ ) ) = 0 .
It follows that
lim p ( b p ( F u p u ¯ u p u ¯ ) = lim p ( 1 b p ) ( G α u p u ¯ u p u ¯ ) ) = 0 .
Thus,
lim p ( ( F u p u ¯ u p u ¯ ) = lim p ( G α u p u ¯ u p u ¯ ) ) = 0 .
From strong quasi-nonexpansiveness of G α it follows
S u p u p 0 .
Since u p F u p = u p G α u p + G α u p F u p , we obtain
u p F u p 0 .
Choose a subsequence u p k z such that
lim sup p u p u ¯ , x u ¯ = lim p u p k u ¯ , x u ¯ = z u ¯ , x u ¯ .
Since both F and G α are demiclosed at 0 and by (24), (25), one can conclude that z F i x ( F ) F i x ( G α ) . Hence, by the definition of u ¯ , we obtain (26). Furthermore, from (24) and (25) we have
T p u p u p 0 .
Finally
u p + 1 u ¯ 2 = ( 1 a p ) ( T p u p u ¯ ) + a p ( x u ¯ ) = ( 1 a p ) 2 T p u p u ¯ 2 + a p 2 x u ¯ 2 + 2 a p ( 1 a p ) ( T p u p u ¯ ) , x u ¯ ( 1 a p ) 2 u p u ¯ 2 + a p 2 [ x u ¯ 2 2 T p u p u ¯ , x u ¯ ] = + 2 a p T p u p u p , x u ¯ + 2 a p u p u ¯ , x u ¯ ( 1 a p ) u p u ¯ 2 + a p [ x u ¯ 2 2 T p u p u ¯ , x u ¯ ] = + 2 a p T p u p u p , x u ¯ + 2 a p u p u ¯ , x u ¯ .
Putting
s p = 1 ( 1 a p ) 2 , σ p = 2 T p u p u p , x p 0 + 2 u p u ¯ , x u ¯ + a p [ x u ¯ 2 2 T p u p u ¯ , x u ¯ ] ,
the conclusion follows from Lemma 5.
Case (III) 2. The sequence { u p u ¯ } is not eventually not increasing, i.e., there exists a subsequence { u p k u ¯ } such that u p k u ¯ < u p k + 1 u ¯ , j N .
Lemma 6 implies that there exists an increasing sequence of integers { τ ( p ) } p N satisfying (17). Therefore
o lim inf p ( u τ ( p ) + 1 u ¯ u τ ( p ) u ¯ ) lim sup p ( u τ ( p ) + 1 u ¯ u τ ( p ) u ¯ ) lim sup p ( u p + 1 u ¯ u p u ¯ ) lim sup p ( ( 1 a p ) ( T p u p u ¯ ) + a p ( x u ¯ ) u p u ¯ ) lim sup p ( ( 1 a p ) u p u ¯ + a p x u ¯ u p u ¯ ) = 0
We obtain
lim p ( u τ ( p ) + 1 u ¯ u τ ( p ) u ¯ ) = 0
Now, using (24) with τ ( p ) instead of p , we have
G α u τ ( p ) u τ ( p ) 0 ,
and (20) can be written as
0 b τ ( p ) ( 1 b τ ( p ) ) F u τ ( p ) G α u τ ( p ) 2 u τ ( p ) u ¯ 2 u τ ( p ) + 1 u ¯ 2 + a p x u ¯ 1 + ( T p u p u ¯ ) .
From (27) and since lim inf p b p ( 1 b p ) > 0 ,
F u τ ( p ) G α u τ ( p ) 0 .
We also obtain that
u τ ( p ) F u τ ( p ) = u τ ( p ) G α u τ ( p ) + G α u τ ( p ) F u τ ( p ) .
By (28) and (29), we have that
u τ ( p ) F u τ ( p ) 0 and u τ ( p ) T τ ( p ) u τ ( p ) 0 .
Similar to (26) changing τ ( p ) with p , we have
lim sup p u τ ( p ) u ¯ , x u ¯ 0 .
Following the same proof of (26), replacing p with τ ( p ) , we obtain
lim sup p u τ ( p ) u ¯ , x u ¯ 0 .
Now we compute,
u τ ( p ) + 1 u ¯ 2 ( 1 a τ ( p ) ) 2 u τ ( p ) u ¯ 2 = + a τ ( p ) 2 [ x u ¯ 2 2 T τ ( p ) u τ ( p ) u ¯ , x u ¯ ] = + 2 a τ ( p ) T τ ( p ) u τ ( p ) u τ ( p ) , x u ¯ + 2 a τ ( p ) u τ ( p ) u ¯ , x u ¯ ( 1 a τ ( p ) ) 2 u τ ( p ) + 1 u ¯ 2 = + a τ ( p ) 2 [ x u ¯ 2 2 T τ ( p ) u τ ( p ) u ¯ , x u ¯ ] = + 2 a τ ( p ) T τ ( p ) u τ ( p ) u τ ( p ) , x u ¯ + 2 a τ ( p ) u τ ( p ) u ¯ , x u ¯
Consequently,
2 a τ ( p ) u τ ( p ) + 1 u ¯ 2 a τ ( p ) 2 [ x u ¯ 2 2 T τ ( p ) u τ ( p ) u ¯ , x u ¯ ] = + 2 a τ ( p ) u τ ( p ) u ¯ , x u ¯ = + 2 a τ ( p ) T τ ( p ) u τ ( p ) u τ ( p ) , x u ¯
dividing by a τ ( p ) , we get
0 2 u τ ( p ) + 1 u ¯ 2 a τ ( p ) [ x u ¯ 2 2 T τ ( p ) u τ ( p ) u ¯ , x u ¯ ] + 2 u τ ( p ) u ¯ , x u ¯ = + 2 T τ ( p ) u τ ( p ) u τ ( p ) , x u ¯
Taking the limsup and recalling the hypothesis (30) and (31), we obtain
lim p u τ ( p ) u ¯ lim p u τ ( p ) + 1 u ¯ = 0
Now by (17), we conclude that u p u ¯ .
A more general result could be proved similarly to the proof of Theorem 1.
Theorem 2.
Let H be a Hilbert space and C be a closed convex subset of H . Let F : C C be a k-strictly pseudocontractive mapping and G : C C be a β-demicontractive mapping satisfying Condition A such that I G is demiclosed at 0 . Assume that F i x ( F ) F i x ( G ) . Let { a p } and { b p } be sequences in [ 0 , 1 ] such that a p 0 and p = 1 a p = . Let { u p } be a sequence generated in the following manner:
x , u 1 C , u p + 1 = a p x + ( 1 a p ) [ b p F λ u p + ( 1 b p ) ( ( 1 α ) u p + α G u p ) ] , p 1 .
where F λ u = ( 1 λ ) u + λ F u , with λ ( 0 , 1 k ) .
Then, the following assertions hold.
(I)
If p = 1 ( 1 b p ) < , p = 1 | a p = a p + 1 | < , then { u p } strongly converges to u * F i x ( F ) that is the unique point in F i x ( F ) that solves the variational inequality
u * x , u u * 0 , u F i x ( F ) ,
i.e. u * = P F i x ( F ) x .
(II)
If p = 1 ( 1 b p ) < , b p a p 0 , then { u p } converges strongly to v * F i x ( G ) that is the unique point in F i x ( G ) that solves the variational inequality
v * x , u v * 0 , u F i x ( G ) ,
i.e. v * = P F i x ( G ) x .
(III)
If lim inf p b p ( 1 b p ) > 0 , then { u p } strongly converges to u ¯ F i x ( F ) F i x ( G ) that is the unique solution of the variational inequality
u ¯ x , u u ¯ 0 , u F i x ( F ) F i x ( G ) ,
i.e. u ¯ = P F i x ( F ) F i x ( G ) x .
Proof. 
As F is k-strictly pseudocontractive, by Lemma 3 we have that the averaged mapping
F λ u = ( 1 λ ) u + λ F u
is nonexpansive, for any λ ( 0 , 1 k ) and that F i x ( F ) = F i x ( F λ ) . We apply Theorem 1 for F λ and G and get the conclusion. □
Remark 1.
Most of the results obtained in Takahashi and Tamura [21], Moudafi [15], Cianciaruso et al. [7], Falset et al. [8], Iemoto and Takahashi [9] could be obtained as corollaries of our main results or could be slightly improved by considering our averaged Halpern type algorithm (8).
We illustrate this fact in the following for four different instances.
  • If F is nonexpansive and G is nonspreading, then by Theorem 1 we obtain an improvement of Theorem 4.1 in Iemoto and Takahashi [9], in the sense that for our averaged Halpern type algorithm (8) we have strong convergence, while for the Krasnoselsij-Mann iterative procedure (5) only weak convergence was obtained by Iemoto and Takahashi [9];
  • If F is nonexpansive and G is nonspreading, then by Theorem 1 we obtain the main result (i.e., Theorem 14) in Cianciaruso et al. [7];
  • If F and G are both nonexpansive, then by Theorem 1 we obtain an improvement of the main result in Takahashi and Tamura [21], in the sense that for our averaged Halpern type algorithm (8) we get strong convergence, while for the Krasnoselsij-Mann iterative procedure (5) only weak convergence is obtained by Takahashi and Tamura [21];
  • If F is nonexpansive and G is strongly quasi-nonexpansive, then by Theorem 1 we obtain the main result (i.e., Theorem 3) in Falset et al. [8];
  • ...

4. Numerical Illustrations

In this section, we consider some numerical examples to illustrate the numerical behaviour of Algorithm (8), for approximating a common fixed point for a nonexpansive mapping and a β -demicontractive mapping.
Example 2.
Let H be the real line with the usual norm and D = [ 0 , 1 ] . Define F and G on D as follows as
F ( u ) = 5 / 3 u , u D
and
G ( u ) = 5 / 6 , i f 0 u < 1 1 / 3 , if u = 1 .
Note that F is nonexpansive, and G is 1 / 2 -demicontractive. It is easy to check that F i x ( F ) F i x ( G ) = { 5 / 6 } . The mapping G is neither quasi-nonexpasive nor nonexpansive (and hence it is neither strongly quasi-nonexpansive nor nonspeading).
Therefore, we cannot apply any of the results in Takahashi and Tamura [21], Moudafi [15], Cianciaruso et al. [7], Falset et al. [8], Iemoto and Takahashi [9] etc. to solve the common fixed point problem for F and G.
If we put
a p = 1 r p , b p = 2 p 1 + 3 p , p N , r R and r 1 ,
then all assumptions in Theorem 1 part (iii) are satisfied. This implies that the sequence { u p } generated by the algorithm (8) converges to 5 / 6 , the unique common fixed point of F and G.
Several numerical experiments were conducted in MATLAB using the algorithm(8)with different values of the parameters.
The numerical results for three initial values with r = 1000 are presented in Table 1.
Table 2 shows numerical results for three initial values with r = 5000 and x = 0.7 . One can see that for x near the common fixed point and r large, the iterations converge faster.

5. Conclusions

  • We have introduced an averaged iterative Halpern type algorithm intended to find a common fixed point for a pair consisting of a nonexpansive mapping and a demicontractive mapping which also solves a certain variational inequality problem;
  • We established a strong convergence theorem (Theorem 1) for the sequence generated by our algorithm;
  • We extended Theorem 1 to the more general case of a pair of mappings consisting of a k-strictly pseudocontractive mapping F and a β -demicontractive mapping G (Theorem 2), by considering the double averaged Halpern type algorithm (32).
  • We validated the effectiveness of our general theoretical results by some appropriate numerical experiments, corresponding to part (iii) of Theorem 1, which are reported in Section 4. These results clearly illustrate the progress of our convergence results over existing literature.
  • For other related results we refer the reader to Agwu et al. [1], Araveeporn et al. [2], Ceng and Yao [5], Ceng and Yuan [6], Jaipranop and Saejung [10], Kraikaew and Saejung [12], Mebawondu et al. [14], Nakajo et al. [17], Petruşel and Yao [18], Rizvi [19], Sahu et al. [20], Thuy [22], Uba et al. [23], Xu [25], Yao et al. [26,27], Yotkaew et al. [28],...

Acknowledgments

The first draft of this paper was carried out during the first author’s short visit (December 2023) at the Department of Mathematics, King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia. He is grateful to Professor Monther Alfuraidan, the Chairman of Department of Mathematics, for the invitation and for providing excellent facilities during the visit.

Conflicts of Interest

The authors declare that they have no conflict of interest.

Funding

Not applicable.

Data Availability Statement

Not applicable.

References

  1. Agwu, I.K.; Işık, H.; Igbokwe, D. I. Weak and strong convergence theorems for a new class of enriched strictly pseudononspreading mappings in Hilbert spaces. Fixed Point Theory Algorithms Sci. Eng. 2024, 14. [Google Scholar] [CrossRef]
  2. Araveeporn, A.; Kheawborisut, A.; Kangtunyakarn, A. Approximating G-variational inequality problem by G-subgradient extragradient method in Hilbert space endowed with graphs. Carpathian J. Math. 2023, 39, 359–369. [Google Scholar] [CrossRef]
  3. Berinde, V. , Approximating fixed points of demicontractive mappings via the quasi-nonexpansive case. Carpathian J. Math. 2023, 39, 73–84. [Google Scholar] [CrossRef]
  4. Berinde, V. On a useful lemma that relates quasi-nonexpansive and demicontractive mappings in Hilbert spaces. Creat. Math. Inform. 2024, 33, 7–21. [Google Scholar] [CrossRef]
  5. Ceng, L.-C.; Yao, J.-C. An extragradient-like approximation method for variational inequality problems and fixed point problems. Appl. Math. Comput. 2007, 190, 205–215. [Google Scholar] [CrossRef]
  6. Ceng, L.-C.; Yuan, Q. Composite inertial subgradient extragradient methods for variational inequalities and fixed point problems. J. Inequal. Appl. 2019, 20, 274. [Google Scholar] [CrossRef]
  7. Cianciaruso, F. , Marino G., Rugiano A. and Scardamaglia B., On strong convergence of Halpern’s method using averaged type mappings. J. Appl. Math 2014. [Google Scholar] [CrossRef]
  8. Falset, J. G, Llorens-Fuster E., Marinob G. and Rugiano A. On strong convergence of Halpern’s method for quasi-nonexpansive mappings in Hilbert spaces. Math. Model. Anal. 2016, 21, 63–82. [Google Scholar] [CrossRef]
  9. Iemoto, S. and Takahashi W. Approximating common fixed points of nonexpansive mappings and nonspreading mappings in a Hilbert space. Nonlinear Anal. 2009, 71, e2082–e2089. [Google Scholar] [CrossRef]
  10. Jaipranop, Ch.; Saejung, S. On Halpern-type sequences with applications in variational inequality problems. Optimization 2022, 71, 675–710. [Google Scholar] [CrossRef]
  11. Khammahawong, K.; Salisu, S. Modified Halpern and viscosity methods for hierarchical variational inequalities on Hadamard manifolds. Comput. Appl. Math. 2024, 43, 1. [Google Scholar] [CrossRef]
  12. Kraikaew, R.; Saejung, S. Strong convergence of the Halpern subgradient extragradient method for solving variational inequalities in Hilbert spaces. J. Optim. Theory Appl. 2014, 163, 399–412. [Google Scholar] [CrossRef]
  13. Maingé, P.E. Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization. Set-Valued Analysis 2008, 16, 899–912. [Google Scholar] [CrossRef]
  14. Mebawondu, A.A.; Jolaoso, L.O.; Abass, H.A.; Oyewole, O. K; Aremu, K. O. A strong convergence Halpern-type inertial algorithm for solving system of split variational inequalities and fixed point problems. J. Appl. Anal. Comput. 2021, 11, 2762–2791. [Google Scholar]
  15. Moudafi, A. Krasnoselski-Mann iteration for hierarchical fixed-point problems. Inverse Problems 2007, 23, 1635–1640. [Google Scholar] [CrossRef]
  16. Moudafi, A, A note on the split common fixed-point problem for quasi-nonexpansive operators. Nonlinear Anal. 2011, 74, 4083–4087. [CrossRef]
  17. Nakajo, K.; Shimoji, K.; Takahashi, W. Strong convergence theorems of Halpern’s type for families of nonexpansive mappings in Hilbert spaces. Thai J. Math. 2009, 7, 49–67. [Google Scholar]
  18. Petruşel, A.; Yao, J.-C. An extragradient iterative scheme by viscosity approximation methods for fixed point problems and variational inequality problems. Cent. Eur. J. Math. 2009, 7, 335–347. [Google Scholar] [CrossRef]
  19. Rizvi, S. H. A strong convergence theorem for split mixed equilibrium and fixed point problems for nonexpansive mappings. J. Fixed Point Theory Appl. 2018, 20, 8. [Google Scholar] [CrossRef]
  20. Sahu, D.R.; Kumar, A.; Wen, C.-F. S-iteration process of Halpern-type for common solutions of nonexpansive mappings and monotone variational inequalities. Filomat 2019, 33, 1727–1746. [Google Scholar] [CrossRef]
  21. Takahashi, W.; Tamura, T. Convergence theorems for a pair of nonexpansive mappings. J. Convex Anal. 1998, 5, 45–56. [Google Scholar]
  22. Thuy, N. T. T. A strongly convergent shrinking descent-like Halpern’s method for monotone variational inequality and fixed point problems. Acta Math. Vietnam. 2014, 39, 379–391. [Google Scholar] [CrossRef]
  23. Uba, M.O.; Onyido, M.A.; Udeani, C.I.; Nwokoro, P. U. A hybrid scheme for fixed points of a countable family of generalized nonexpansive-type maps and finite families of variational inequality and equilibrium problems, with applications. Carpathian J. Math. 2023, 39, 281–292. [Google Scholar] [CrossRef]
  24. Xu, H. Iterative algorithms for nonlinear operators. J. London Math. Soc. 2002, 66, 240–256. [Google Scholar] [CrossRef]
  25. Xu, H.-K. Viscosity method for hierarchical fixed point approach to variational inequalities. Taiwanese J. Math. 2010, 14, 463–478. [Google Scholar] [CrossRef]
  26. Yao, Y.H.; Liou, Y.-C.; Yao, J.-C. An extragradient method for fixed point problems and variational inequality problems. J. Inequal. Appl. 2007, 12, 38752. [Google Scholar] [CrossRef]
  27. Yao, Y.H.; Shahzad, N.; Postolache, M.; Yao, J.-C. Convergence of self-adaptive Tseng-type algorithms for split variational inequalities and fixed point problems. Carpathian J. Math. 2024, 40, 753–768. [Google Scholar] [CrossRef]
  28. Yotkaew, P.; Rehman, H. Ur; Panyanak, B.; Pakkaranang, N. Halpern subgradient extragradient algorithm for solving quasimonotone variational inequality problems. Carpathian J. Math. 2022, 38, 249–262. [Google Scholar] [CrossRef]
  29. Zeng, L.-C.; Yao, J.-C. Strong convergence theorem by an extragradient method for fixed point problems and variational inequality problems. Taiwanese J. Math. 2006, 10, 1293–1303. [Google Scholar] [CrossRef]
  30. Zhou, H. Convergence theorems of fixed points for κ-strict pseudo-contractions in Hilbert spaces. Nonlinear Anal. 2008, 69, 456–462. [Google Scholar] [CrossRef]
Table 1. Numerical results for x = 0.2 , r = 1000 with initial values u 0 = 1 , u 0 = 0.7 and u 0 = 0.1 .
Table 1. Numerical results for x = 0.2 , r = 1000 with initial values u 0 = 1 , u 0 = 0.7 and u 0 = 0.1 .
Iteration (p) u p u p u p
0 1.000000 0.700000 0.100000
1 0.786549 0.822542 0.774552
2 0.837948 0.834349 0.839148
3 0.832452 0.833106 0.832234
4 0.833503 0.833354 0.833553
5 0.833264 0.833303 0.833251
6 0.833332 0.833321 0.833335
7 0.833316 0.833319 0.833315
8 0.833323 0.833322 0.833323
9 0.833323 0.833323 0.833322
10 0.833324 0.833324 0.833324
15 0.833327 0.833327 0.833327
20 0.833329 0.833329 0.833329
50 0.833332 0.833332 0.833332
51 0.833332 0.833332 0.833332
111 0.833333 0.833333 0.833333
112 0.833333 0.833333 0.833333
Table 2. Numerical results for x = 0.7 , r = 5000 with initial values u 0 = 1 , u 0 = 0.7 and u 0 = 0.1 .
Table 2. Numerical results for x = 0.7 , r = 5000 with initial values u 0 = 1 , u 0 = 0.7 and u 0 = 0.1 .
Iteration (p) u p u p u p
0 1.000000 0.700000 0.100000
1 0.786649 0.822642 0.774652
2 0.837988 0.834389 0.839188
3 0.832478 0.833133 0.832260
4 0.833522 0.833373 0.833572
5 0.833279 0.833318 0.833266
6 0.833344 0.833330 0.833348
7 0.833326 0.833330 0.833325
8 0.833332 0.833331 0.833332
9 0.833332 0.833331 0.833332
10 0.833332 0.833331 0.833332
15 0.833332 0.833332 0.833332
20 0.833332 0.833332 0.833332
26 0.833333 0.833333 0.833333
27 0.833333 0.833333 0.833333
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

© 2024 MDPI (Basel, Switzerland) unless otherwise stated