Skip to main navigation Skip to search Skip to main content

Fixed- and Attractive-Point Results for Enriched Cλ g-Nonexpansive Mappings with Application

  • University of Johannesburg
  • China Medical University Taichung

Research output: Contribution to journal › Article › peer-review

Abstract

In this paper, we introduce a new class of mappings called enriched (Formula presented.) g-nonexpansive mappings, which extends the class of g-nonexpansive mappings employing an enriched (Formula presented.) -type condition. We discuss the existence of its fixed point and approximation of generalized g-attractive points associated with the proposed class of mappings. In particular, we study several structural properties of the corresponding attractive point set and develop a g-averaged viscosity-type iterative scheme to approximate its elements. Under suitable assumptions for the control sequences, we prove the strong convergence of the generated sequence to a generalized g-attractive point. Fixed-point and coincidence-point results are thus obtained as special cases of the proposed approach. As an application, we apply our result to find the existence of the best approximations. We also illustrate the applicability of the proposed iteration method through a numerical experiment. The numerical results demonstrate the effect of the parameter (Formula presented.) on the convergence behavior and show that larger values of (Formula presented.) provide better numerical performance for the considered example.

Original languageEnglish
Article number873
JournalAlgorithms
Volume19
Issue number10
DOIs
Publication statusPublished - Oct 2026

Keywords

  • attractive points
  • enriched C g-nonexpansive
  • fixed points
  • iterative approximation

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Numerical Analysis
  • Computational Theory and Mathematics
  • Computational Mathematics

Fingerprint

Dive into the research topics of 'Fixed- and Attractive-Point Results for Enriched Cλ g-Nonexpansive Mappings with Application'. Together they form a unique fingerprint.

Cite this