Solving a Split Feasibility Problem by the Strong Convergence of Two Projection Algorithms in Hilbert Spaces

Hasanen A. Hammad, Habib Ur Rehman, Yaé Ulrich Gaba*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)

Abstract

The goal of this manuscript is to establish strong convergence theorems for inertial shrinking projection and CQ algorithms to solve a split convex feasibility problem in real Hilbert spaces. Finally, numerical examples were obtained to discuss the performance and effectiveness of our algorithms and compare the proposed algorithms with the previous shrinking projection, hybrid projection, and inertial forward-backward methods.

Original languageEnglish
Article number5562694
JournalJournal of Function Spaces
Volume2021
DOIs
Publication statusPublished - 2021
Externally publishedYes

Fingerprint

Dive into the research topics of 'Solving a Split Feasibility Problem by the Strong Convergence of Two Projection Algorithms in Hilbert Spaces'. Together they form a unique fingerprint.

Cite this