Next Article in Journal
Modified Information Criterion for Testing Changes in the Inverse Gaussian Degradation Process
Next Article in Special Issue
Convergence of Infinite Products of Uniformly Locally Nonexpansive Mappings
Previous Article in Journal
An Efficient Target-to-Area Classification Strategy with a PIP-Based KNN Algorithm for Epidemic Management
Previous Article in Special Issue
A New Approach for Proximal Split Minimization Problems
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

The Krasnoselskii–Mann Method for Approximation of Coincidence Points of Set-Valued Mappings

by
Alexander J. Zaslavski
Department of Mathematics, The Technion-Israel Institute of Technology, Haifa 32000, Israel
Mathematics 2025, 13(4), 662; https://doi.org/10.3390/math13040662
Submission received: 28 December 2024 / Revised: 4 February 2025 / Accepted: 16 February 2025 / Published: 18 February 2025
(This article belongs to the Special Issue Applied Functional Analysis and Applications: 2nd Edition)

Abstract

:
In the present paper, we use the Krasnoselskii–Mann method in order to obtain approximate coincidence points of set-valued mappings in metric spaces with a hyperbolic structure.

1. Introduction

The fixed point theory of nonlinear operators has been a rapidly growing area of research. The starting point of this theory is Banach’s classical theorem [1] concerning the existence of a unique fixed point for a strict contraction. The main goals of this theory are to show the existence of a fixed point for a given nonlinear mapping and to construct an iterative process which generates an approximate fixed point and, in some cases, converges to a fixed point of the mapping [2,3,4,5,6,7,8,9,10]. Fixed point theory contains the study of various classes of nonlinear common fixed point problems which have applications in engineering, medical and the natural sciences [9,10,11,12,13,14,15,16,17,18]. In this paper, we study the Krasnoselskii–Mann method, which is of great importance and interest [19,20,21,22,23,24,25], in order to obtain approximate coincidence points of set-valued mappings in metric spaces with a hyperbolic structure. It should be mentioned that the study of coincidence points of nonlinear mappings is an important topic in fixed point theory [26,27,28,29,30,31]. Krasnoselskii–Mann iterations for a construction of approximate fixed points of a (quasi)-nonexpansive operator in a Hilbert space were independently introduced by Mann in 1953 [23] and by Krasnoselskii in 1955 [22]. Their weak convergence is well known in the literature. Krasnoselskii–Mann iterations are important for numerical optimization and variational analysis, where many problems can be reduced to finding fixed points of appropriate operators. In the current paper, our goal is to show that most of iterates obtained by the Krasnoselskii–Mann method are approximate coincidence points of set-valued mappings in metric spaces with a hyperbolic structure.
Assume that ( X , d ) is a metric space. For each x X and each r > 0 set
B ( x , r ) = { y X : d ( x , y ) r } .
For each x X and each set E X put
d ( x , E ) = inf { d ( x , y ) : y E } .
Assume that d ( x , ) = , x X . For each mapping P : X X set P 0 ( x ) = x for each x X and for each integer i 0 define P i + 1 = P P i . Denote the cardinality of a set E with Card ( E ) . We assume that the sum over an empty set is zero and that the infimum of an empty set is equal to infinity.
A W-space is a structure ( X , d , W ) where ( X , d ) is a metric space and W : X × X × [ 0 , 1 ] X . We think of W ( x , y , λ ) as a convex combination of the points x , y X with the coefficients 1 λ , λ and use the notation
W ( x , y , λ ) : = ( 1 λ ) x λ y , x , y X , λ [ 0 , 1 ] .
A W-space ( X , d , W ) is called a W-hyperbolic space [32] if for all x , y , w , z X and all λ , λ ˜ [ 0 , 1 ] the following properties hold:
(W1) d ( z , ( 1 λ ) x λ y ) ( 1 λ ) d ( z , x ) + λ d ( z , y ) ;
(W2) d ( ( 1 λ ) x λ y , ( 1 λ ˜ ) x λ ˜ y ) λ λ ˜ d ( x , y ) ;
(W3) ( 1 λ ) x λ y = λ y ( 1 λ ) x ;
(W4) d ( ( 1 λ ) x λ z , ( 1 λ ) y λ w ) ( 1 λ ) d ( x , y ) + λ d ( z , w ) .
It is obvious that convex subsets of normed spaces are W-hyperbolic spaces. Other examples of W-hyperbolic spaces are hyperbolic spaces [7], Busemann spaces [2], and C A T ( 0 ) spaces [33].
In the following, we assume that ( X , d , W ) is a W-hyperbolic space, which is denoted by X for simplicity.
A nonempty set C X is convex if for each x , y C and each λ [ 0 , 1 ] ,
( 1 λ ) x λ y C .
For each x X , each nonempty set E X and each λ [ 0 , 1 ] , set
λ x ( 1 λ ) E = { λ x ( 1 λ ) y : y E } .
The following result is well-known in the literature [34,35].
Proposition 1. 
Let x , y , w , z X and let λ , λ ˜ [ 0 , 1 ] . Then,
d ( x , ( 1 λ ) x λ y ) λ d ( x , y ) , d ( y , ( 1 λ ) x λ y ) ( 1 λ ) d ( x , y )
and
d ( ( 1 λ ) x λ z , ( 1 λ ˜ ) y λ ˜ w )
( 1 λ ) d ( x , y ) + λ d ( z , w ) + λ λ ˜ d ( y , w ) .
Let X = ( X , d , W ) be a W-hyperbolic space. We assume that the W-hyperbolic space X has a structure ( X , η ) , where η : ( 0 , ) × ( 0 , 2 ] ( 0 , 1 ] is a so-called monotone modulus of uniform convexity (see [2,36,37,38]) such that the following assumptions hold.
(B1) For each r > 0 , each ϵ ( 0 , 2 ] and each x , y , a X , if
d ( x , a ) , d ( y , a ) r   and   d ( x , y ) ϵ r ,
then
d ( 2 1 x 2 1 y , a ) ( 1 η ( r , ϵ ) ) r .
(B2) For each ϵ ( 0 , 2 ] and each numbers s , r satisfying 0 < r s ,
η ( s , ϵ ) η ( r , ϵ ) .
It turns out that this class of spaces is an appropriate setting for obtaining quantitative results on the asymptotic behavior of the Mann iteration for nonexpansive mappings, as well as of the Picard iteration for firmly nonexpansive mappings [2]. It contains uniformly convex normed spaces and CAT(0) space.
In this chapter, we use the following lemma. For its proof, see Lemma 2.1 (iv) of [38].
Lemma 1. 
Let r > 0 , ϵ ( 0 , 2 ] , x , y , a X ,
d ( x , a ) r , d ( y , a ) r , d ( x , y ) ϵ r .
Then, for each λ [ 0 , 1 ] and each s r ,
d ( ( 1 λ ) x λ y , a ) ( 1 2 λ ( 1 λ ) η ( s , ϵ ) ) r .
In the following, we assume that X = ( X , d , W ) is a W-hyperbolic space equipped with the structure ( X , η ) , where η : ( 0 , ) × ( 0 , 2 ] ( 0 , 1 ] is the modulus of uniform convexity. We also assume that (B1) and (B2) hold, C is a nonempty convex set and θ C . For each pair of nonempty sets A , B X put
H ( A , B ) = max { sup { d ( x , B ) : x A } , sup { d ( y , A ) : y B } } .
Clearly, for each triplet of nonempty sets A , B , D X ,
H ( A , B ) = H ( B , A ) ,
H ( A , D ) H ( A , B ) + H ( B , D ) .

