A Three-Step Iterative Scheme for Nonexpansive Mappings: Convergence Analysis and Applications to Convex Optimization

This study focuses on a three-step iterative scheme, referred to as the NIP iteration, for the approximation of fixed points associated with nonexpansive mappings in uniformly convex Banach spaces. Weak convergence is established using Fejér monotonicity, asymptotic regularity and the demiclosedness principle. Strong convergence is proved under uniform convexity, compactness, and Condition (I) of Senter and Dotson. A numerical convergence and computational-cost comparison is developed numerically, showing that the NIP iteration performs better than the Ishikawa, S, Noor, Abbas–Nazir and SP schemes. Numerical experiments for nonlinear nonexpansive mappings validate the theoretical findings. An application to convex optimization via fixed point reformulation is also presented, illustrating the effectiveness of the method.

Authors

Institutions

Publication Details

Journal
Axioms
Published
2026-09-11
DOI
https://doi.org/10.3390/axioms15090680
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 Three-Step Iterative Scheme for Nonexpansive Mappings: Convergence Analysis and Applications to Convex Optimization

Fahad Maqbul Alamrani, Faizan Ahmad Khan, Nidal H. E. Eljaneid, Nifeen H. Altaweel et al.
Axioms
Optimization and Variational Analysis
article

A Three-Step Iterative Scheme for Nonexpansive Mappings: Convergence Analysis and Applications to Convex Optimization

Fahad Maqbul Alamrani, Faizan Ahmad Khan, Nidal H. E. Eljaneid, Nifeen H. Altaweel, Shurooq B. Alblawie, Mona Y. Alfefi, Rana Ahmed Alshehri
article en

Abstract

This study focuses on a three-step iterative scheme, referred to as the NIP iteration, for the approximation of fixed points associated with nonexpansive mappings in uniformly convex Banach spaces. Weak convergence is established using Fejér monotonicity, asymptotic regularity and the demiclosedness principle. Strong convergence is proved under uniform convexity, compactness, and Condition (I) of Senter and Dotson. A numerical convergence and computational-cost comparison is developed numerically, showing that the NIP iteration performs better than the Ishikawa, S, Noor, Abbas–Nazir and SP schemes. Numerical experiments for nonlinear nonexpansive mappings validate the theoretical findings. An application to convex optimization via fixed point reformulation is also presented, illustrating the effectiveness of the method.

AxiomsVol. 15(9)
University of Tabuk (SA)
Openalex Percentile: Top 9%
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.