Next Article in Journal
MathematicalModel of Sustainable Resource Allocation Taking into Account Transaction Costs and Equilibrium Prices Under Technological Constraints
Previous Article in Journal
The Extended Second APG Method for Constrained DC Problems
Previous Article in Special Issue
A Hybrid Walrus Optimization-Based Fourth-Order Method for Solving Non-Linear Problems
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Averaged Iterative Algorithms for Convex Optimization Problems over a Common Fixed-Points Set of Demicontractive Mappings

1
Department of Mathematics and Computer Science, Technical University of Cluj-Napoca, North University Centre at Baia Mare, Victoriei 76, 430122 Baia Mare, Romania
2
Academy of Romanian Scientists, 3 Ilfov, 050044 Bucharest, Romania
3
Department of Mathematics and Natural Sciences, Prince Mohammad Bin Fahd University, Al Khobar 31952, Saudi Arabia
*
Author to whom correspondence should be addressed.
Axioms 2026, 15(1), 8; https://doi.org/10.3390/axioms15010008 (registering DOI)
Submission received: 18 November 2025 / Revised: 19 December 2025 / Accepted: 22 December 2025 / Published: 25 December 2025
(This article belongs to the Special Issue Advances in Classical and Applied Mathematics, 2nd Edition)

Abstract

In this article, we introduce a novel averaged-type iterative scheme designed for solving convex minimization problems over the set of common fixed points of a pair of demicontractive mappings. Under suitable assumptions, we prove that the proposed algorithm converges strongly to the solution of the considered problem in a Hilbert space setting. We further demonstrate the applicability of our method to quadratic optimization problems with a bounded linear operator. In addition, we also report the numerical experiments that were performed in order to demonstrate the convergence behavior of the algorithm and to highlight its superiority over related existing methods.

1. Introduction

Throughout this paper, we are working in a real Hilbert space H whose norm and inner product are denoted by · and · , · , respectively. Let C be a closed and convex subset of H and F : C C . The notation
F i x ( F ) : = { u C : F u = u } .
will designate the set of all fixed points of F.
Let f : C R be a convex objective function and F : C C a nonexpansive-type mapping with F i x ( F ) . In this paper, we are interested to solve the following constrained optimization problem:
M i n i m i z e   f ( x )
subject to
x F i x ( F ) F i x ( G ) ,
where F and G are two demicontractive mappings.
Under its various versions, like the one when the constraint consists of x F i x ( F ) , 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 T 1 and T 2 , i.e., 
F i x ( T 1 ) F i x ( T 2 ) ,
where T 1 is a demicontractive mapping and T 2 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 M 0 satisfying
F u F v M u v , u , v C .
If M < 1 , then F is called a Banach contraction or strict contraction and if M = 1 , then F is said to be nonexpansive. Furthermore, F is said to be
(a)
strictly pseudocontractive if there exists β ( 0 , 1 ) such that
F u F v 2 u v 2 + β ( I F ) u ( I F ) v 2 , u , v C .
(b)
quasi-nonexpansive if F i x ( F ) and
F u v u v , for all u C and v F i x ( F ) ;
(c)
demicontractive if F i x ( F ) and there exists ϱ ( 0 , 1 ) satisfying
F u v 2 u v 2 + ϱ u F u 2 , for all u C and v F i x ( F ) .
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 F i x ( T ) , 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 H = R , C = [ 0 , 1 ] and define the mapping F on C as
F ( u ) = 2 3 , i f   0 u 2 3 u , i f   2 3 < u < 3 4 3 4 , i f   3 4 u < 9 10 1 3 , i f   9 10 u 1 .
Then
(a)
F is β-demicontractive with β = 7 17 ;
(b)
F is neither quasi-nonexpasive nor nonexpansive;
(c)
F is not strictly pseudocontractive.
Proof. 
(a)
F i x ( F ) = 2 3 , 3 4 . Let v 1 = 2 3 F i x ( F ) . It is straightforward to prove that inequality (4) holds for any u 0 , 9 10 . If u 9 10 , 1 , then inequality (4) becomes
1 3 2 3 2 u 2 3 2 + β u 1 3 2 ,
which holds for β 7 17 . Let v 2 = 3 4 F i x ( F ) . It is straightforward to prove that inequality (4) holds for any u 0 , 9 10 . If u 9 10 , 1 , then inequality (4) becomes
1 3 3 4 2 u 3 4 2 + β u 1 3 2
that holds for β 7 17 . Now take v 3 2 3 , 3 4 F i x ( F ) . Obviously, inequality (4) is valid for every u 2 3 , 3 4 . If u 0 , 2 3 , then inequality (4) becomes
2 3 v 3 2 u v 3 2 + β u 2 3 2
Since u 2 3 < v 3 , this inequality holds for any positive β . If u 3 4 , 9 10 then inequality (4) becomes
3 4 v 3 2 u v 3 2 + β u 3 4 2 .
Since u 3 4 > v 3 , this inequality holds for any positive β . If u 9 10 , 1 then inequality (4) becomes
1 3 v 3 2 u v 3 2 + β u 1 3 2 .
Since 1 3 v 3 < u 1 3 , we can always find a positive β with 7 17 < β < 1 , such that this inequality holds. By summarizing all cases, we can conclude that F is a 7 17 -demicontractive mapping.
(b)
To show that F is not quasi-nonexpansive, check inequality (3) for u = 1 and v = 3 4 F i x ( F ) to get the contradiction 5 12 1 4 .
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 β < 1 such that the inequality (2) applies for all u , v [ 0 , 1 ] . By taking u 3 4 , 9 10 and v = 9 10 , in (2) we get
5 12 2 u 9 10 2 + β u 9 10 5 12 2 ,
from which, by letting u 9 10 , we obtain the contradiction 1 β < 1 .
Therefore, F is not strictly pseudocontractive.
     □
