Next Article in Journal
Generalized Local Morrey Spaces Associated with Ball Banach Function Spaces and Their Application
Previous Article in Journal
Mathematical Models and Simulations, 2nd Edition
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Approximate Common Solutions for a Family of Inverse Strongly Monotone Mappings

by
Alexander J. Zaslavski
Department of Mathematics, The Technion—Israel Institute of Technology, Haifa 32000, Israel
Axioms 2025, 14(12), 893; https://doi.org/10.3390/axioms14120893 (registering DOI)
Submission received: 6 November 2025 / Revised: 26 November 2025 / Accepted: 27 November 2025 / Published: 1 December 2025

Abstract

In 2003 W. Takahashi and M. Toyoda showed the weak convergence of an iteration process of finding the solution of a variational inequality problem for an inverse strongly monotone mapping. In the present paper, we show that for the same process, most of its iterates are approximate common solutions for a finite family of variational inequalities induced by inverse strongly monotone mappings.

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 ( H , · , · ) is a real Hilbert space equipped with an inner product that induces the Euclidean norm
x = x , x 1 / 2 , x H ,
where K H is a nonempty, convex, closed set, α ( 0 , 1 ) , and A : K H satisfies, for each u , v K ,
A ( u ) A ( v ) , u v α A ( u ) A ( v ) 2 .
In other words, A is α -inverse strongly monotone [1,2,3].
For each x H and each r > 0 , set
B ( x , r ) = { y H : x y r } .
Let I : H H denote the identity self-mapping of H: I ( x ) = x , x H .
Set
V I ( K , A ) = { z K : A ( z ) , u z 0 , u K } .
The following examples of inverse strongly monotone mappings are given in ref. [1]. If A = I T , where T is a nonexpansive mapping of K into itself, then A is (1/2) inverse strongly monotone, and V I ( K , A ) is the set of fixed points of T.
A mapping A : K H is called strongly monotone if there exists a positive real number η such that
A ( u ) A ( v ) , u v η u v 2 .
Then, we say that A is η strongly monotone. If A is η strongly monotone and κ is Lipschitz continuous, then A is ( η / κ 2 ) 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 K = [ 0 , 1 ] , and define A : K H by
A ( x ) = x 2 ( 1 + x ) , 0 x 1 .
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 x H , there is a unique point P D ( x ) D satisfying
x P D ( x ) = inf { x y : y D } .
Moreover, the following assertions hold:
1.
P D ( x ) P D ( y ) | | x y f o r a l l x , y H
and for each x H and each z D ,
z P D ( x ) , x P D ( x ) 0 ,
z P D ( x ) 2 + x P D ( x ) 2 z x 2 .
2. If x H and ξ D and if for each z D
z ξ , x ξ 0 ,
then ξ = P D ( x ) .
3. For each x , y H ,
P D ( x ) P D ( y ) 2 + ( I P D ) ( x ) ( I P D ) ( y ) 2 x y 2 ,
P D ( x ) P D ( y ) 2 P D ( x ) P D ( y ) , x y .
Proposition 1.
Let λ > 0 , u K . Then, u V I ( K , A ) if and only if
P K ( u λ A ( u ) ) = u .
Proof. 
By definition, u V I ( K , A ) if and only if
A ( u ) , z u 0   for   each   z K .
On the other hand, Lemma 1 implies that
P K ( u λ A ( u ) ) = u
if and only if for each z K ,
z u , u λ A ( u ) u 0 .
This completes the proof of Proposition 1. □
Let
0 < a b < 2 α .
The following algorithm was studied in ref. [1].
Let { λ n } n = 0 [ a , b ] .
1. Initialization. Choose x 0 H .
2. Iterative step. For each integer t 0 given a current iterate x t H , set
x t + 1 = P K ( x t λ t A ( x t ) ) .
It was shown in [1] that the iterates of the algorithm weakly converge to a point of V I ( K , A ) .

2. The Algorithms

