Convergence of iterative algorithm for G-nonexpansive mapping with digraph: application on G-variational inequality problem and signal recovery

dc.authoridhttps://orcid.org/0000-0002-1655-0993
dc.contributor.authorYolaçan, Esra
dc.date.accessioned2025-07-07T06:37:42Z
dc.date.available2025-07-07T06:37:42Z
dc.date.issued2025
dc.departmentKapadokya Üniversitesi
dc.description.abstractThe Halpern iteration method is among the most extensively studied approaches in the literature concerning the approximation of fixed points of G-nonexpansive mappings. In recent years, numerous extensions and modifications of this method have been proposed in various abstract settings. Among these, the formulation introduced by Tiammee et al., which adapts Halpern's iterative scheme to the context of Hilbert spaces endowed with a digraph structure, has garnered particular attention. This study investigates the convergence properties of G-nonexpansive mappings on a Hilbert space equipped with a digraph, thereby extending and enhancing the results previously obtained by Suzuki, Pang & Naraghirad and Tiammee et al. Moreover, a numerical example implemented in MATLAB R2016a is provided to illustrate and support the theoretical findings. Finally, by employing the concept of the G-variational inequality, as introduced by Kangtunyakarn in 2020, we illustrate the effectiveness of the proposed algorithm in the field of signal recovery, thereby highlighting its potential for real-world implementation.
dc.identifier.citationYolaçan, E. (2025). Convergence of iterative algorithm for G-nonexpansive mapping with digraph: application on G-variational inequality problem and signal recovery. Applied Mathematics in Science and Engineering, 33(1).
dc.identifier.endpage13
dc.identifier.issue1
dc.identifier.scopusqualityQ2
dc.identifier.startpage1
dc.identifier.urihttps://www.tandfonline.com/doi/full/10.1080/27690911.2025.2527099
dc.identifier.urihttps://doi.org/10.1080/27690911.2025.2527099
dc.identifier.urihttps://hdl.handle.net/20.500.12695/3559
dc.identifier.volume33
dc.indekslendigikaynakWeb of Science
dc.language.isoen
dc.publisherTaylor Francis
dc.relation.ispartofApplied Mathematics in Science and Engineering
dc.relation.publicationcategoryMakale - Uluslararası - Editör Denetimli Dergi
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.subjectHalpern iteration
dc.subjectedge-preserving
dc.subjectproperty G
dc.subjectˆ digraph
dc.subjectfixed point
dc.titleConvergence of iterative algorithm for G-nonexpansive mapping with digraph: application on G-variational inequality problem and signal recovery
dc.typeArticle

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
[ X ]
İsim:
Convergence of iterative algorithm for G-nonexpansive mapping with digraph application on G-variational inequality problem and signal recovery.pdf
Boyut:
1.61 MB
Biçim:
Adobe Portable Document Format
Lisans paketi
Listeleniyor 1 - 1 / 1
[ X ]
İsim:
license.txt
Boyut:
1.17 KB
Biçim:
Item-specific license agreed upon to submission
Açıklama: