A study of fixed point approximation for Quasi-Nonexpansive mappings with the general Picard-Mann algorithm

Abstract This paper investigates the approximation of fixed points for quasi-nonexpansive mappings in Banach spaces using the general Picard-Mann (GPM) algorithm. Under mild conditions such as the demiclosedness of $$I - \digamma $$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>I</mml:mi> <mml:mo>-</mml:mo> <mml:mi>ϝ</mml:mi> </mml:mrow> </mml:math> at zero and the Opial property, we derive weak and strong convergence theorems for the iterative sequences generated by the GPM method. We establish several stability results for the GPM scheme, including summably almost stability property for quasi-contractive mappings. The theoretical findings are applied to the classical relaxation method for solving systems of linear inequalities, demonstrating the practical relevance of our approach. Numerical examples in $$\mathbb {R}^4$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msup> <mml:mrow> <mml:mi>R</mml:mi> </mml:mrow> <mml:mn>4</mml:mn> </mml:msup> </mml:math> and $$\ell ^2$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msup> <mml:mi>ℓ</mml:mi> <mml:mn>2</mml:mn> </mml:msup> </mml:math> are provided to illustrate the efficiency and convergence behavior of the proposed algorithm. The results presented herein extend and complement existing work in fixed point theory and iterative approximation methods.

Authors

Institutions

Publication Details

Journal
ANNALI DELL UNIVERSITA DI FERRARA
Published
2026-02-25
DOI
https://doi.org/10.1007/s11565-026-00650-3
Primary Topic
Optimization and Variational Analysis
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A study of fixed point approximation for Quasi-Nonexpansive mappings with the general Picard-Mann algorithm

Rahul Shukla
ANNALI DELL UNIVERSITA DI FERRARA
Optimization and Variational Analysis
article

A study of fixed point approximation for Quasi-Nonexpansive mappings with the general Picard-Mann algorithm

Rahul Shukla
article en

Abstract

Abstract This paper investigates the approximation of fixed points for quasi-nonexpansive mappings in Banach spaces using the general Picard-Mann (GPM) algorithm. Under mild conditions such as the demiclosedness of $$I - \digamma $$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>I</mml:mi> <mml:mo>-</mml:mo> <mml:mi>ϝ</mml:mi> </mml:mrow> </mml:math> at zero and the Opial property, we derive weak and strong convergence theorems for the iterative sequences generated by the GPM method. We establish several stability results for the GPM scheme, including summably almost stability property for quasi-contractive mappings. The theoretical findings are applied to the classical relaxation method for solving systems of linear inequalities, demonstrating the practical relevance of our approach. Numerical examples in $$\mathbb {R}^4$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msup> <mml:mrow> <mml:mi>R</mml:mi> </mml:mrow> <mml:mn>4</mml:mn> </mml:msup> </mml:math> and $$\ell ^2$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msup> <mml:mi>ℓ</mml:mi> <mml:mn>2</mml:mn> </mml:msup> </mml:math> are provided to illustrate the efficiency and convergence behavior of the proposed algorithm. The results presented herein extend and complement existing work in fixed point theory and iterative approximation methods.

ANNALI DELL UNIVERSITA DI FERRARAVol. 72(2)
Walter Sisulu University (ZA)
Openalex Percentile: Top 42%
Optimization and Variational Analysis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.