Assume that U H is a nonempty convex set, m is a natural number, K i U , where i = 1 , , m , are nonempty, closed, convex sets, α ( 0 , 1 ) , and that for each i { 1 , , m } ,
A i : U H
and satisfies, for each u , v H ,
A i ( u ) A i ( v ) , u v α A i ( u ) A i ( v ) 2 .
Set
S = { z i = 1 m K i : A i ( z ) , u z 0 , u K i , i = 1 , , m } .
Assume that
S Ø .
For each ϵ > 0 , set
S ϵ = i = 1 m { z U : B ( z , ϵ ) K i Ø   and
A i ( z ) , ξ z ϵ ξ z ϵ   for   all   ξ K i } .
Clearly, S is the set of common solutions of the variational inequalities, while S ϵ is the set of common ϵ -approximate solutions of variational inequalities.
Let
0 < a b < 2 α ,
Δ ^ ( 0 , m 1 ] .
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 x 0 U .
2. Iterative step. For each integer t 0 given a current iterate x t H , choose
{ λ t , i } i = 1 m [ a , b ] , { α t , i } i = 1 m [ Δ ^ , 1 ]
such that
i = 1 m α t , i = 1
and set
x t + 1 = i = 1 m α t , i P K i ( x t λ t , i A i ( x t ) ) .
Let us consider our second algorithm.
Assume that M > 1 and that
{ u S B ( 0 , M ) : A i B ( 0 , M ) , i = 1 , , m } Ø .
1. Initialization. Choose x 0 U .
2. Iterative step. For each integer t 0 given a current iterate x t H , choose
{ λ t , i } i = 1 m [ a , b ] , m t { 1 , , m }
such that either
A m t ( x t ) > M + 1
or
A i ( x t ) M + 1 , i = 1 , , m ,
x t P K m t ( x t λ t , m t A m t ( x t ) )     x t P K i ( x t λ t , i A i ( x t ) ) ,
i = 1 , , m , and set
x t + 1 = P K m t ( x t λ t , m t A m t ( x t ) ) .
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 α t , i = 1 / m .

3. Main Results

In this paper, we prove the following two results.
Theorem 1.
Assume that ϵ ( 0 , 1 ) ,   M > 1 ,
{ u S B ( 0 , M ) : A i ( u ) B ( 0 , M ) , i = 1 , , m } Ø ,
{ λ t , i } i = 1 m [ a , b ] , t = 0 , 1 , ,
{ x t } t = 0 U ,
x 0 M
and for each integer t 0 ,
{ α t , i } i = 1 m [ Δ ^ , 1 ] , i = 1 m α t , i = 1 ,
x t + 1 = i = 1 m α t , i P K i ( x t λ t , i A i ( x t ) ) .
Let a positive number ϵ satisfy
ϵ 0 min { ϵ , a ϵ , 2 1 ( M + 1 ) 1 ϵ , 2 1 a ϵ } .
Then,
C a r d ( { t { 0 , 1 , } : max { A i ( x t ) : i = 1 , , m } > M + 1 } )
4 M 2 Δ ^ 1 a 1 ( 2 α b ) 1 ,
C a r d ( { t { 0 , 1 , } : max { x t P K i ( x t λ t , i A i ( x t ) ) , i = 1 , , m } > ϵ 0 } )
32 M 2 Δ ^ 1 α ( 2 α b ) 1 ϵ 0 2 a 1 b .
Moreover, if t 0 is an integer and for each integer i { 1 , , m } ,
A i ( x t ) M + 1 , x t P K i ( x t λ t , i A i ( x t ) ) < ϵ 0 ,
then
x t S ϵ .
Theorem 2.
Assume that ϵ ( 0 , 1 ) ,   M > 1 , (8) holds,
{ λ t , i } i = 1 m [ a , b ] , t = 0 , 1 , ,
{ x t } t = 0 U ,
x 0 M , { m t } t = 0 { 1 , , m }
and for each integer t 0 either
A m t ( x t ) > M + 1
or
A i ( x t ) M + 1 , i = 1 , , m ,
x t P K m t ( x t λ t , m t A m t ( x t ) )     x t P K i ( x t λ t , i A i ( x t ) ) ,
i = 1 , , m and
x t + 1 = P K m t ( x t λ t , m t A m t ( x t ) ) .
Let a positive number ϵ 0 satisfy
ϵ 0 min { ϵ , a ϵ , 2 1 ( M + 1 ) 1 ϵ , 2 1 a ϵ } .
Then,
C a r d ( { t { 0 , 1 , } : max { A i ( x t ) : i = 1 , , m } > M + 1 } )
4 M 2 a 1 ( 2 α b ) 1 ,
C a r d ( { t { 0 , 1 , } : max { A i ( x t ) : i = 1 , , m } M + 1 ,
max { x t P K i ( x t λ t , i A i ( x t ) ) , i = 1 , , m } > ϵ 0 } )
32 M 2 a 1 ( 2 α b ) 1 α b ϵ 0 2 .
Moreover, if t 0 is an integer and
A m t ( x t ) M + 1 , x t P K m t ( x t λ t , m t A m t ( x t ) ) ϵ 0 ,
then
x t S ϵ .
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 a , b , α , and ϵ .