Example 2.
Define G on the interval [ 0 , 1 ] as
G ( u ) = 1 2 u + 1 3 , i f   0 u 2 3 u , i f   2 3 < u < 3 4 3 4 , i f   3 4 u < 1 2 9 , i f   u = 1 .
Arguing similarly to the proof in Example 1, one can verify that:
(a)
G is β-demicontractive with β = 5 14 ;
(b)
G is neither quasi-nonexpasive (indeed, checking (3) for u = 1 and v = 2 3 F i x ( G ) to get the contradiction 4 9 1 3 ) nor nonexpansive (G is not continuous);
(c)
G is not strictly pseudocontractive.
Remark 1.
We note that all points on the interval 2 3 , 3 4 are common fixed points of F in Example 1 and G in Example 2, i.e.,  F i x ( F ) = F i x ( G ) = 2 3 , 3 4 .
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 g : H R is said to be k-strongly convex if k > 0 such that
g ( α u + ( 1 α ) v ) α g ( u ) + ( 1 α ) g ( v ) k u v 2 ,
for every u , v H with u v and α ( 0 , 1 ) .
In order to prove the main results of this paper, we shall need the following lemmas.
Lemma 1
([11]). If H is a real Hilbert space, D is a closed convex subset of H and F : D D is nonexpansive, with  F i x ( F ) e m p t y s e t , then I F is demiclosed at 0.
Lemma 2
([12]). For any u , v H (a real Hilbert space), we have
(a)
u + v 2 u 2 + v , u + v ;
(b)
μ u + ( 1 μ ) v 2 = μ u 2 + ( 1 μ ) v 2 μ ( 1 μ ) u v 2 , μ ( 0 , 1 ) .
Lemma 3
([13]). Let { a p } ( 0 , 1 ) and { b p } R be two sequences satisfying
(a)
p = 0 a p = ;
(b)
lim sup p b p 0 or     p = 0 | a p b p | < .
If { α p } [ 0 , ) is such that
α p + 1 ( 1 a p ) α p + a p b p
for all p 0 , then lim p α p = 0 .
Lemma 4
([14]). Let D be a nonempty closed convex subset of a real Hilbert space H and let φ : D H be c-strongly monotone and M-Lipschitzian, with  c > 0 ,   M > 0 . Assume that 0 < ν < 2 m M 2 and δ = α c M 2 α 2 2 . Then, for each s 0 , min 1 , 1 r , we have
( I s α φ ) u ( I s α φ ) v ( 1 s δ ) u v , u , v D ,
(that is, I s α A is ( 1 s δ ) -Lipschitzian on D ).
Let D H be closed convex and T : D D a mapping. Then the map T λ : D D defined by T λ ( x ) = ( 1 λ ) x + λ T x , x C , will be called the averaged mapping associated to T.
Lemma 5
([15]). Let D H be closed convex and G : D D be μ-demicontractive. Then,
(a)
F i x ( G ) is closed and convex;
(b)
For any λ ( 0 , 1 μ ) , T λ is quasi-nonexpansive.
Lemma 6
([16]). Let D be a nonempty closed convex subset of the normed linear space X . If  f : D R is a differentiable and convex function, then u is a minimizer of f over D u solves the variational inequality f ( u ) , v u 0 for all v D .
Remark 2.
By Lemma 6 , u Ω u solves the following variational inequality problem:
f ( u ) , u z 0 , z Γ .
We denote by VI ( f , Γ ) the set of solutions of the variational inequality problem (8).
The projection (nearest point) from H to D , denoted by P D assigns to each u H the unique point P D u with the property that
u P D u u v , v D .
Recall that P D satisfies
u v , P D u P D v P D u P D v 2 , v H
and
P D w v , w P D w 0 , w D and v H .
An operator φ : D H is called monotone if
φ u φ v , u v 0 , u , v D ;
φ is called c-strongly monotone if there exists c ( 0 , 1 ) such that
φ u φ v , u v k u v 2 , u , v D .
An operator φ : H H is said to be strongly positive bounded if there exists a constant b > 0 such that
φ u , u b u 2 , u H .
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 f : D R be a differentiable and k-strongly convex objective function. Assume that the gradient f : H H is L-Lipschitzian and consider two demicontractive mappings F , G : D D such that Γ = F i x ( F ) F i x ( G ) . We are interested in studying the minimization problem:
find u Γ such that f ( u ) = min u Γ f ( u ) ,
whose set of solutions is denoted by Ω .
Lemma 7.
Let D be a nonempty closed convex subset of a Hilbert space H , and suppose that f : H R is differentiable and k-strongly convex. Assume that f : D H is K-Lipschitzian. Let F , G : D D be two μ-demicontractive mappings such that
Γ : = F i x ( F ) F i x ( G ) .
Then, the solution set of (8) is nonempty.
Proof. 
Let α and δ be two constants such that 0 < α < 2 k K 2 and δ = α k K 2 α 2 , and let τ 0 0 , min { 1 , 1 r } .
Notice that P Γ ( I τ 0 α f ) is a strict contraction, a fact which follows Lemma 4:
P Γ ( I τ 0 α f ) u P Γ ( I τ 0 α f ) v ( I τ 0 α f ) u ( I τ 0 α f ) v ( 1 τ 0 δ ) u v ,
for all u , v D . Hence, P Γ ( I τ 0 α f ) has a unique fixed point u 1 H . We have u 1 = P Γ ( I τ 0 α f ) u 1 . Thus, by inequality (9), the problem can be restated under the form of a variational inequality:
f ( u 1 ) , u 1 z 0 , z Γ .
From Lemma 6, we deduce that u 1 Ω .    □
Theorem 1.
Let D be a nonempty closed convex subset of the Hilbert space H . Let f : D R be a differentiable and k-strongly convex function. Let F , G : D D be two demicontractive mappings such that F i x ( F ) F i x ( G ) . Assume that the differential map f : D H is L-Lipschitz and that I F and I G are demiclosed at the origin. Suppose that { a p } , { b p } and { φ p } are sequences satisfying:
(a)
lim p a p = 0 ; p = 0 a p = ;
(b)
φ p ( μ , 1 ) , lim inf p ( 1 φ p ) ( φ p μ ) > 0 and lim inf p b p ( 1 b p ) > 0 .
Assume also that 0 < α < 2 k L 2 . Then, the sequence { u p } generated by Algorithm 1 strongly converges to the unique solution of Problem (11).
Algorithm 1 The sequence { u p }
  • Step 1. Take { a p } ( 0 , 1 ) , { φ p } ( 0 , 1 ) , { b p } ( 0 , 1 ) , and α > 0 . Choose u 0 D ; and let p = 0 .
  • Step 2. Given u p D , compute u p + 1 D as
    w p = φ p u p + ( 1 φ p ) F u p , v p = b p w p + ( 1 b p ) ( 1 μ ) w p + μ G w p , u p + 1 = P D ( I α a p f ) v p ,
Update p : = p + 1 and go to Step 2.
Proof. 
Lemma 7 implies that VI ( f , Γ ) . Let u VI ( f , Γ ) . Assume that
a p ( 0 , min { 1 , 1 / δ } ) , δ = α k L 2 α 2 .
Let z Γ . From (13), Lemma 2.2 and demicontrativeness of F ,
w p z 2 = φ p ( u p z ) + ( 1 φ p ) ( F u p z ) 2 = φ p u p z 2 + ( 1 φ p ) F u p z 2 φ p ( 1 φ p ) F u p u p 2 . φ p u p z 2 + ( 1 φ p ) ( u p z 2 + μ F u p u p 2 ) = . φ p ( 1 φ p ) F u p u p 2 u p z 2 ( 1 φ p ) ( φ p μ ) F u p u p 2 .
Since φ p ( μ , 1 ) , it follows that
w p z u p z .
Thus,
v p z = b p w p + ( 1 b p ) G ^ w p z b p w p z + ( 1 b p ) G ^ w p z w p z ,
where G ^ = ( 1 μ ) I + μ G . Thus,
v p z w p z u p z .
By Lemma 4, the nonexpansiveness of P D , and inequality (15),
u p + 1 z =   P D ( I a p α f ) v p z =   P D v p a p α P D f v p z + a p α P D f ( z ) a p α P D f ( z )   P D v p a p α P D f v p P D z + a p α P D f ( z ) a p α P D f ( z )   v p a p α f v p z + a p α f ( z ) a p α f ( z )   ( I a p α f ) v p ( I a p α f ) z a p α f ( z ) ( 1 δ a p ) v p z + a p α f ( z ) ( 1 δ a p ) u p z + a p α f ( z ) max u p z , α f ( z ) δ .
By induction, we deduce that
u p z max u 0 z , α f ( z ) δ , p 1 .
Hence, the sequence { u p } is bounded, as are { v p } and { f ( u p ) } .
Consequently,
u p + 1 z 2   ( I α a p f ) ( v p z ) a p α f ( z ) 2 a p 2 α f ( z ) 2 + ( 1 δ a p ) 2 v p z 2 = . 2 a p ( 1 δ a p ) α f ( z ) v p z a p 2 α f ( z ) 2 + ( 1 δ a p ) 2 v p z 2 = . ( 1 δ a p ) 2 ( 1 φ p ) ( φ p μ ) 2 F u p u p 2 = . 2 a p ( 1 δ a p ) α f ( z ) v p z .
Therefore,
( 1 δ a p ) 2 ( 1 φ p ) ( φ p μ ) F u p u p 2   u p z 2 u p + 1 z 2 + a p 2 α f ( z ) 2 = . + 2 a p ( 1 δ a p ) α f ( z ) u p z .
Since { u p } is bounded, it follows that there exists a real number m > 0 such that:
( 1 δ a p ) 2 ( 1 φ p ) ( φ p μ ) F u p u p 2 u p z 2 u p + 1 z 2 + a p m .
We proceed by considering two separate cases for the remainder of the proof.
Case 1.
Suppose that { u p z } is monotonically decreasing, which implies that it is convergent. Clearly,
lim p ( u p z 2 u p + 1 z 2 ) = 0 .
It follows from (16) that
lim p ( 1 φ p ) ( φ p μ ) F x n u p 2 = 0 .
Since lim inf p ( 1 φ p ) ( φ p μ ) > 0 , we deduce that
lim p u p F u p = 0 .
Observe that
w p u p =   φ p u p + ( 1 φ p ) F u p u p =   φ p u p + ( 1 φ p ) F u p φ p u p ( 1 φ p ) u p = ( 1 φ p ) F u p u p   F u p u p .
It follows from (19) that
lim p w p u p = 0 .
Since { u p } is bounded, there exists a subsequence { u n j } of { u p } such that { u n j } converges weakly to y D and
lim sup p f ( u ) , u u p = lim j g ( u ) , u u p j .
From (19) and the demiclosedness of I F , we have that y F i x ( F ) . Additionally, by Lemma 2 and the fact that G ^ is quasinonexpansive, we obtain
v p z 2 =   b p w p + ( 1 b p ) G ^ w p z 2 = b p w p z 2 + ( 1 b p ) G ^ w p z 2 ( 1 b p ) b p G ^ w p w p 2   u p z 2 ( 1 b p ) b p G ^ w p w p 2 .
Thus,
u p + 1 2   ( I a p α f ) v p z 2   ( I a p α f ) ( v p z ) a p α f ( z ) 2 a p 2 α f ( z ) 2 + ( 1 a p δ ) 2 v p z 2 = . + 2 a p ( 1 a p δ ) α f ( z ) v p z a p 2 α f ( z ) 2 + ( 1 a p δ ) 2 v p z 2 = . ( 1 a p δ ) 2 ( 1 b p ) b p G ^ w p w p 2 = . + 2 a p ( 1 a p δ ) α f ( z ) v p z .
Consequently,
( 1 δ a p ) 2 b p ( 1 b p ) G ^ w p w p 2   u p z 2 u p + 1 z 2 + a p 2 α f ( z ) 2 = . + 2 a p ( 1 a p δ ) α f ( z ) u p z .
Since { u p } is bounded, there exists a real number K > 0 such that
( 1 δ a p ) 2 b p ( 1 b p ) G ^ w p w p 2 u p z 2 u p + 1 z 2 + a p K .
It follows from (21) and (17) that
lim p b p ( 1 b p ) G ^ w p w p = 0 .
Since lim inf p b p ( 1 b p ) > 0 , we conclude that
lim p G ^ w p w p = 0 .
Since { w p j } converges weakly to y , it follows from (23) and Lemma 1 that y F i x ( G ^ ) = F i x ( G ) . Hence, y Γ . Given that u VI ( f , Γ ) , we obtain
lim sup p f ( u ) , u u p = lim j g ( u ) , u u p j = f ( u ) , u y 0 .
Observe that
u p + 1 u ( I α a p f ) v p u , u p + 1 u ( I α a p f ) v p u + α a p f ( u ) α a p f ( u ) , u p + 1 u   ( I α a p f ) v p u u p + 1 u + a p α f ( u ) , u p + 1 u ( 1 a p δ ) u p u 2 + 2 a p α f ( u ) , u p + 1 u .
Lemma 3 implies that u p u .
Case 2.
Assume that the sequence { u p u } is not a monotonically decreasing sequence. Let B p = u p u 2 . Define a mapping κ : N N for all p p 0 (for some p 0 N large enough) by
κ ( p ) = max { n N : n p , B n B n + 1 } .
The sequence { κ ( p ) } is non-decreasing, with κ ( p ) as p , and B κ ( p ) B κ ( p ) + 1 for all p p 0 . It follows from (16) that
( 1 φ κ ( p ) ) ( φ κ ( p ) μ ) u κ ( p ) F u κ ( p ) 2 a κ ( p ) C .
Since φ κ ( p ) ( μ , 1 ) , we have
lim p u κ ( p ) F u κ ( p ) = 0
By the same argument as in Case 1, it follows that the sequences { u κ ( p ) } and { v κ ( p ) } are bounded and lim sup κ ( p ) f ( u ) , u u κ ( p ) 0 . For all p p 0 , we have
0   u κ ( p ) + 1 u 2 u κ ( p ) u 2 a κ ( p ) κ ( p ) u κ ( p ) u 2 + 2 α f ( u ) , u x κ ( p ) + 1 .
This implies that
u κ ( p ) u 2 2 α κ ( p ) f ( u ) , u u κ ( p ) + 1 .
Now we can write
lim p u κ ( p ) u = 0 .
Hence
lim p B κ ( p ) = lim p B κ ( p ) + 1 = 0 .
Moreover, for all p p 0 , if p κ ( p ) (that is, p > κ ( p ) ), then B κ ( p ) B κ ( p ) + 1 , due to the fact that B j > B j + 1 for κ ( p ) + 1 j p . Consequently, for p p 0
0 B p max { B κ ( p ) , B κ ( p ) + 1 } = B κ ( p ) + 1 .
Therefore, lim p B p = 0 , that is, { u p } converges strongly to u .
Theorem 2.
Let D be a nonempty closed convex subset of the Hilbert space H . Let f : D R be a differentiable and k-strongly convex function. Let F , G : D D be two strictly pseudocontractive mappings such that F i x ( F ) F i x ( G ) . Assume that the differential map f : D H is L-Lipschitz and 0 < α < 2 k L 2 . Let u 0 D and define the sequence { u p } as follows:
w p = φ p u p + ( 1 φ p ) F u p , v p = b p u p + ( 1 b p ) ( 1 μ ) u p + μ G u p , u p + 1 = P D ( I α a p f ) v p .
Suppose that { a p } , { b p } and { φ p } are the sequences such that:
(i)
lim p a p = 0 , p = 0 a p = ,
(ii)
φ p ( 0 , 1 ) , and lim inf p b p ( 1 b p ) > 0 .
Then { u p } in (25) converges strongly to a minimizer of f over F i x ( F ) F i x ( G ) .
Proof. 
Since F is β -strictly pseudocontractive, and G is γ -strictly pseudocontractive, with α , β ( 0 , 1 ) ; from Lemma 5, we observe that F ^ = ( 1 μ ) I + μ F and G ^ = ( 1 μ ) I + μ G are both nonexpansive mappings, for μ ( 0 , min { β , γ } ) . 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:
find u Γ such that f ( u ) = min u Γ f ( u ) , where f ( u ) = 1 2 A u , u .
Theorem 3.
Let D be a nonempty, closed convex subset of the real Hilbert space H . Let F , G : D D be two μ-demicontractive mappings such that F i x ( F ) F i x ( G ) , and let A : D H be a strongly bounded linear operator with coefficient c > 0 . Assume that I F and I G are demiclosed at the origin and 0 < α < 2 k L 2 . Let u 0 D and define the sequence { u p } as follows:
w p = φ p u p + ( 1 φ p ) F u p , v p = b p u p + ( 1 b p ) ( 1 μ ) u p + μ G u p , u p + 1 = P D ( I α a p A ) v p .
Let { a p } , { b p } and { φ p } be sequences such that:
(i)
lim p a p = 0 , p = 0 a p = ,
(ii)
φ p ( 0 , 1 ) , and lim inf p b p ( 1 b p ) > 0 .
Then { u p } in (27) converges strongly to a solution of (26).
Proof. 
Notice that A is a A -Lipchitzian and a c-strongly monotone operator. Setting f u = A u , 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 D be a nonempty closed convex subset of a real Hilbert space H . Let f : D R be a differentiable, k-strongly convex real-valued function. Let F : D D be a β-demicontractive mapping and G : D D be a quasi-nonexpansive mapping such that F i x ( F ) F i x ( G ) . Assume that the differential map f : D H is L-Lipschitz and that 0 < α < 2 k L 2 . Let u 0 D and define the sequence { u p } as follows:
w p = φ p u p + ( 1 φ p ) F u p , v p = b p u p + ( 1 b p ) ( 1 μ ) u p + μ G u p , u p + 1 = P D ( I α a p f ) v p .
Let { a p } , { b p } and { φ p } be sequences such that:
(i)
lim p a p = 0 , p = 0 a p = ,
(ii)
φ p ( 0 , 1 ) , and lim inf p b p ( 1 b p ) > 0 .
Then { u p } in (28) converges strongly to a minimizer of f over F i x ( F ) F i x ( G ) .
Corollary 2.
Let D be a nonempty closed convex subset of a real Hilbert space H . Let f : D R be a differentiable, k-strongly convex real-valued function. Let F , G : D D be two nonexpansive mappings such that F i x ( F ) F i x ( G ) . Assume that the differential map f : D H is L-Lipschitz and 0 < α < 2 k L 2 . Let u 0 D and define { u p } as follows:
w p = φ p u p + ( 1 φ p ) F u p , v p = b p u p + ( 1 b p ) ( 1 μ ) u p + μ G u p , u p + 1 = P D ( I α a p f ) v p .
Suppose that { a p } , { b p } and { φ p } are sequences such that:
(i)
lim p a p = 0 , p = 0 a p = ,
(ii)
φ p ( 0 , 1 ) , and lim inf p b p ( 1 b p ) > 0 .
Then { u p } defined in (29) converges strongly to a minimizer of f over F i x ( F ) F i x ( G ) .
Corollary 3.
Let D be a nonempty closed convex subset of a real Hilbert space H . Let A : D H be a strongly bounded linear operator with coefficient k > 0 . Let F : D D be a β-demicontractive mapping and G : D D be a quasi-nonexpansive mapping such that F i x ( F ) F i x ( G ) . Assume that I F and I G are demiclosed at the origin and 0 < α < 2 k L 2 . Let u 0 D and define { u p } as follows:
w p = φ p u p + ( 1 φ p ) F u p , v p = b p u p + ( 1 b p ) ( 1 μ ) u p + μ G u p , u p + 1 = P D ( I α a p A ) v p .
Suppose that { a p } , { b p } and { φ p } are sequences such that:
(i)
lim p a p = 0 , p = 0 a p = ,
(ii)
φ p ( 0 , 1 ) , and lim inf p b p ( 1 b p ) > 0 .
Then { u p } 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 Γ = F i x ( F ) F i x ( G ) = 2 3 , 3 4 .
We use the 2 3 -strongly convex function f ( u ) = u 2 3 . Note that f is also 2 3 -Lipschitz function. We set the following sequences and constant:
a p = 1 100 p , b p = p 100 p + 1 , φ p = 9 25 , p N and α = 0.45 .
It is easy to verify that all assumptions in Theorem 1 are satisfied and hence, the sequence { u p } from Algorithm 1 converges to the solution of Problem (11), which is u = 2 3 Γ giving the minimum value of f ( u ) 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 [ 0 , 2 3 ] , ( 2 3 , 3 4 ) , [ 3 4 , 9 10 ) and [ 9 10 , 1 ] . See the numerical results in Table 1.
Example 4.
We consider the β-demicontractive mapping F in Example 1 and the following quasi-nonexansive mapping:
T ( u ) = 3 u 2 + 2 3 u + 3 , i f   0 u 2 3 u , i f   2 3 < u < 3 4 3 4 , i f   3 4 u 1 .
We have Γ = F i x ( F ) F i x ( T ) = 2 3 , 3 4 . All other values are the same as in Example 3. Observe that the assumptions in Theorem 1 are satisfied and thus, the sequence { u p } in Algorithm 1 converges to the solution of Problem (11), which is u = 2 3 Γ , giving the minimum value of f ( u ) in Γ . See Table 2 for the numerical results.
Example 5.
We consider the β-demicontractive mapping F in Example 1 and the following 3 5 -strictly pseudocontractive mapping:
T 2 ( u ) = 4 9 u , 0 u 1 .
Here, Γ = F i x ( F ) F i x ( T 2 ) = 2 / 3 . All other values are the same as in Example 3. Hence, the assumptions in Theorem 1 are satisfied and hence, the sequence { u p } in Algorithm 1 converges to the solution of Problem (11), which is u = 2 3 Γ . 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, f is Lipschitzian, and I F and I G 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 μ ( 0 , 1 β ) ,   G μ = ( 1 μ ) I + μ G 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

  1. 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]
  2. 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]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. Moudafi, A. Viscosity approximation methods for fixed-point problems. J. Math. Anal. Appl. 2000, 241, 46–55. [Google Scholar] [CrossRef]
  8. 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]
  9. Berinde, V. Approximating fixed points of demicontractive mappings via the quasi-nonexpansive case. Carpathian J. Math. 2023, 39, 73–84. [Google Scholar] [CrossRef]
  10. 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]
  11. Browder, F.E. Convergence theorem for sequences of nonlinear operators in Banach spaces. Math. Z. 1967, 100, 201–225. [Google Scholar] [CrossRef]
  12. Chidume, C.E. Geometric Properties of Banach Spaces and Nonlinear Iterations; Series: Lecture Notes in Mathematics 1965; Springer: Berlin/Heidelberg, Germany, 2009. [Google Scholar]
  13. Xu, H.K. Iterative algorithms for nonlinear operators. J. Lond. Math. Soc. 2002, 66, 240–256. [Google Scholar] [CrossRef]
  14. 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]
  15. Zhou, H. Convergence theorems of fixed points for κ-strict pseudo-contractions in Hilbert spaces. Nonlinear Anal. 2008, 69, 456–462. [Google Scholar] [CrossRef]
  16. 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]
  17. 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]
  18. 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]
  19. 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]
  20. 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]
  21. 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]
  22. 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 u 0 = 0.1 , 0.7 , 0.8 and u 0 = 1 .
