1. Introduction
Throughout this paper, we are working in a real Hilbert space
whose norm and inner product are denoted by
and
respectively. Let
be a closed and convex subset of
and
. The notation
will designate the set of all fixed points of
F.
Let
be a convex objective function and
a nonexpansive-type mapping with
. In this paper, we are interested to solve the following constrained optimization problem:
subject to
where
F and
G are two demicontractive mappings.
Under its various versions, like the one when the constraint consists of
, with
F as a nonexpansive-type mapping, this problem is one of the central problems in nonlinear analysis with various important applications in communication networks; see, for example, [
1].
Various algorithms were proposed for solving the problem (
1); see, for example, [
1,
2,
3,
4], and references therein. In Iiduka [
2], a fixed-point optimization algorithm has been proposed for the case in which
F is nonexpansive, while in Iiduka [
3], two methods were proposed for solving a networked optimization system with a finite number of users under the assumption that each user tries to minimize its own private objective function over its own private constraint set. In fact, each user’s constrained set was considered of the fixed-point set of a certain quasi-nonexpansive mapping.
In the case of two users, Sow [
1] presented an explicit iterative method for solving the convex optimization problem (
1) over the set of common fixed points of two mappings
and
, i.e.,
where
is a demicontractive mapping and
is a quasi-nonexpansive mapping.
Motivated by the above results, on one hand, and by the fact that the class of demicontractive mappings strictly includes the quasi-nonexpansive mappings as well as the nonexpansive mappings, our aim in this work is to consider the convex optimization problem over the set of common fixed points of two demicontractive mappings, thus extending all previous results that referred to fixed points or common fixed points of nonexpansive or quasi-nonexpansive mappings.
To this end, we introduce an averaged algorithm intended to solve the convex optimization problem (
1) over the set of common fixed points of two demicontractive mappings. We establish convergence results and illustrate the approach with applications to quadratic optimization problems involving bounded linear operators. A report on the numerical experiments we performed is also presented to illustrate the convergence behavior of the iterative algorithms.
Our results extend, generalize, or are related to several others from the previous literature, e.g., [
1,
2,
3,
4,
5,
6,
7].
2. Preliminaries
We call
F Lipschitz continuous (or
Lipschitzian) if there exists
satisfying
If
then
F is called a
Banach contraction or
strict contraction and if
, then
F is said to be
nonexpansive. Furthermore,
F is said to be
- (a)
strictly pseudocontractive if there exists
such that
- (b)
quasi-nonexpansive if
and
- (c)
demicontractive if
and there exists
satisfying
From the above definitions, it follows that every nonexpansive mapping is strictly pseudocontractive, and every quasi-nonexpansive mapping is also demicontractive. Moreover, if F is nonexpansive and , then F is quasi-nonexpansive.
However, the converses of all these implications fail in general, as illustrated in the next two examples. For a complete diagram which depicts the relationships among the above class mappings, we refer the reader to [
8].
Example 1. Consider , and define the mapping F on asThen - (a)
F is β-demicontractive with
- (b)
F is neither quasi-nonexpasive nor nonexpansive;
- (c)
F is not strictly pseudocontractive.
Proof. - (a)
Let
It is straightforward to prove that inequality (
4) holds for any
If
, then inequality (
4) becomes
which holds for
Let
It is straightforward to prove that inequality (
4) holds for any
If
then inequality (
4) becomes
that holds for
Now take
Obviously, inequality (
4) is valid for every
If
then inequality (
4) becomes
Since
this inequality holds for any positive
If
then inequality (
4) becomes
Since
this inequality holds for any positive
If
then inequality (
4) becomes
Since
we can always find a positive
β with
such that this inequality holds. By summarizing all cases, we can conclude that
F is a
-demicontractive mapping.
- (b)
To show that
F is not quasi-nonexpansive, check inequality (
3) for
and
to get the contradiction
The dicontinuity of F implies that it is not nonexpansive, too.
- (c)
Assume that
F is
β-strictly pseudocontractive; that is, there is a positive constant
such that the inequality (
2) applies for all
By taking
and
in (
2) we get
from which, by letting
we obtain the contradiction
Therefore, F is not strictly pseudocontractive.
□
Example 2. Define G on the interval asArguing similarly to the proof in Example 1
, one can verify that: - (a)
G is β-demicontractive with ;
- (b)
G is neither quasi-nonexpasive (indeed, checking (
3)
for and to get the contradiction ) nor nonexpansive (G is not continuous); - (c)
G is not strictly pseudocontractive.
Remark 1. We note that all points on the interval are common fixed points of F in Example 1 and G in Example 2, i.e.,
The interest in the study of fixed points of nonexpansive-type mappings has been and continues to be an active area of investigation (see [
8,
9,
10]). Its importance is underscored by numerous relevant real-world applications, particularly in convex optimization, game theory, market economics, and many other branches of applied mathematics.
A function
is said to be
k-strongly convex if
such that
for every
with
and
.
In order to prove the main results of this paper, we shall need the following lemmas.
Lemma 1 ([
11])
. If is a real Hilbert space, is a closed convex subset of and is nonexpansive, with , then is demiclosed at 0
. Lemma 2 ([
12])
. For any (a real Hilbert space), we have- (a)
;
- (b)
.
Lemma 3 ([
13])
. Let and be two sequences satisfying- (a)
- (b)
or .
If is such thatfor all , then Lemma 4 ([
14])
. Let be a nonempty closed convex subset of a real Hilbert space and let be c-strongly monotone and M-Lipschitzian, with Assume that and Then, for each we have(that is, is -Lipschitzian on ). Let be closed convex and a mapping. Then the map defined by , will be called the averaged mapping associated to T.
Lemma 5 ([
15])
. Let be closed convex and be μ-demicontractive. Then,- (a)
is closed and convex;
- (b)
For any , is quasi-nonexpansive.
Lemma 6 ([
16])
. Let be a nonempty closed convex subset of the normed linear space . If is a differentiable and convex function, then is a minimizer of f over ⟺ solves the variational inequality for all Remark 2. By Lemma 6
, ⟺ solves the following variational inequality problem: We denote by
the set of solutions of the variational inequality problem (
8).
The projection (nearest point) from
to
denoted by
assigns to each
the unique point
with the property that
Recall that
satisfies
and
An operator
is called
monotone if
is called
c-
strongly monotone if there exists
such that
An operator
is said to be
strongly positive bounded if there exists a constant
such that
Remark 3. Observe that a bounded linear operator φ which is strongly positive is both -Lipchitzian and c-strongly monotone.
3. Main Results
We now introduce our averaged iterative algorithms for solving the convex minimization problem and establish the corresponding strong convergence results.
Let
be a differentiable and
k-strongly convex objective function. Assume that the gradient
is
L-Lipschitzian and consider two demicontractive mappings
such that
. We are interested in studying the minimization problem:
whose set of solutions is denoted by
Lemma 7. Let be a nonempty closed convex subset of a Hilbert space and suppose that is differentiable and k-strongly convex. Assume that is K-Lipschitzian. Let be two μ-demicontractive mappings such thatThen, the solution set of (8) is nonempty. Proof. Let and be two constants such that and and let
Notice that
is a strict contraction, a fact which follows Lemma 4:
for all
Hence,
has a unique fixed point
We have
Thus, by inequality (
9), the problem can be restated under the form of a variational inequality:
From Lemma 6, we deduce that
□
Theorem 1. Let be a nonempty closed convex subset of the Hilbert space Let be a differentiable and k-strongly convex function. Let be two demicontractive mappings such that Assume that the differential map is L-Lipschitz and that and are demiclosed at the origin. Suppose that and are sequences satisfying:
- (a)
- (b)
and
Assume also that Then, the sequence generated by Algorithm 1
strongly converges to the unique solution of Problem (
11)
. | Algorithm 1 The sequence |
Step 1. Take and Choose and let Step 2. Given compute as
Update and go to Step 2. |
Proof. Lemma 7 implies that
Let
Assume that
Let
From (
13), Lemma 2.2 and demicontrativeness of
Since
it follows that
Thus,
where
Thus,
By Lemma 4, the nonexpansiveness of
and inequality (
15),
By induction, we deduce that
Hence, the sequence
is bounded, as are
and
Consequently,
Therefore,
Since
is bounded, it follows that there exists a real number
such that:
We proceed by considering two separate cases for the remainder of the proof.
Case 1. Suppose that
is monotonically decreasing, which implies that it is convergent. Clearly,
It follows from (
16) that
Since
we deduce that
Observe that
It follows from (
19) that
Since
is bounded, there exists a subsequence
of
such that
converges weakly to
and
From (
19) and the demiclosedness of
we have that
Additionally, by Lemma 2 and the fact that
is quasinonexpansive, we obtain
Thus,
Consequently,
Since
is bounded, there exists a real number
such that
It follows from (
21) and (
17) that
Since
we conclude that
Since
converges weakly to
it follows from (
23) and Lemma 1 that
Hence,
Given that
we obtain
Observe that
Lemma 3 implies that
Case 2. Assume that the sequence
is not a monotonically decreasing sequence. Let
Define a mapping
for all
(for some
large enough) by
The sequence
is non-decreasing, with
as
and
for all
It follows from (
16) that
Since
we have
By the same argument as in Case 1, it follows that the sequences
and
are bounded and
For all
we have
This implies that
Now we can write
Hence
Moreover, for all
if
(that is,
), then
due to the fact that
for
Consequently, for
Therefore,
that is,
converges strongly to
□
Theorem 2. Let be a nonempty closed convex subset of the Hilbert space Let be a differentiable and k-strongly convex function. Let be two strictly pseudocontractive mappings such that Assume that the differential map is L-Lipschitz and Let and define the sequence as follows:Suppose that and are the sequences such that: - (i)
- (ii)
and
Then in (
25)
converges strongly to a minimizer of f over Proof. Since F is -strictly pseudocontractive, and G is -strictly pseudocontractive, with ; from Lemma 5, we observe that and are both nonexpansive mappings, for . Thus, F and G are 0-demicontractive. The rest of the proof follows from Theorem 1. □
Next, Theorem 1 is employed to solve the quadratic optimization problem given by:
Theorem 3. Let be a nonempty, closed convex subset of the real Hilbert space Let be two μ-demicontractive mappings such that and let be a strongly bounded linear operator with coefficient Assume that and are demiclosed at the origin and Let and define the sequence as follows:Let and be sequences such that: - (i)
- (ii)
and
Then in (
27)
converges strongly to a solution of (
26).
Proof. Notice that A is a -Lipchitzian and a c-strongly monotone operator. Setting the conclusion of this theorem follows from Theorem 1. □
The main results in [
1], i.e., Theorems 3.1, 3.2 and 3.3, are direct consequences of our Theorems 1, 2 and 3, respectively.
Corollary 1. Let be a nonempty closed convex subset of a real Hilbert space Let be a differentiable, k-strongly convex real-valued function. Let be a β-demicontractive mapping and be a quasi-nonexpansive mapping such that Assume that the differential map is L-Lipschitz and that Let and define the sequence as follows:Let and be sequences such that: - (i)
- (ii)
and
Then in (
28)
converges strongly to a minimizer of f over Corollary 2. Let be a nonempty closed convex subset of a real Hilbert space Let be a differentiable, k-strongly convex real-valued function. Let be two nonexpansive mappings such that Assume that the differential map is L-Lipschitz and Let and define as follows:Suppose that and are sequences such that: - (i)
- (ii)
and
Then defined in (
29)
converges strongly to a minimizer of f over Corollary 3. Let be a nonempty closed convex subset of a real Hilbert space Let be a strongly bounded linear operator with coefficient Let be a β-demicontractive mapping and be a quasi-nonexpansive mapping such that Assume that and are demiclosed at the origin and Let and define as follows:Suppose that and are sequences such that: - (i)
- (ii)
and
Then defined in (
30)
converges strongly to a solution of (
26).
4. Numerical Illustrations
In order to cover the diversity of our theoretical results in the previous section, we consider three different cases: (1) a pair of demicontractive mappings (Example 3); (2) a pair consisting of a demicontractive mapping and a quasi-nonexpanive mapping (Example 4); and (3) a pair consisting of a demicontractive mapping and a strictly pseudocontactive mapping (Example 5). These three pairs of mappings are intended to illustrate the fact that the rate of convergence of our averaged Algorithm 1 slightly decreases its rate of convergence when one passes from a certain class of nonexpansive-type mappings to a larger class of nonexpanisve type mappings.
Example 3. Consider the two demicontractive mappings given in Example 1 and Example 2. The set of common fixed points of F and G is
We use the -strongly convex function Note that f is also -Lipschitz function. We set the following sequences and constant:It is easy to verify that all assumptions in Theorem 1
are satisfied and hence, the sequence from Algorithm 1
converges to the solution of Problem (
11)
, which is giving the minimum value of in We perform several numerical experiments in Python using Algorithm 1
with various choices of parameters values to solve the minimization problem. We select four different initial values: one from each of the intervals and See the numerical results in Table 1. Example 4. We consider the β-demicontractive mapping F in Example 1
and the following quasi-nonexansive mapping:We have All other values are the same as in Example 3
. Observe that the assumptions in Theorem 1
are satisfied and thus, the sequence in Algorithm 1
converges to the solution of Problem (
11)
, which is , giving the minimum value of in See Table 2 for the numerical results. Example 5. We consider the β-demicontractive mapping F in Example 1
and the following -strictly pseudocontractive mapping:Here, All other values are the same as in Example 3
. Hence, the assumptions in Theorem 1
are satisfied and hence, the sequence in Algorithm 1
converges to the solution of Problem (
11)
, which is See the numerical results in Table 3. 5. Conclusions
In this paper we introduce an averaged three-step iterative scheme (Algorithm 1) designed to solve the convex optimization problem (
11) over the set of common fixed points of two demicontractive mappings
F and
G. Our first main result (Theorem 1) shows that, if
f is a differentiable and
k-strongly convex function,
is Lipschitzian, and
and
are demiclosed at zero, then the sequence generated by Algorithm 1 converges strongly to the solution of problem (
11). Similarly, Theorem 2 establishes a convergence result for the averaged iterative scheme (
25).
The main argument used in our investigation relies on an embedding technique using averaged mappings: if G is -demicontractive, then for any is quasi-nonexpansive.
The main results are then used to solve the minimization problem in the case when F and G are strictly pseudocontractive Theorem 2 and to solve a quadratic optimization problem involving bounded linear operators Theorem 3.
We also prove that the main results in [
1] (Theorems 3.1. 3.2 and 3.3) are particular cases that can be seen in our results; see Corollaries 1, 2 and 3, respectively.
As demonstrated by the numerical experiments in
Section 4 (Examples 3–5), our theoretical results can be applied successfully to minimization problems in the broader class of demicontractive mappings.
We thus extend several existing results in the literature—originally established for nonexpansive or quasi-nonexpansive mappings—to the more general settings of strictly pseudocontractive and demicontractive mappings; see, for example [
17,
18,
19,
20,
21,
22].
A report on the numerical experiments we performed is also presented to illustrate the convergence behavior of the iterative algorithms.
Author Contributions
Conceptualization, V.B.; Methodology, V.B.; Formal analysis, K.S.; Investigation, K.S.; Data curation, K.S.; Writing—original draft, K.S.; Writing—review & editing, V.B. and K.S.; Supervision, V.B.; Project administration, V.B. All authors have read and agreed to the published version of the manuscript.
Funding
This research received no external funding.
Data Availability Statement
Data are contained within the article.
Conflicts of Interest
The authors declare no conflicts of interest.
References
- Sow, T.M.M. Iterative computation for solving convex optimization problems over the set of common fixed points of quasi-nonexpansive and demicontractive mappings. Facta Univ. Ser. Math. Inform. 2021, 36, 475–487. [Google Scholar] [CrossRef]
- Iiduka, H. Fixed point optimization algorithm and its application to power control in CDMA data networks. Math. Program. 2012, 133, 227–242. [Google Scholar] [CrossRef]
- Iiduka, H. Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings. Math. Program. 2016, 159, 509–538. [Google Scholar] [CrossRef]
- Iiduka, H.; Yamada, I. A use of conjugate gradient direction for the convex optimization problem over the fixed point set of a nonexpansive mapping. SIAM J. Optim. 2008, 19, 1881–1893. [Google Scholar] [CrossRef]
- Berinde, V.; Saleh, K. Approaching the split common solution problem for nonlinear demicontractive mappings by means of averaged iterative algorithms. Stud. Univ. Babeş-Bolyai Math. 2025, 70, 321–333. [Google Scholar] [CrossRef]
- Combettes, P.L. A block-iterative surrogate constraint splitting method for quadratic signal recovery. IEEE Trans. Signal Process. 2003, 51, 1771–1782. [Google Scholar] [CrossRef]
- Moudafi, A. Viscosity approximation methods for fixed-point problems. J. Math. Anal. Appl. 2000, 241, 46–55. [Google Scholar] [CrossRef]
- 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]
- Berinde, V. Approximating fixed points of demicontractive mappings via the quasi-nonexpansive case. Carpathian J. Math. 2023, 39, 73–84. [Google Scholar] [CrossRef]
- Berinde, V.; Saleh, K. New averaged type algorithms for solving split common fixed point problems for demicontractive mappings. Arab. J. Math. 2024, 13, 679–688. [Google Scholar] [CrossRef]
- Browder, F.E. Convergence theorem for sequences of nonlinear operators in Banach spaces. Math. Z. 1967, 100, 201–225. [Google Scholar] [CrossRef]
- Chidume, C.E. Geometric Properties of Banach Spaces and Nonlinear Iterations; Series: Lecture Notes in Mathematics 1965; Springer: Berlin/Heidelberg, Germany, 2009. [Google Scholar]
- Xu, H.K. Iterative algorithms for nonlinear operators. J. Lond. Math. Soc. 2002, 66, 240–256. [Google Scholar] [CrossRef]
- Wang, S. A general iterative method for obtaining an infinite family of strictly pseudo-contractive mappings in Hilbert spaces. Appl. Math. Lett. 2011, 24, 901–907. [Google Scholar] [CrossRef]
- Zhou, H. Convergence theorems of fixed points for κ-strict pseudo-contractions in Hilbert spaces. Nonlinear Anal. 2008, 69, 456–462. [Google Scholar] [CrossRef]
- Marino, G.; Xu, H.K. Weak and strong convergence theorems for strict pseudocontractions in Hilbert spaces. J. Math. Math. Appl. 2007, 329, 336–346. [Google Scholar]
- Ahmad, A.; Kumam, P.; Harbau, M.H. Convergence theorems for common solutions of nonlinear problems and applications. Carpathian J. Math. 2024, 40, 207–241. [Google Scholar] [CrossRef]
- Condat, L.; Kitahara, D.; Contreras, A.; Hirabayashi, A. Proximal splitting algorithms for convex optimization: A tour of recent advances, with new twists. SIAM Rev. 2023, 65, 375–435. [Google Scholar] [CrossRef]
- Gebregiorgis, S.; Kumam, P.; Seangwattana, T. Modified general inertial Mann and general inertial viscosity algorithms for fixed point and common fixed point problems with applications. Carpathian J. Math. 2024, 40, 275–291. [Google Scholar] [CrossRef]
- Lin, Y.; Xu, Y.S. Convergence rate analysis for fixed-point iterations of generalized averaged nonexpansive operators. J. Fixed Point Theory Appl. 2022, 24, 32. [Google Scholar] [CrossRef]
- Onah, A.C.; Osilike, M.O.; Nwokoro, P.U.; Onah, J.N.; Chima, E.E.; Oguguo, O.U. Asymptotically α-hemicontractive mappings in Hilbert spaces and a new algorithm for solving associated split common fixed point problem. Carpathian J. Math. 2024, 40, 691–715. [Google Scholar] [CrossRef]
- Zhao, J.; Hou, D.F.; Wang, X.L. A new self-adaptive method for the split equality common fixed-point problem of quasi-nonexpansive mappings. Optimization 2021, 70, 805–826. [Google Scholar] [CrossRef]
Table 1.
Numerical results for Example 3 with initial values and .
Table 1.
Numerical results for Example 3 with initial values and .
| Iteration (p) | | | | |
|---|
| 0 | 0.100000 | 0.700000 | 0.800000 | 1.000000 |
| 1 | 0.516982 | 0.691600 | 0.748219 | 0.544454 |
| 2 | 0.625012 | 0.687450 | 0.743730 | 0.631923 |
| 3 | 0.653500 | 0.684701 | 0.740755 | 0.655242 |
| 4 | 0.661345 | 0.682646 | 0.738533 | 0.661784 |
| 5 | 0.663723 | 0.681008 | 0.736760 | 0.663834 |
| … | … | … | … | … |
| 10 | 0.665551 | 0.675748 | 0.731070 | 0.665551 |
| … | … | … | … | … |
| 500 | 0.666645 | 0.666645 | 0.697942 | 0.666645 |
| … | … | … | … | … |
| 9180 | 0.666665 | 0.666665 | 0.673996 | 0.666665 |
| 9181 | 0.666666 | 0.666666 | 0.673996 | 0.666666 |
| … | … | … | … | … |
| 64,264 | 0.666666 | 0.666666 | 0.666666 | 0.666666 |
| 64,265 | 0.666667 | 0.666667 | 0.666667 | 0.666667 |
| 64,266 | 0.666667 | 0.666667 | 0.666667 | 0.666667 |
Table 2.
Numerical results for Example 4 with initial values and .
Table 2.
Numerical results for Example 4 with initial values and .
| Iteration (p) | | | | |
|---|
| 0 | 0.100000 | 0.700000 | 0.800000 | 1.000000 |
| 1 | 0.563625 | 0.691600 | 0.748219 | 0.777096 |
| 2 | 0.638105 | 0.687450 | 0.743730 | 0.749436 |
| 3 | 0.656963 | 0.684701 | 0.740755 | 0.746439 |
| 4 | 0.662256 | 0.682646 | 0.738533 | 0.744199 |
| 5 | 0.663968 | 0.681008 | 0.736760 | 0.742413 |
| … | … | … | … | … |
| 10 | 0.665557 | 0.675748 | 0.731070 | 0.736679 |
| … | … | … | … | … |
| 500 | 0.666645 | 0.666645 | 0.697942 | 0.703297 |
| … | … | … | … | … |
| 9144 | 0.666665 | 0.666665 | 0.674028 | 0.679200 |
| 9145 | 0.666666 | 0.666666 | 0.674027 | 0.679199 |
| … | … | … | … | … |
| 64,008 | 0.666666 | 0.666666 | 0.666666 | 0.666666 |
| 64,009 | 0.666667 | 0.666667 | 0.666667 | 0.666667 |
| 64,010 | 0.666667 | 0.666667 | 0.666667 | 0.666667 |
Table 3.
Numerical results for Example 5 with initial values and .
Table 3.
Numerical results for Example 5 with initial values and .
| Iteration (p) | | | | |
|---|
| 0 | 0.100000 | 0.700000 | 0.800000 | 1.000000 |
| 1 | 1.000000 | 0.655331 | 0.649398 | 0.649754 |
| 2 | 0.653699 | 0.665946 | 0.667765 | 0.667654 |
| 3 | 0.667780 | 0.664201 | 0.663876 | 0.663889 |
| 4 | 0.664541 | 0.665361 | 0.665453 | 0.665450 |
| 5 | 0.665665 | 0.665433 | 0.665407 | 0.665408 |
| … | … | … | … | … |
| 10 | 0.666056 | 0.666056 | 0.666056 | 0.666056 |
| … | … | … | … | … |
| 500 | 0.666654 | 0.666645 | 0.666654 | 0.666654 |
| … | … | … | … | … |
| 5356 | 0.666665 | 0.666665 | 0.666665 | 0.666665 |
| 5357 | 0.666666 | 0.666666 | 0.666666 | 0.666666 |
| … | … | … | … | … |
| 37,499 | 0.666666 | 0.666666 | 0.666666 | 0.666666 |
| 37,500 | 0.666667 | 0.666667 | 0.666667 | 0.666667 |
| 37,501 | 0.666667 | 0.666667 | 0.666667 | 0.666667 |
| 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. |