Solving a split feasibility problem by the strong convergence of two projection algorithms in Hilbert spaces (Q830127)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Solving a split feasibility problem by the strong convergence of two projection algorithms in Hilbert spaces |
scientific article; zbMATH DE number 7345474
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving a split feasibility problem by the strong convergence of two projection algorithms in Hilbert spaces |
scientific article; zbMATH DE number 7345474 |
Statements
Solving a split feasibility problem by the strong convergence of two projection algorithms in Hilbert spaces (English)
0 references
7 May 2021
0 references
Summary: 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.
0 references
strong convergence
0 references
inertial shrinking projection algorithms
0 references
split convex feasibility problem
0 references
Hilbert spaces
0 references
hybrid projection methods
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.94207525
0 references
0.94066143
0 references
0.9369133
0 references
0.93557686
0 references
0.9339809
0 references
0.9335198
0 references
0.93115455
0 references
0.9290091
0 references
0.9285166
0 references