4. Auxiliary Results

Let ( K , A ) { ( K i , A i ) : i = 1 , , m } .
Proposition 2.
Let u , v U and λ > 0 . Then,
( I λ A ) ( u ) ( I λ A ) ( v ) 2 u v 2 + λ ( λ 2 α ) A ( u ) A ( v ) 2 .
If λ 2 α , then I λ A is nonexpansive.
Proof. 
By (3),
( I λ A ) ( u ) ( I λ A ) ( v ) 2 = u v λ ( A ( u ) A ( v ) ) 2
= u v 2 2 λ u v , A ( u ) A ( v ) + λ 2 A ( u ) A ( v ) 2
u v 2 + λ ( λ 2 α ) A ( u ) A ( v ) 2 .
Proposition 2 is proved. □
Lemma 2.
Assume that
x U , λ [ a , b ] , u K ,
u = P K ( u λ A ( u ) ) , y = P K ( x λ A ( x ) ) .
Then,
y u 2 x u 2 + λ ( λ 2 α ) A ( u ) A ( x ) 2 ,
y u 2 x u 2 y x + λ ( A ( x ) A ( u ) ) 2
and
y u 2 x u 2 4 1 y x 2 min { 1 , b 2 a ( 2 α b ) } .
Proof. 
In view of (6) and (18),
λ b < 2 α .
Proposition 2 implies that for each v 1 , v 2 U ,
( I λ A ) ( v 1 ) ( I λ A ) ( v 2 ) 2     v 1 v 2 2 + λ ( λ 2 α ) A ( v 1 ) A ( v 2 ) 2 .
Lemma 1 and (18) and (19) imply that
y u   =   P K ( x λ A ( x ) ) P K ( u λ A ( u ) )   =   x λ A ( x ) ( u λ A ( u ) ) .
It follows from (18), (20), and (22) that
y u 2 x u 2 + λ ( λ 2 α ) A ( u ) A ( x ) 2 .
Lemma 1, Proposition 2, the inequality b < 2 α , and relations (18) and (19) imply that
y u 2 = P K ( x λ A ( x ) ) P K ( u λ A ( u ) ) 2
y u , ( x λ A ( x ) ) ( u λ A ( u ) )
= 2 1 [ y u 2 + x λ A ( x ) ( u λ A ( u ) ) 2
y u ( ( x λ A ( x ) ) ( u λ A ( u ) ) ) 2 ]
2 1 [ y u 2 + x u 2 y x + λ ( A ( x ) A ( u ) ) 2 ] .
This implies that
y u 2 x u 2 y x + λ ( A ( x ) A ( u ) ) 2 .
Together with (23), this implies that
y u 2 x u 2 max { a ( 2 α b ) A ( u ) A ( x ) 2 , y x + λ ( A ( x ) A ( u ) ) 2 } .
In view of the Cauchy–Schwartz inequality,
y x 2 y x + λ ( A ( x ) A ( u ) ) + λ ( A ( u ) A ( x ) ) 2
2 y x + λ ( A ( x ) A ( u ) ) 2 + 2 λ 2 A ( u ) A ( x ) 2
2 y x + λ ( A ( x ) A ( u ) ) 2 + 2 b 2 A ( u ) A ( x ) 2 .
Together with the relation above, this implies that
y u 2 x u 2 4 1 y x 2 min { 1 , b 2 a ( 2 α b ) } .
Lemma 2 is proved. □
Lemma 3.
Assume that ϵ 0 > 0 , x U , λ [ a , b ] , and
x P K ( x λ A ( x ) ) ϵ 0 .
Then, for each ξ K ,
A x , ξ x λ 1 ϵ 0 ξ x λ 1 ϵ 0 2 A ( x ) ϵ 0 .
Proof. 
Lemma 1 implies that for each ξ K ,
0 x λ A ( x ) P K ( x λ A ( x ) ) , ξ P K ( x λ A ( x ) ) .
By (24) and the relation above, for each ξ K ,
0 x P K ( x λ A ( x ) ) , ξ P K ( x λ A ( x ) ) .
λ A ( x ) , ξ P K ( x λ A ( x ) )
x P K ( x A ( x ) ) ( ξ x + x P K ( x λ A ( x ) )
λ A ( x ) , ξ x λ A ( x ) , x P K ( x λ A ( x ) )
ϵ 0 ξ x ϵ 0 2 λ A ( x ) , ξ x λ A ( x ) ϵ 0
and
A ( x ) , ξ x λ 1 ϵ 0 ξ x λ 1 ϵ 0 2 A ( x ) ϵ 0 .
Lemma 3 is proved. □

5. Proof of Theorem 1

In view of (8), there exists
u * S B ( 0 , M )
such that
A i ( u * ) M , i = 1 , , m .
Let t 0 be an integer and i { 1 , , m } . Lemma 2 and (9) and (25) imply that
u * P K i ( x t λ t , i A i ( x t ) ) 2
x t u * 2 + λ t , i ( λ t , i 2 α ) A i ( u * ) A i ( x t ) 2
x t u * 2 ( 2 α b ) a A i ( u * ) A i ( x t ) ) 2 ,
u * P K i ( x t λ t , i A i ( x t ) ) 2
x t u * 2 8 1 b 1 a α 1 ( 2 α b ) P K i ( x t λ t , i A i ( x t ) ) x t 2 .
It follows from (11) and (12) and the convexity of the function · 2 that
u * x t + 1 2 = u * i = 1 m α t , i P K i ( x t λ t , i A i ( x t ) ) 2
i = 1 m α t , i u * P K i ( x t λ t , i A i ( x t ) ) 2 .
By (29) and Lemma 2,
u * x t + 1 2 i = 1 m α t , i ( x t u * 2
max { ( 2 α b ) a A i ( u * ) A ( x t ) 2 , ( 8 α b ) 1 a ( 2 α b ) P K i ( x t λ t , i A i ( x t ) ) x t 2 } )
u * x t 2 Δ ^ max i = 1 , , m max { ( 2 α b ) a A i ( u * ) A ( x t ) 2 ,
( 8 α b ) 1 a ( 2 α b ) P K i ( x t λ t , i A i ( x t ) ) x t 2 } ,
u * x t + 1 2     u * x t 2 Δ ^ max i = 1 , , m { ( 8 α b ) 1 a ( 2 α b ) P K i ( x t λ t , i A i ( x t ) ) x t 2 } ,
u * x t + 1     u * x t 2 Δ ^ max i = 1 , , m { ( 2 α b ) a A i ( u * ) A ( x t ) 2 } .
Set
E 1 = { t { 0 , 1 , } : max { P K i ( x t λ t , i A i ( x t ) ) x t : i = 1 , , m } > ϵ 0 } ,
E 2 = { t { 0 , 1 , } : max { A i ( x t ) : i = 1 , , m } > M + 1 } .
Let Q be a natural number. Set
E 1 , Q = E 1 { 0 , , Q 1 } ,
E 2 , Q = E 2 { 0 , , Q 1 } .
By (8), (10), (31), (33), and (35),
4 M 2   x 0 u * 2     x 0 u * 2 x Q u * 2
= t = 0 Q 1 ( x t u * 2 x t + 1 u * 2 )
{ x t u * 2 x t + 1 u * 2 : t E 2 , Q }
a ( 2 α b ) Δ ^ Card ( E 2 , Q ) ,
Card ( E 2 , Q ) 4 M 2 ( a ( 2 α b ) ) 1 Δ ^ 1 .
Since Q is an arbitrary natural number, we conclude that
Card ( E 2 ) 4 M 2 ( a ( 2 α b ) ) 1 Δ ^ 1 .
By (8), (10), (30), (32), and (34),
4 M 2   x 0 u * 2     x 0 u * 2   x Q u * 2
= t = 0 Q 1 ( x t u * 2 x t + 1 u * 2 )
{ x t u * 2 x t + 1 u * 2 : t E 1 , Q }
( 8 α b ) 1 a ( 2 α b ) Δ ^ Card ( E 1 , Q ) ,
Card ( E 1 , Q ) 32 M 2 α b ( a ( 2 α b ) ) 1 Δ ^ 1 ϵ 0 2 .
Since Q is an arbitrary natural number, we conclude that
Card ( E 1 ) 32 M 2 α b ( a ( 2 α b ) ) 1 Δ ^ 1 ϵ 0 2 .
Let t 0 be an integer and for every i { 1 , , m } ,
A i ( x t ) M + 1 ,
P K i ( x i λ t , i A i ( x t ) ) x t ϵ 0 .
By Lemma 3, (13), and the relations above, for each i { 1 , , m } and each ξ K i ,
A i x t , ξ x t λ t , i 1 ϵ 0 ξ x t λ t , i 1 ϵ 0 2 A i ( x t ) ϵ 0
a 1 ϵ 0 ξ x t a 1 ϵ 0 2 ( M + 1 ) ϵ 0
ϵ ξ x t ϵ .
Theorem 1 is proved.

