A modified Halpern's iterative scheme for solving split feasibility problems (Q1925450)
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: A modified Halpern's iterative scheme for solving split feasibility problems |
scientific article; zbMATH DE number 6116465
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A modified Halpern's iterative scheme for solving split feasibility problems |
scientific article; zbMATH DE number 6116465 |
Statements
A modified Halpern's iterative scheme for solving split feasibility problems (English)
0 references
18 December 2012
0 references
Summary: We introduce and study a modified Halpern's iterative scheme for solving the split feasibility problem (SFP) in the setting of infinite-dimensional Hilbert spaces. Under suitable conditions a strong convergence theorem is established. The main result presented in this paper improves and extends some recent results done by \textit{H.-K. Xu} [Inverse Probl. 26, No. 10, Article ID 105018, 17 p. (2010; Zbl 1213.65085)] and some others.
0 references
Halpern's iterative scheme
0 references
split feasibility problem
0 references
0 references
0.8719577789306641
0 references
0.8692585825920105
0 references
0.8623294830322266
0 references
0.8596577048301697
0 references
0.8527766466140747
0 references
