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

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Hasanen A. Hammad, Habib ur Rehman, Yaé Ulrich Gaba
Format: Article
Language:English
Published: Wiley 2021-01-01
Series:Journal of Function Spaces
Online Access:http://dx.doi.org/10.1155/2021/5562694
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1850171783515209728
author Hasanen A. Hammad
Habib ur Rehman
Yaé Ulrich Gaba
author_facet Hasanen A. Hammad
Habib ur Rehman
Yaé Ulrich Gaba
author_sort Hasanen A. Hammad
collection DOAJ
description 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.
format Article
id doaj-art-ab248f5635f34f3b8f742c453fa2922a
institution OA Journals
issn 2314-8896
2314-8888
language English
publishDate 2021-01-01
publisher Wiley
record_format Article
series Journal of Function Spaces
spelling doaj-art-ab248f5635f34f3b8f742c453fa2922a2025-08-20T02:20:12ZengWileyJournal of Function Spaces2314-88962314-88882021-01-01202110.1155/2021/55626945562694Solving a Split Feasibility Problem by the Strong Convergence of Two Projection Algorithms in Hilbert SpacesHasanen A. Hammad0Habib ur Rehman1Yaé Ulrich Gaba2Department of Mathematics, Faculty of Science, Sohag University, Sohag 82524, EgyptDepartment of Mathematics, Monglkuts University of Technology, Bangkok 10140, ThailandQuantum Leap Africa (QLA), AIMS Rwanda Centre, Remera Sector KN 3, Kigali, RwandaThe 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.http://dx.doi.org/10.1155/2021/5562694
spellingShingle Hasanen A. Hammad
Habib ur Rehman
Yaé Ulrich Gaba
Solving a Split Feasibility Problem by the Strong Convergence of Two Projection Algorithms in Hilbert Spaces
Journal of Function Spaces
title Solving a Split Feasibility Problem by the Strong Convergence of Two Projection Algorithms in Hilbert Spaces
title_full Solving a Split Feasibility Problem by the Strong Convergence of Two Projection Algorithms in Hilbert Spaces
title_fullStr Solving a Split Feasibility Problem by the Strong Convergence of Two Projection Algorithms in Hilbert Spaces
title_full_unstemmed Solving a Split Feasibility Problem by the Strong Convergence of Two Projection Algorithms in Hilbert Spaces
title_short Solving a Split Feasibility Problem by the Strong Convergence of Two Projection Algorithms in Hilbert Spaces
title_sort solving a split feasibility problem by the strong convergence of two projection algorithms in hilbert spaces
url http://dx.doi.org/10.1155/2021/5562694
work_keys_str_mv AT hasanenahammad solvingasplitfeasibilityproblembythestrongconvergenceoftwoprojectionalgorithmsinhilbertspaces
AT habiburrehman solvingasplitfeasibilityproblembythestrongconvergenceoftwoprojectionalgorithmsinhilbertspaces
AT yaeulrichgaba solvingasplitfeasibilityproblembythestrongconvergenceoftwoprojectionalgorithmsinhilbertspaces