6. Proof of Theorem 2

In view of (8), there exists u * U such that (25) and (26) hold. Let t 0 be an integer. Lemma 2, the inequality b < 2 α , and (14) and (17) imply that
u * x t + 1 2 = u * P K m t ( x t λ t , m t A m t ( x t ) ) 2
x t u * 2 ( 2 α b ) a A m t ( u * ) A m t ( x t ) ) 2 ,
u * x t + 1 2 = u * P K m t ( x t λ t , m t A m t ( x t ) ) 2
x t u * 2 ( 8 α b ) 1 a ( 2 α b ) P K m t ( x t λ t , m t A m t ( x t ) ) x t 2 .
Set
E 0 = { t { 0 , 1 , } : max { A i ( x t ) : i = 1 , , m } > M + 1 } ,
E 1 = { t { 0 , 1 , } E 0 : P K m t ( x t λ t , m t A m t ( x t ) ) x t > ϵ 0 } .
Let Q be a natural number. Set
E 0 , Q = E 0 { 0 , , Q 1 } ,
E 1 , Q = E 1 { 0 , , Q 1 } .
By (8), (15), (36), (37), (40), and the definition of m t ,
4 M 2 x 0 u * 2 x 0 u * 2 x Q u * 2
= t = 0 Q 1 ( x t u * 2 x t + 1 u * 2 )
{ x t u * 2 x t + 1 u * 2 : t E 0 , Q }
a ( 2 α b ) Card ( E 0 , Q ) ,
Card ( E 0 , Q ) 4 M 2 ( a ( 2 α b ) ) 1 .
Since Q is an arbitrary natural number, we conclude that
Card ( E 0 ) 4 M 2 ( a ( 2 α b ) ) 1 .
By (8), (15), (36), (37), (39), and (41),
4 M 2   x 0 u * 2     x 0 u * 2 x Q u * 2
= t = 0 Q 1 ( x t u * 2 x t + 1 u * 2 )
{ x t u * 2 x t + 1 u * 2 : t ( { 0 , 1 , } E 0 ) E 1 , Q }
( 8 α b ) 1 a ( 2 α b ) ϵ 0 2 Card ( E 1 , Q } ,
Card ( E 1 , Q ) 8 M 2 α b ( a ( 2 α b ) ) 1 ϵ 0 2 .
Since Q is an arbitrary natural number, we conclude that
Card ( E 1 ) 8 M 2 α b ( a ( 2 α b ) ) 1 ϵ 0 2 .
By (38), (39), the relations above, and the definition of m t ,
Card ( { t { 0 , 1 , } : max { A i ( x t ) : i = 1 , , m } M + 1 } ) = Card ( E 0 )
4 M 2 ( a ( 2 α b ) ) 1 ,
Card ( { t { 0 , 1 , } : max { A i ( x t ) : i = 1 , , m } M + 1 } ,
max { x t P K i ( x t λ t , i A i ( x t ) ) , i = 1 , , m } > ϵ 0 } } )
= Card ( E 1 ) 32 M 2 a 1 ( 2 α b ) 1 α b ϵ 0 2 .
Let t 0 be an integer, and for every i { 1 , , m } ,
A i ( x t ) M + 1 ,
P K m t ( x t λ t , m t A m t ( x t ) ) x t ϵ 0 .
Together with (16), this implies that for each i { 1 , , m } ,
P K i ( x t λ t , i t A i ( x t ) ) x t ϵ 0 .
By Lemma 3, the choice of ϵ 0 , and the relations above, for each i { 1 , , m } and each ξ K i ,
A i x t , ξ x t λ t , i 1 ϵ 0 ξ x t
λ t , i 1 ϵ 0 2 A i ( x t ) ϵ 0
a 1 ϵ 0 ξ x t a 1 ϵ 0 2 ( M + 1 ) ϵ 0
ϵ ξ x t ϵ .
Theorem 2 is proved.