Table 1. Numerical results for Example 3 with initial values u 0 = 0.1 , 0.7 , 0.8 and u 0 = 1 .
Iteration (p) u p u p u p u p
00.1000000.7000000.8000001.000000
10.5169820.6916000.7482190.544454
20.6250120.6874500.7437300.631923
30.6535000.6847010.7407550.655242
40.6613450.6826460.7385330.661784
50.6637230.6810080.7367600.663834
100.6655510.6757480.7310700.665551
5000.6666450.6666450.6979420.666645
91800.6666650.6666650.6739960.666665
91810.6666660.6666660.6739960.666666
64,2640.6666660.6666660.6666660.666666
64,2650.6666670.6666670.6666670.666667
64,2660.6666670.6666670.6666670.666667
Table 2. Numerical results for Example 4 with initial values u 0 = 0.1 , 0.7 , 0.8 and u 0 = 1 .
Table 2. Numerical results for Example 4 with initial values u 0 = 0.1 , 0.7 , 0.8 and u 0 = 1 .
Iteration (p) u p u p u p u p
00.1000000.7000000.8000001.000000
10.5636250.6916000.7482190.777096
20.6381050.6874500.7437300.749436
30.6569630.6847010.7407550.746439
40.6622560.6826460.7385330.744199
50.6639680.6810080.7367600.742413
100.6655570.6757480.7310700.736679
5000.6666450.6666450.6979420.703297
91440.6666650.6666650.6740280.679200
91450.6666660.6666660.6740270.679199
64,0080.6666660.6666660.6666660.666666
64,0090.6666670.6666670.6666670.666667
64,0100.6666670.6666670.6666670.666667
Table 3. Numerical results for Example 5 with initial values u 0 = 0.1 , 0.7 , 0.8 and u 0 = 1 .
Table 3. Numerical results for Example 5 with initial values u 0 = 0.1 , 0.7 , 0.8 and u 0 = 1 .
Iteration (p) u p u p u p u p
00.1000000.7000000.8000001.000000
11.0000000.6553310.6493980.649754
20.6536990.6659460.6677650.667654
30.6677800.6642010.6638760.663889
40.6645410.6653610.6654530.665450
50.6656650.6654330.6654070.665408
100.6660560.6660560.6660560.666056
5000.6666540.6666450.6666540.666654
53560.6666650.6666650.6666650.666665
53570.6666660.6666660.6666660.666666
37,4990.6666660.6666660.6666660.666666
37,5000.6666670.6666670.6666670.666667
37,5010.6666670.6666670.6666670.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.

Share and Cite

MDPI and ACS Style

Berinde, V.; Saleh, K. Averaged Iterative Algorithms for Convex Optimization Problems over a Common Fixed-Points Set of Demicontractive Mappings. Axioms 2026, 15, 8. https://doi.org/10.3390/axioms15010008

AMA Style

Berinde V, Saleh K. Averaged Iterative Algorithms for Convex Optimization Problems over a Common Fixed-Points Set of Demicontractive Mappings. Axioms. 2026; 15(1):8. https://doi.org/10.3390/axioms15010008

Chicago/Turabian Style

Berinde, Vasile, and Khairul Saleh. 2026. "Averaged Iterative Algorithms for Convex Optimization Problems over a Common Fixed-Points Set of Demicontractive Mappings" Axioms 15, no. 1: 8. https://doi.org/10.3390/axioms15010008

APA Style

Berinde, V., & Saleh, K. (2026). Averaged Iterative Algorithms for Convex Optimization Problems over a Common Fixed-Points Set of Demicontractive Mappings. Axioms, 15(1), 8. https://doi.org/10.3390/axioms15010008

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