Generalized Ishikawa Iterative Algorithm with Errors and Variable Generalized Ishikawa Iterative Algorithm for Nonexpansive Mappings in Symmetric Banach Spaces

We present a generalized Ishikawa iterative algorithm with an error term and a variable generalized Ishikawa iterative algorithm. Leveraging the geometric symmetry inherent in uniformly convex Banach spaces, we establish their respective weak convergence theorems for nonexpansive mappings. As applications, we extend several recent results in the literature related to the proximal point algorithm and the split feasibility problem. Consequently, we propose a hyper-generalized proximal point algorithm and a hyper-generalized perturbation CQ algorithm. Our work not only broadens the application scope of these methods but also highlights the foundational role of symmetric space properties in ensuring algorithmic convergence.

Authors

Institutions

Publication Details

Journal
Symmetry
Published
2026-01-09
DOI
https://doi.org/10.3390/sym18010125
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

Generalized Ishikawa Iterative Algorithm with Errors and Variable Generalized Ishikawa Iterative Algorithm for Nonexpansive Mappings in Symmetric Banach Spaces

LiangJuan Yu, Wenying Zhao, Yuhan Zhu
Symmetry
Optimization and Variational Analysis
article

Generalized Ishikawa Iterative Algorithm with Errors and Variable Generalized Ishikawa Iterative Algorithm for Nonexpansive Mappings in Symmetric Banach Spaces

LiangJuan Yu, Wenying Zhao, Yuhan Zhu
article en

Abstract

We present a generalized Ishikawa iterative algorithm with an error term and a variable generalized Ishikawa iterative algorithm. Leveraging the geometric symmetry inherent in uniformly convex Banach spaces, we establish their respective weak convergence theorems for nonexpansive mappings. As applications, we extend several recent results in the literature related to the proximal point algorithm and the split feasibility problem. Consequently, we propose a hyper-generalized proximal point algorithm and a hyper-generalized perturbation CQ algorithm. Our work not only broadens the application scope of these methods but also highlights the foundational role of symmetric space properties in ensuring algorithmic convergence.

SymmetryVol. 18(1)
Mudanjiang Normal University (CN)
Openalex Percentile: Top 92%
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.