Funding

This research received no external funding.

Data Availability Statement

No new data were created or analyzed in this study.

Acknowledgments

The author thanks the referees for carefully reading the paper and their useful comments.

Conflicts of Interest

The author declares no conflicts of interest.

References

  1. Takahashi, W.; Toyoda, M. Weak convergence theorems for nonexpansive mappings and monotone mappings. J. Optim. Theory Appl. 2003, 118, 417–428. [Google Scholar] [CrossRef]
  2. Browder, F.E.; Petryshyn, W.V. Construction of fixed Points of nonlinear mappings in Hilbert space. J. Math. Anal. Appl. 1967, 20, 197–228. [Google Scholar] [CrossRef]
  3. Liu, F.; Nashed, M.Z. Regularization of nonlinear ill-posed variational inequalities and convergence rates. Set-Val. Anal. 1998, 6, 313–344. [Google Scholar] [CrossRef]
  4. Bauschke, H.H.; Combettes, P.L. Convex Analysis and Monotone Operator Theory in Hilbert Spaces; Springer: New York, NY, USA, 2011. [Google Scholar]
  5. Deutsch, F. Best approximation in inner product spaces. In CMS Books in Mathematics/Ouvrages de Mathmatiques de la SMC; Springer: New York, NY, USA, 2001. [Google Scholar]
  6. Zaslavski, A.J. Numerical Optimization with Computational Errors; Springer Optimization and Its Applications; Springer: Cham, Switzerland, 2016. [Google Scholar]
  7. Cimmino, G. Calcolo approssimato per le soluzioni dei sistemi di equazioni lineari. Ric. Sci. 1938, 1, 326–333. [Google Scholar]
  8. Censor, Y.; Zenios, S. Parallel Optimization: Theory, Algorithms and Applications; Oxford University Press: New York, NY, USA, 1997. [Google Scholar]
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. Approximate Common Solutions for a Family of Inverse Strongly Monotone Mappings. Axioms 2025, 14, 893. https://doi.org/10.3390/axioms14120893

AMA Style

Zaslavski AJ. Approximate Common Solutions for a Family of Inverse Strongly Monotone Mappings. Axioms. 2025; 14(12):893. https://doi.org/10.3390/axioms14120893

Chicago/Turabian Style

Zaslavski, Alexander J. 2025. "Approximate Common Solutions for a Family of Inverse Strongly Monotone Mappings" Axioms 14, no. 12: 893. https://doi.org/10.3390/axioms14120893

APA Style

Zaslavski, A. J. (2025). Approximate Common Solutions for a Family of Inverse Strongly Monotone Mappings. Axioms, 14(12), 893. https://doi.org/10.3390/axioms14120893

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

Article Metrics

Article metric data becomes available approximately 24 hours after publication online.
Back to TopTop