1. Introduction
Iterative processes are very important tools for finding numerical solutions of certain classes of problems of nonlinear analysis, which can be formulated in the language of fixed point theory and which cannot be tackled with analytical methods. Notable examples include the problem of finding the roots of polynomials with complex coefficients, the study of variational inequalities and equilibrium problems, algorithms for signal and image processing, etc. Perhaps the best known, due to its key role in the proof of the Banach Contraction Principle, is the Picard iteration process.
Meanwhile, the study of non-expansive mappings stimulated the search of new iteration processes. This was motivated in part by the fact that, unlike the case of contraction mappings, the successive application of a non-expansive mapping does not necessarily lead to a fixed point. The earliest results in this direction were obtained by Krasnosel’skii [
1], Mann [
2], Halpern [
3], Berinde [
4], for one-step iterations; Ishikawa [
5], etc., for two-step iterations; Noor [
6], Agrawal et al. [
7], Abbas and Nazir [
8], Gürsoy and Karakaya [
9], Sintunavarat and Pitea [
10], Thakur et al. [
11,
12], for three-step iterations; and the search for new iteration schemes has remained active ever since.
The iterative processes studied in the above-mentioned works are defined for certain classes of mappings, mainly on Banach spaces with a suitable geometric structure, most often on uniformly convex spaces. While the literature on the subject is becoming quite vast, we believe that it is also important to study iterative processes on modular vector spaces. This is due to the fact that they provide a unified approach to many important spaces which appear in various branches of mathematics, such as Orlicz spaces or Lebesgue spaces. That is why our goal is to study a iterative scheme introduced by Thakur et al. [
13] for Suzuki mappings [
14] on Banach spaces, in the framework of modular vector spaces. The mappings under consideration are required to satisfy a modular counterpart of the condition (E) from Garcia-Falset et al. [
15], which is weaker than Suzuki’s condition (C). Recent results in a similar direction have been obtained by Khan [
16] and Mitrinović et al. [
17].
Modular spaces have been extensively studied by Nakano in his classical monograph [
18]. The first examples can be traced back to the early works of Orlicz [
19], who introduced what is called now Orlicz spaces. These function spaces are generalizations of
spaces where, instead of a
p-norm, one works with
N-functions (for example
,
) thus, allowing growth properties more general than power type growth (for details, see for instance [
20,
21]). These include notable examples such as variable exponent spaces and provide, as well.
The paper is organized as follows. In the first section, we recall the definition of modular vector spaces and their properties needed throughout the paper. In
Section 2, we define the mappings satisfying the modular version of the condition (E), providing an example of such a mapping. In
Section 3, we study convergence of the iterative scheme introduced by Takur et al. in [
13]. The main results of the section are Lemma 3, Theorem 1 and Theorem 2, which give sufficient conditions of convergence and fixed point existence results for
-type mappings. The fourth section is dedicated to the study of stability and data dependence with respect to
-contractive mappings. The main results are Theorem 3 and Theorem 4, respectively.
2. Modular Vector Spaces
Definition 1 ([
21])
. Let X be a real (or complex) vector space. A function is called a modular if it satisfies:- (1)
if and only if ,
- (2)
, for ,
- (3)
where ,
for any . If we replace condition with the following conditionfor any and any , then ρ is called a convex modular. Unless otherwise specified, throughout this paper, we shall assume that is a convex modular.
Example 1. Let , . It is clear that if and only if . The last two conditions of the definition are satisfied since both square function and absolute value function are even and convex. Thus, ρ is a convex modular. Notice that this modular does not satisfy the triangle axiom. Take for instance
A convex modular on a vector space X defines naturally a vector subspace as follows.
Definition 2 ([
21])
. Let ρ be a convex modular function defined on a vector space X. The vector subspaceis called a modular space. The modular vector space can be endowed with a topology associated with the modular by analogy with the metric topology.
Definition 3 ([
22])
. Let ρ be a modular function defined on a vector space X- (a)
A sequence is called ρ-convergent to some if and only if .
- (b)
A sequence is called ρ-Cauchy if .
- (c)
We say that is ρ-complete if any ρ-Cauchy sequence in is ρ-convergent.
- (d)
A set is called ρ-closed if for any sequence which ρ-converges to some point x; it implies that .
- (e)
A set is called ρ-bounded if .
- (f)
A set is called ρ-compact if any sequence in K has a subsequence which ρ-converges to a point in K.
- (g)
ρ is said to satisfy the Fatou property if whenever ρ-converges to y, for any in .
The property of uniform convexity plays a crucial role while proving results in the framework of normed spaces. The same is true in the context of modular spaces.
Definition 4 (Definition 3.1, [
22])
. The uniform convexity type properties of the modular ρ are defined for every and every as follows:- (a)
DefineIf , letIf , set . We say that ρ satisfies if for every and , there exists , depending on s and ε, such that - (b)
DefineIf , letIf , set . We say that ρ satisfies if for every and , there exists depending on s and ε, such that
The following technical result, whose proof is similar to its modular function spaces counterpart (Lemma 4.2, [
23]), will play an important role in the sequel.
Lemma 1. Let ρ be a convex modular which is and let be a sequence bounded away from 0 and 1. If there exists such thatwhere and are sequences in , then Definition 5. Let be a sequence in . Let C be a nonempty subset of . The functionis called a ρ-type function. A sequence in C is called a minimizing sequence of τ if For example, take the set of real numbers
as a modular space with the modular
. Consider that
C is the subset of the rational numbers
and the sequence
,
. The
-type function in this case is
which is obviously unbounded. As a corresponding minimizing sequence, take for instance the sequence
,
,
.
Lemma 2 (Proposition 3.7 [
22])
. Assume that the modular space is ρ-complete and ρ satisfies the Fatou property. Let C be a nonempty convex and ρ-closed subset of . Consider the ρ-type function generated by a sequence in . Assume that .- a)
If ρ is , then all minimizing sequences of τ are ρ-convergent to the same limit.
- b)
If ρ is and is a minimizing sequence of τ, then the sequence ρ-converges to a point which is independent of .
We end this section by recalling a crucial property of the modular.
Definition 6. Let be a modular space. It is said that the modular ρ satisfies the -condition if there exists a constant such thatfor any . The smallest such constant K will be denoted by . For example, the modular
,
,
,
, satisfies the
-condition with
. As a counterexample, one may consider the modular
,
, which does not satisfy the
-condition (for details, see [
20]).
4. Convergence Analysis
As before, let
C be a subset of a modular space
. Consider the iterative scheme [
13], which we shall call the TTP scheme, defined as follows:
for all
, where
and
are sequences in
.
The following results are useful for our purpose.
Lemma 3. Let C be a nonempty ρ-closed convex subset of and let be a mapping satisfying with . For arbitrary chosen , let the sequence be generated by the iterative process (3) and suppose for some . Then, exists for any
Proof. Let
. As
T satisfies condition
, we have
By (
4) it follows that
, for any
, and using this one and the convexity of
, one has
Similarly, taking into account relation (
5), we get
Now, using (
4) and (
6) it follows
implying that the sequence
is bounded and nonincreasing for any
. Thus, the limit
exists. □
Lemma 4. Let C be a nonempty subset of and let be a mapping which satisfies condition . Suppose there exists a bounded sequence in C such that and let τ be the ρ-type generated by . Then, T leaves the minimizing sequences invariant, i.e., if is a minimizing sequence for τ, then so is .
Proof. Let
be such that
. For arbitrary
, we have
which implies that
Let now
be a minimizing sequence. Applying (
9), we get
which implies that
, i.e.,
is a minimizing sequence for
. □
Proposition 1. Let C be a nonempty, convex and ρ-closed subset of , where is ρ-complete and ρ satisfies the -condition, is (UUC1), and satisfies the Fatou property. Consider the ρ-type function generated by a sequence in and suppose . Let and be two minimizing sequences for τ. Then,
- (i)
any convex combination of and is a minimizing sequence for τ as well;
- (ii)
Proof. (i) Let
,
,
. For any
, we have
which implies
i.e.,
Passing to the limit and keeping in mind that
and
are minimizing sequences, we obtain
which gives the conclusion.
(ii) Let us notice that, since
,
, we have
,
. According to (i),
is a minimizing sequence and, according to Lemma 2, all minimizing sequences
-converge to the same point, which we denote by
z. Thus,
Thus, on account of (i), we get
. Similarly,
. The
-condition implies the inequality
which gives the conclusion of (ii) by taking
. □
Theorem 1. Let be a ρ-complete modular space and C be a nonempty convex ρ-closed and ρ-bounded subset . Suppose ρ satisfies the Fatou property, is and satisfies the -condition. Let be a mapping satisfying condition and let the sequence be generated by the iterative process (3) with and bounded away from 0 and 1. Then, if and only if
Proof. Suppose
and take
. According to Lemma 3, the limit
exists. Using the relations (
5) and (
4) respectively, we have
On the other hand, using the inequalities (
4) and (
7), together with the convexity of
, we obtain
which implies
Thus,
i.e.,
We also have, from condition (
4), that
, which implies that
It follows
Thus, the conditions of Lemma 1 are satisfied yielding
.
Conversely, assume that
is bounded and
. Let
be the
-type function generated by
and let
be a minimizing sequence for
converging to a point
. By Lemma 4,
is a minimizing sequence as well and by Proposition 1
. On the other hand, condition (
) gives
Taking
, one obtains
, i.e.,
-converges to
. By the uniqueness of the limit, we have
. □
Theorem 2. Let C be a nonempty ρ-compact and convex subset of and let ρ, T and be as in Theorem 1. Suppose that . Then, the sequence ρ-converges to a fixed point of T.
Proof. The
-compactness of
C implies the existence of a subsequence
of
which
-converges to a point
z in
C. On the other hand, since
T satisfies condition
, we have
Noticing that subsequence
is an a.f.p.s. In addition, we get
and, by the uniqueness of the limit, we have
, i.e.,
. According to Lemma 3, the limit
exists and thus
-converges to
z. □
5. Stability and Data Dependence
In this section, our goal is to study the stability and data dependence of the TTP scheme (
3) for
-contractions on modular spaces.
Definition 8. Let C be a nonempty set of a modular space . A mapping is called ρ-contraction if there exists a constant such that The Banach Contraction Principle is valid for
-contractions on modular spaces (see [
22], Theorem 4.2). Thus, the existence of fixed points for
-contractions is guaranteed. It is also straightforward to see that the iteration scheme (
3), applied to
-contractions, yields the inequality
, where
, which implies its convergence to a fixed point.
The following two lemmas will be instrumental in the proofs of the following theorems.
Lemma 5 ([
24])
. Let and be nonnegative real sequences satisfyingwhere for all , and as , then . Lemma 6 ([
25])
. Let be a nonnegative real sequence for which one supposes there exists , such that, for all , the following inequality is satisfied:where , , . Then, The notion of stability of an iteration process is usually defined for metric spaces (see, for instance, [
26,
27]). A natural analogue, in the context of modular spaces, is defined as follows.
Definition 9. Let C be a nonempty set of a modular space and let an arbitrary sequence in C. We say that an iteration process , which converges to a fixed point p, is T-stable ifwhere , . Theorem 3. Let C be a nonempty ρ-closed set of a modular space which is ρ-complete and let be a ρ-contraction with a ρ-bounded orbit. Consider the iterative process (3) with and bounded away from 0 and 1 and satisfying for some . Suppose the modular ρ satisfies the condition. If , then the iterative process (3) is T-stable.
Proof. Let
be a fixed point for the mapping
T and let
be a sequence in
C. Consider the sequence generated by the iterative process (
3)
, converging to
p. Denote
and suppose
. Using the
property, the convexity of the modular, as well as the assumption that
, we have
Applying Lemma 5 for
,
and
, we conclude that
.
Conversely, suppose
. We have
implying that
, which completes the proof. □
Definition 10. Let two operators. We say that approximates the operator T if, for some , we havefor all . Theorem 4. Let be an approximate operator of a ρ-contraction T such that . Let be an iterative sequence generated by (3), corresponding to T, and let be a iterative sequence generated by the iterative schemefor all , where and are sequences in satisfying . If and such that , then Proof. Using the convexity and the
property of the modular, we have
Similarly, one gets
Thus, we obtain
Applying now Lemma 6 with
,
and
, respectively, we get
On the other hand, we have the inequality
in which passing to the limit and using the inequality (
18) yields
which completes the proof. □