2. The Coincidence Point Problem

Assume that S : C C satisfies
S ( C ) = C ,
T : C 2 C { } , T ( x ) is bounded for each x X , p C ,
T ( p ) = { S ( p ) } ,
and that for each x C ,
H ( T ( x ) , T ( p ) ) d ( S ( x ) , S ( p ) ) .
Set
F = { x C : T ( x ) = { S ( x ) } }
and for each ϵ > 0 ,
F ϵ = { x C : T ( x ) B ( S ( x ) , ϵ ) } .
A point belonging to the set F is a solution of our coincidence point problem while a point that belongs to the set F ϵ is its ϵ -approximate coincidence point. In this paper, we use the Krasnoselskii–Mann method in order to generate ϵ -approximate coincidence points and generalize analogous results obtained in [39] in the case when for each x X ,
T ( x ) = { T i ( x ) : ß = 1 , , m } ,
where m is a natural number, for all i = 1 , , m , T i : C C ,
T i ( p ) = S ( p )
and
d ( T i ( x ) , T i ( p ) ) d ( S ( x ) , S ( p ) ) , x C .

3. The Basic Lemma

The following lemma is an important ingredient in our study.
Lemma 2. 
Assume that M 0 > 0 , α , γ ( 0 , 1 ) , u C ,
S ( p ) B ( θ , M 0 ) ,
S ( u ) B ( θ , M 0 ) ,
H ( { S ( u ) } , T ( u ) ) γ ,
ξ T ( u ) ,
d ( ξ , S ( u ) ) 2 1 H ( { S ( u ) } , T ( u ) ) ,
v = ( 1 α ) S ( u ) α ξ
and w C satisfies
S ( w ) = v .
Then,
d ( v , S ( p ) ) 2 M 0
and
d ( S ( w ) , S ( p ) ) = d ( v , S ( p ) ) d ( S ( u ) , S ( p ) ) 2 1 γ α ( 1 α ) η ( 2 M 0 , γ ( 4 M 0 ) 1 ) .
Proof. 
Equations (2), (3), (5), (6), (8), (10), and properties (W1), (W3) imply that
d ( v , S ( p ) ) = d ( ( 1 α ) S ( u ) α ξ , S ( p ) )
( 1 α ) d ( S ( u ) , S ( p ) ) + α d ( ξ , S ( p ) )
( 1 α ) d ( S ( u ) , S ( p ) ) + α H ( T ( u ) , T ( p ) )
d ( S ( u ) , S ( p ) ) 2 M 0 .
From (2), (3), and (7),
γ H ( { S ( u ) } , T ( u ) ) H ( T ( u ) , T ( p ) ) + d ( S ( p ) , S ( u ) ) 2 d ( S ( u ) , S ( p ) ) ,
d ( S ( p ) , S ( u ) ) 2 1 γ .
It follows from (3), (5), and (6) that
H ( T ( u ) , T ( p ) ) d ( S ( u ) , S ( p ) ) 2 M 0 .
We show that
d ( S ( u ) , S ( p ) ) γ / 4 .
Assume the contrary. Then,
d ( S ( u ) , S ( p ) ) < γ / 4
and in view of (3) and (16),
H ( T ( u ) , T ( p ) ) < γ / 4 .
From (2), (3), and (16),
H ( { S ( u ) } , T ( u ) ) H ( T ( u ) , T ( p ) ) + d ( S ( p ) , S ( u ) ) 2 d ( S ( p ) , S ( u ) ) γ / 2 .
This contradicts (7). The contradiction we have reached proves (15). From (7), (9), and (14),
d ( S ( u ) , ξ ) 2 1 H ( { S ( u ) } , T ( u ) ) 2 1 γ γ ( d ( S ( u ) , S ( p ) ) ( 4 M 0 ) 1 .
In view of (3) and (8),
d ( ξ , S ( p ) ) H ( T ( u ) , T ( p ) ) d ( S ( u ) , S ( p ) ) .
Equations (10), (14), (15), (17), (18), and Lemma 1 applied with
x = S ( u ) , y = ξ , a = S ( p ) , r = d ( S ( u ) , S ( p ) ) ,
s = 2 M 0 , ϵ = γ ( 4 M 0 ) 1 , λ = α
imply that
d ( v , S ( p ) ) = d ( ( 1 α ) S ( u ) α ξ , S ( p ) )
( 1 2 α ( 1 α ) η ( 2 M 0 , γ ( 4 M 0 ) 1 ) ) d ( S ( u ) , S ( p ) )
d ( S ( u ) , S ( p ) ) 2 1 α ( 1 α ) η ( 2 M 0 , γ ( 4 M 0 ) 1 ) γ .
Lemma 2 is proven. □

4. The First Main Result

The following theorem shows that our algorithm generates approximate solutions of the coincidence point problem.
Theorem 1. 
Assume that M > 0 ,
S ( p ) B ( θ , M ) ,
{ α i } i = 0 ( 0 , 1 ) , { γ i } i = 0 ( 0 , 1 ) ,
lim i γ i = 0 ,
{ x i } i = 0 C ,
S ( x 0 ) B ( θ , M ) ,
for each integer n 0 ,
y n T ( x n ) ,
d ( S ( x n ) , y n ) H ( { S ( x n ) } , T ( x n ) ) γ n ,
S ( x n + 1 ) = ( 1 α n ) S ( x n ) α n y n ,
ϵ ( 0 , 1 ) . Then,
d ( S ( x n ) , S ( p ) ) 2 M , n = 0 , 1 ,
and the following assertion holds.
1. Let n 0 and Q be natural numbers such that
γ n < ϵ / 2   f o r   e a c h   i n t e g e r   n n 0 ,
n = n 0 n 0 + Q 1 α n ( 1 α n )
> 8 M ϵ 1 η 1 ( 6 M , ϵ ( 6 M ) 1 ) .
Then, there exists an integer n { n 0 , , n 0 + Q 1 } such that
x n F ϵ .
2. Assume that Λ ( 0 , 2 1 ) ,
{ α i } i = 0 ( Λ , 1 Λ )
and n 0 is a natural number such that (25) holds. Then,
C a r d ( { n { 0 , 1 , } : x n F ϵ } )
4 M ϵ 1 Λ 2 η 1 ( 6 M , ϵ ( 6 M ) 1 ) + n 0 .
Proof. 
In view of (19) and (21),
d ( S ( x 0 ) , S ( p ) ) d ( S ( x 0 ) , θ ) + d ( θ , S ( p ) ) 2 M .
Properties (W1) and (W3) and (2), (3), (22), and (24) imply that for each integer n 0 ,
d ( S ( x n + 1 ) , S ( p ) ) = d ( ( 1 α n ) S ( x n ) α n y n , S ( p ) )
( 1 α n ) d ( S ( x n ) , S ( p ) ) + α n d ( y n , S ( p ) )
( 1 α n ) d ( S ( x n ) , S ( p ) ) + α n H ( T ( x n ) , T ( p ) )
( 1 α n ) d ( S ( x n ) , S ( p ) ) + α n d ( S ( x n ) , S ( p ) )
= d ( S ( x n ) , S ( p ) ) .
Thus, for each integer n 0 ,
d ( S ( x n + 1 ) , S ( p ) ) d ( S ( x n , S ( p ) ) 2 M
and in view of (19),
d ( S ( x n ) , θ ) 3 M .
Assume that a nonnegative integer n { 0 , 1 , , } and that
γ n ϵ / 2 , x n F ϵ .
From (4) and (30),
T ( x n ) B ( S ( x n ) , ϵ ) , H ( { S ( x n ) } , T ( x n ) ) > ϵ .
It follows from (23), (30), and (31) that
d ( S ( x n ) , y n ) H ( { S ( x n ) } , T ( x n ) ) γ n
H ( { S ( x n ) } , T ( x n ) ) ϵ / 2 2 1 H ( { S ( x n ) } , T ( x n ) ) .
From (19), (24), (28), (31), (32), and Lemma 2 applied with u = x n , α = α n , M 0 = 3 M , γ = ϵ , ξ = y n , and v = ( 1 α n ) S ( x n ) α n y n we have
d ( S ( x n + 1 ) , S ( p ) ) = d ( ( 1 α n ) S ( x n ) α n y n , S ( p ) )
= d ( v , S ( p ) ) d ( S ( x n ) , S ( p ) ) 2 1 ϵ α n ( 1 α n ) η ( 6 M , ϵ ( 6 M ) 1 ) .
Thus, the following property holds:
(P1) if n 0 is an integer, γ n ϵ / 2 and x n F ϵ , then (33) is true.
Let us prove Assertion 1. Assume that it does not hold. Then, for each n { n 0 , , n 0 + Q 1 } ,
x n F ϵ ,
and property (P1) and (25) imply that (33) holds. From (28) and (33),
2 M d ( S ( x n 0 ) , S ( p ) )
d ( S ( x n 0 ) , S ( p ) ) d ( S ( x n 0 + Q ) , S ( p ) )
= n = n 0 n 0 + Q 1 ( d ( S ( x n ) , S ( p ) ) d ( S ( x n + 1 ) , S ( p ) ) )
2 1 ϵ ( n = n 0 n 0 + Q 1 α n ( 1 α n ) ) η ( 6 M , ϵ ( 6 M ) 1 ) ,
n = n 0 n 0 + Q 1 α n ( 1 α n ) 4 M ϵ 1 η 1 ( 6 M , ϵ ( 6 M ) 1 ) .
The relation above contradicts (26). The contradiction we have reached proves Assertion 1.
Let us prove Assertion 2. Recall that
γ n < ϵ / 2   for   each   integer   n n 0 .
Set
E = { n { n 0 , n 0 + 1 , , } : x n F ϵ } .
Let Q > n 0 be an integer,
E Q = E { 0 , , Q } .
Property (P1) and Equations (28) and (33)–(36) imply that
2 M d ( S ( x n 0 ) , S ( p ) ) d ( S ( x n 0 ) , S ( p ) ) d ( S ( x Q + 1 ) , S ( p ) )
= n = n 0 Q ( d ( S ( x n ) , S ( p ) ) d ( S ( x n + 1 ) , S ( p ) ) )
{ d ( S ( x n ) , S ( p ) ) d ( S ( x n + 1 ) , S ( p ) ) : n E Q }
2 1 ϵ η ( 6 M , ϵ ( 6 M ) 1 ) ϵ { α n ( 1 α n ) : n E Q } ,
2 1 Λ 2 ϵ η ( 6 M , ϵ ( 6 M ) 1 ) Card ( E Q ) ,
Card ( E Q ) 4 M Λ 2 ϵ 1 η 1 ( 6 M , ϵ ( 6 M ) 1 ) .
Since Q is an arbitrary natural number larger that n 0 the relation above imply that
Card ( E ) 4 M Λ 2 ϵ 1 η 1 ( 6 M , ϵ ( 6 M ) 1 ) .
Together with (35) this implies that
Card ( { n { 0 , 1 , } : x n F ϵ } )
n 0 + 4 M ϵ 1 Λ 2 η 1 ( 6 M , ϵ ( 6 M ) 1 ) .
Assertion 2 and Theorem 1 are proven. □

5. The Second Main Result

Assume that S : C C satisfies
S ( C ) = C ,
T : C 2 C { } , p C ,
S ( p ) T ( p ) ,
and that for each x C ,
d ( S ( p ) , T ( x ) ) d ( S ( x ) , S ( p ) ) .
Theorem 2. 
Assume that M > 0 ,
S ( p ) B ( θ , M ) ,
{ α i } i = 0 ( 0 , 1 ) , { ϵ i } i = 0 ( 0 , 1 ) ,
n = 0 ϵ n < ,
{ x i } i = 0 C ,
S ( x 0 ) B ( θ , M ) ,
for each integer n 0 ,
y n T ( x n ) ,
d ( S ( p ) , y n ) d ( S ( p ) , T ( x n ) ) + ϵ n ,
S ( x n + 1 ) = ( 1 α n ) S ( x n ) α n y n ,
ϵ ( 0 , 1 ) . Then,
d ( S ( x n ) , S ( p ) ) 2 M + i = 0 ϵ i , n = 0 , 1 ,
and the following assertion holds.
1. Let n 0 be an integer and Q be a natural number such that
n = n 0 n 0 + Q 1 α n ( 1 α n )
> ( 2 M + 3 i = 0 ϵ i ) ϵ 1 η 1 ( 2 M + 2 i = 0 ϵ i , ϵ ( 2 M + 2 i = 0 ϵ i ) 1 ) .
Then, there exists an integer n { n 0 , , n 0 + Q 1 } such that
B ( S ( x n ) , ϵ ) T ( x n ) .
2. Assume that Λ ( 0 , 2 1 ) ,
{ α i } i = 0 ( Λ , 1 Λ ) .
Then,
C a r d ( { n { 0 , 1 , } : B ( S ( x n ) , ϵ ) T ( x n ) } )
( 2 M + 2 i = 0 ϵ i ) ϵ 1 Λ 2 η 1 ( 2 M + 2 i = 0 ϵ i , ϵ ( 2 M + 2 i = 0 ϵ i ) 1 ) .
Proof. 
Let n 0 be an integer. Properties (W1) and (W3) and (39), (44), and (45) imply that
d ( S ( x n + 1 ) , S ( p ) ) = d ( ( 1 α n ) S ( x n ) α n y n , S ( p ) )
( 1 α n ) d ( S ( x n ) , S ( p ) ) + α n d ( y n , S ( p ) )
( 1 α n ) d ( S ( x n ) , S ( p ) ) + α n ϵ n + d ( S ( p ) , T ( x n ) )
( 1 α n ) d ( S ( x n ) , S ( p ) ) + α n d ( S ( x n ) , S ( p ) ) + ϵ n
d ( S ( x n ) , S ( p ) ) + ϵ n .
In view of (40), (44), and (48), for each integer n 0 ,
d ( S ( x n ) , S ( p ) ) d ( S ( x 0 , S ( p ) ) + i = 0 ϵ i 2 M + i = 0 ϵ i .
Set
ϵ 0 = ϵ ( 2 M + 2 i = 0 ϵ i ) 1 .
* Assume that n { 0 , 1 , , } . From (39), (44), and (49),
d ( S ( p ) , y n ) d ( S ( p ) , T ( x n ) ) + ϵ n d ( S ( x n ) , S ( p ) ) + ϵ n
2 M + 2 i = 0 ϵ i .
Assume that
d ( S ( x n ) , y n ) > ϵ .
From (39), (44), and (51),
ϵ < d ( S ( x n ) , y n ) d ( S ( x n ) , S ( p ) ) + d ( S ( p ) , y n )
d ( S ( x n ) , S ( p ) ) + ϵ + d ( S ( p ) , T ( x n ) )
d ( S ( x n ) , S ( p ) ) + ϵ n + d ( S ( x n ) , S ( p ) )
ϵ n + 2 d ( S ( p ) , S ( x n ) ) ,
d ( S ( p ) , S ( x n ) ) 2 1 ϵ ϵ n / 2 .
In view of (49) and (51),
d ( y n , S ( x n ) ) > ϵ = ϵ ( d ( S ( p ) , S ( x n ) ) + ϵ n ) 1 ( d ( S ( p ) , S ( x n ) ) + ϵ n )
ϵ ( 2 M + 2 i = 0 ϵ i ) 1 ( d ( S ( p ) , S ( x n ) ) + ϵ n ) .
From (45), (49), (50), (52), (53), relation ϵ 0 = ϵ ( 2 M + i = 0 ϵ i ) 1 and Lemma 1 applied with x = S ( x n ) , y = y n , a = S ( p ) ,
r = d ( S ( p ) , S ( x n ) ) + ϵ n ,
λ = α n , ϵ = ϵ 0 ,
S = 2 M + 2 i = 0 ϵ i
we have
d ( S ( x n + 1 ) , S ( p ) ) = d ( ( 1 α n ) S ( x n ) α n y n , S ( p ) )
( 1 2 α n ( 1 α n ) η ( 2 M + 2 i = 0 ϵ i , ϵ ( 2 M
+ 2 i = 0 ϵ i ) 1 ) ( d ( S ( x n ) , S ( p ) ) + ϵ n )
d ( S ( x n ) , S ( p ) ) ϵ α n ( 1 α n ) η ( 2 M + 2 i = 0 ϵ i , ϵ ( 2 M + 2 i = 0 ϵ i ) 1 ) + 2 ϵ n
and
d ( S ( x n + 1 ) , S ( p ) )
d ( S ( x n ) , S ( p ) ) ϵ α n ( 1 α n ) η ( 2 M + 2 i = 0 ϵ i , ϵ ( 2 M + 2 i = 0 ϵ i ) 1 ) + 2 ϵ n .
Thus, the following property holds:
(P2) if n 0 is an integer, d ( S ( x n ) , y n ) > ϵ , then (54) is true.
Let us prove Assertion 1. Assume that it does not hold. Then, for each n { n 0 , , n 0 + Q 1 } ,
B ( S ( x n ) , ϵ ) T ( x n ) =
and in view of (43),
d ( S ( x n ) , y n ) > ϵ .
Property (P2), (49), and the relation above imply that for each n { n 0 , , n 0 + Q 1 } , Equation (54) holds. From (54),
2 M + i = 0 ϵ i d ( S ( x n 0 ) , S ( p ) )
d ( S ( x n 0 ) , S ( p ) ) d ( S ( x n 0 + Q ) , S ( p ) )
= n = n 0 n 0 + Q 1 ( d ( S ( x n ) , S ( p ) ) d ( S ( x n + 1 ) , S ( p ) ) )
( n = n 0 n 0 + Q 1 α n ( 1 α n ) ) ϵ η 2 M + 2 i = 0 ϵ i , ϵ ( 2 M + 2 i = 0 ϵ i ) 1 2 n = n 0 n 0 + Q 1 ϵ n ,
i = n 0 n 0 + Q 1 α n ( 1 α n ) ( 2 M + 3 i = 0 ϵ i ) ϵ 1 η 1 2 M + 2 i = 0 ϵ i , ϵ ( 2 M + 2 i = 0 ϵ i ) 1 .
The relation above contradicts (46). The contradiction we have reached proves Assertion 1.
Let us prove Assertion 2. Set
E = { n { 0 , 1 , , } : B ( S ( x n ) , ϵ ) T ( x n ) = } .
Let Q be a natural number. Set
E Q = E { 0 , , Q 1 } .
Property (P2) and Equations (43), (55), and (56) imply that for each integer n E Q ,
d ( S ( x n ) , y n ) > ϵ ,
and (54) holds. From (40), (42), (47), (48), and (54) holding for each n E Q ,
2 M d ( S ( x 0 ) , S ( p ) ) d ( S ( x 0 ) , S ( p ) ) d ( S ( x Q ) , S ( p ) )
= n = 0 Q 1 ( d ( S ( x n ) , S ( p ) ) d ( S ( x n + 1 ) , S ( p ) ) )
{ d ( S ( x n ) , S ( p ) ) d ( S ( x n + 1 ) , S ( p ) ) : n E Q }
+ { d ( S ( x n ) , S ( p ) ) d ( S ( x n + 1 ) , S ( p ) ) : n { 0 , , Q 1 } E Q }
{ α n ( 1 α n ) η ( 2 M + 2 i = 0 ϵ i , ϵ ( 2 M + 2 i = 0 ϵ i ) 1 ) ϵ 2 ϵ : n E Q } ,
{ ϵ n : n { 0 , , Q 1 } E Q }
Λ 2 ϵ η ( 2 M + 2 i = 0 ϵ i , ϵ ( 2 M + 2 i = 0 ϵ i ) 1 ) Card ( E Q )
2 n = 0 ϵ n ,
Card ( E Q ) ( 2 M + 2 i = 0 ϵ i ) Λ 2 ϵ 1 η 1 ( 2 M
+ 2 i = 0 ϵ i , ϵ ( 2 M + 2 i = 0 ϵ i ) 1 ) .
Since Q is an arbitrary natural number the relation above imply that
Card ( E ) ( 2 M + 2 i = 0 ϵ i ) Λ 2 ϵ 1 η 1 ( 2 M
+ 2 i = 0 ϵ i , ϵ ( 2 M + 2 i = 0 ϵ i ) 1 ) .
Assertion 2 and Theorem 2 are proved. □

6. Conclusions

In this paper, we use the Krasnoselskii–Mann method in order to generate approximate coincidence points of set-valued mappings in metric spaces with a hyperbolic structure. We generalize analogous results obtained in [39] in the case where the set-valued mapping is a union of a finite family of single-valued mappings.

Funding

This research received no external funding.

Data Availability Statement

No data are available.

Conflicts of Interest

The author declares no conflicts of interest.

References

  1. Banach, S. Sur les opérations dans les ensembles abstraits et leur application aux équations intégrales. Fund. Math. 1922, 3, 133–181. [Google Scholar] [CrossRef]
  2. Ariza-Ruiz, D.; Leustean, L.; Lopez-Acedo, G. Firmly nonexpansive mappings in classes of geodesic spaces. Trans. Amer. Math. Soc. 2014, 366, 4299–4322. [Google Scholar] [CrossRef]
  3. Du, W.-S. Some generalizations of fixed point theorems of Caristi type and Mizoguchi–Takahashi type under relaxed conditions. Bull. Braz. Math. Soc. (N.S.) 2019, 50, 603–624. [Google Scholar] [CrossRef]
  4. Goebel, K.; Kirk, W.A. Topics in Metric Fixed Point Theory; Cambridge University Press: Cambridge, UK, 1990. [Google Scholar]
  5. Goebel, K.; Reich, S. Uniform Convexity, Hyperbolic Geometry, and Nonexpansive Mappings; Marcel Dekker: New York, NY, USA; Basel, Switzerland, 1984. [Google Scholar]
  6. Khamsi, M.A.; Kozlowski, W.M. Fixed Point Theory in Modular Function Spaces; Birkhäuser: Cham, Switzerland; Springer: Cham, Switzerland, 2015. [Google Scholar]
  7. Reich, S.; Zaslavski, A.J. Genericity in Nonlinear Analysis. Developments in Mathematics; Springer: New York, NY, USA, 2014. [Google Scholar]
  8. Sahu, D.R.; Wong, N.C.; Yao, J.-C. A unified hybrid iterative method for solving variational inequalities involving generalized pseudocontractive mappings. SIAM J. Control Optim. 2012, 50, 2335–2354. [Google Scholar] [CrossRef]
  9. Zaslavski, A.J. Approximate Solutions of Common Fixed Point Problems, Springer Optimization and Its Applications; Springer: Cham, Switzerland, 2016. [Google Scholar]
  10. Zaslavski, A.J. Algorithms for Solving Common Fixed Point Problems. Springer Optimization and Its Applications; Springer: Cham, Switzerland, 2018. [Google Scholar]
  11. Censor, Y.; Davidi, R.; Herman, G.T. Perturbation resilience and superiorization of iterative algorithms. Inverse Probl. 2010, 26, 12. [Google Scholar] [CrossRef]
  12. Censor, Y.; Elfving, T.; Herman, G.T. Averaging Strings of Sequential Iterations for Convex Feasibility Problems, Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications; Butnariu, D., Censor, Y., Reich, S., Eds.; Elsevier: North-Holland, The Netherlands, 2001; pp. 101–113. [Google Scholar]
  13. Djafari-Rouhani, B.; Farid, M.; Kazmi, K.R. Common solution to generalized mixed equilibrium problem and fixed point problem for a nonexpansive semigroup in Hilbert space. J. Korean Math. Soc. 2016, 53, 89–114. [Google Scholar] [CrossRef]
  14. Gibali, A. A new split inverse problem and an application to least intensity feasible solutions. Pure Appl. Funct. Anal. 2017, 2, 243–258. [Google Scholar]
  15. Takahashi, W.; Xu, H.K.; Yao, J.-C. Iterative methods for generalized split feasibility problems in Hilbert spaces. Set-Valued Var. Anal. 2015, 23, 205–221. [Google Scholar] [CrossRef]
  16. Takahashi, W.; Yao, J.C. Strong convergence theorems under shrinking projection methods for split common fixed point problems in two Banach spaces. J. Convex Anal. 2021, 28, 1097–1118. [Google Scholar]
  17. Xu, H.K. Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces. Inver. Probl. 2010, 26, 1–17. [Google Scholar] [CrossRef]
  18. Yao, Y.; Liou, Y.C.; Yao, J.-C. Split common fixed point problem for two quasi-pseudocontractive operators and its algorithm construction. Fixed Point Theory Appl. 2015, 2015, 127. [Google Scholar] [CrossRef]
  19. Borwein, J.; Reich, S.; Shafrir, I. Krasnoselski–Mann iterations in normed spaces. Canad. Math. Bull. 1992, 35, 21–28. [Google Scholar] [CrossRef]
  20. Dong, Q.-L.; Cho, Y.J.; He, S.; Pardalos, P.M.M. Themistocles, The Krasnosel’skii-Mann Iterative Method–Recent Progress and Applications. In SpringerBriefs in Optimization; Springer: Cham, Switzerland, 2022. [Google Scholar]
  21. Kim, T.W.; Xu, H.K. Strong convergence of modified Mann iterations. Nonlinear Anal. 2005, 61, 51–60. [Google Scholar] [CrossRef]
  22. Krasnosel’skii, M.A. Two remarks on the method of successive approximation. Uspehi Mat. Nauk 1955, 10, 123–127. [Google Scholar]
  23. Mann, W.R. Mean value methods in iteration. Proc. Am. Math. Soc. 1953, 4, 506–510. [Google Scholar] [CrossRef]
  24. Qin, X.; Yao, J.-C. Weak convergence of a Mann-like algorithm for nonexpansive and accretive operators. J. Inequal. Appl. 2016, 232. [Google Scholar] [CrossRef]
  25. Xu, H.H.; Altwaijry, N.; Chebbi, S. Strong convergence of Mann’s iteration process in Banach spaces. Mathematics 2020, 8, 954. [Google Scholar] [CrossRef]
  26. Abbas, M.; Jungck, G. Common fixed point results for noncommuting mappings without continuity in cone metric spaces. J. Math. Anal. Appl. 2008, 341, 416–420. [Google Scholar] [CrossRef]
  27. Batra, R.; Vashistha, S.; Kumar, R. Coincidence point theorem for a new type of contraction on metric spaces. Int. J. Math. Anal. 2014, 8, 1315–1320. [Google Scholar] [CrossRef]
  28. Bisht, R.K. On coincidence and fixed points of general mappings. Linear Nonlinear Anal. 2023, 9, 207–212. [Google Scholar]
  29. Jungck, G. Commuting mappings and fixed points. Am. Math. Mon. 1976, 83, 261–263. [Google Scholar] [CrossRef]
  30. Jungck, G. Common fixed points for commuting and compatible maps in compacta. Proc. Amer. Math. Soc. 1988, 103, 977–983. [Google Scholar] [CrossRef]
  31. Jungck, G.; Radenovic, S.; Radojevic, S.; Rakocevic, V. Common fixed point theorems for weakly compatible pairs on cone metric spaces. Fixed Point Theory Appl. 2009, 643840. [Google Scholar] [CrossRef]
  32. Kohlenbach, U. Some logical metatheorems with applications in functional analysis. Trans. Amer. Math. Soc. 2005, 357, 89–128. [Google Scholar] [CrossRef]
  33. Kohlenbach, U. Applied Proof Theory: Proof Interpretations and Their Use in Mathematics; Springer: Berlin/Heidelberg, Germany, 2008. [Google Scholar]
  34. Cheval, H.; Leustean, L. Quadratic rates of asymptotic regularity for the Tikhonov–Mann iteration. Optim. Methods Softw. 2022, 37, 2225–2240. [Google Scholar] [CrossRef]
  35. Takahashi, W. A convexity in metric space and nonexpansive mappings, I. Kodai Math. Semin. Rep. 1970, 22, 142–149. [Google Scholar] [CrossRef]
  36. Kohlenbach, U.; Leustean, L. Asymptotically nonexpansive mappings in uniformly convex hyperbolic spaces. J. Eur. Math. Soc. 2010, 12, 71–92. [Google Scholar] [CrossRef]
  37. Leustean, L. Quadratic rate of asymptotic regularity for CAT(0)-spaces. J. Math. Anal. Appl. 2007, 325, 386–399. [Google Scholar] [CrossRef]
  38. Leustean, L. Nonexpansive iterations in uniformly convex W–hyperbolic spaces. In Nonlinear Analysis and Optimization I: Nonlinear Analysis; Leizarowitz, A., Mordukhovich, B.S., Shafrir, I., Zaslavski, A., Eds.; American Mathematical Society: Providence, RI, USA, 2010; pp. 193–209. [Google Scholar]
  39. Zaslavski, A.J. The Krasnoselskii-Mann method for common coincidence problems. J. Optim. Theory Appl. 2025, 204, 25. [Google Scholar] [CrossRef]
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.

Share and Cite

MDPI and ACS Style

Zaslavski, A.J. The Krasnoselskii–Mann Method for Approximation of Coincidence Points of Set-Valued Mappings. Mathematics 2025, 13, 662. https://doi.org/10.3390/math13040662

AMA Style

Zaslavski AJ. The Krasnoselskii–Mann Method for Approximation of Coincidence Points of Set-Valued Mappings. Mathematics. 2025; 13(4):662. https://doi.org/10.3390/math13040662

Chicago/Turabian Style

Zaslavski, Alexander J. 2025. "The Krasnoselskii–Mann Method for Approximation of Coincidence Points of Set-Valued Mappings" Mathematics 13, no. 4: 662. https://doi.org/10.3390/math13040662

APA Style

Zaslavski, A. J. (2025). The Krasnoselskii–Mann Method for Approximation of Coincidence Points of Set-Valued Mappings. Mathematics, 13(4), 662. https://doi.org/10.3390/math13040662

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop