Regularized methods for the split feasibility problem (Q410151): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q58694918, #quickstatements; #temporary_batch_1711055989931 |
||
Property / Wikidata QID | |||
Property / Wikidata QID: Q58694918 / rank | |||
Normal rank |
Revision as of 23:34, 21 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Regularized methods for the split feasibility problem |
scientific article |
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