Regularized methods for the split feasibility problem (Q410151)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6020957
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Regularized methods for the split feasibility problem |
scientific article; zbMATH DE number 6020957 |
Statements
Regularized methods for the split feasibility problem (English)
0 references
3 April 2012
0 references
Summary: Many applied problems such as image reconstructions and signal processing can be formulated as the split feasibility problem (SFP). Some algorithms have been introduced in the literature for solving the (SFP). In this paper, we will continue to consider the convergence analysis of the regularized methods for the (SFP). Two regularized methods are presented in the present paper. Under some different control conditions, we prove that the suggested algorithms strongly converge to the minimum norm solution of the (SFP).
0 references
split feasibility problem (SFP)
0 references
minimum norm solution
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8794495463371277
0 references
0.8601214289665222
0 references
0.8589354157447815
0 references
0.8442937135696411
0 references
0.8437814116477966
0 references
