Regularized methods for the split feasibility problem (Q410151): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / review text
 
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).
Property / review text: 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). / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 94A08 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6020957 / rank
 
Normal rank
Property / zbMATH Keywords
 
split feasibility problem (SFP)
Property / zbMATH Keywords: split feasibility problem (SFP) / rank
 
Normal rank
Property / zbMATH Keywords
 
minimum norm solution
Property / zbMATH Keywords: minimum norm solution / rank
 
Normal rank

Revision as of 19:23, 29 June 2023

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
    0 references
    0 references
    0 references
    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
    0 references
    split feasibility problem (SFP)
    0 references
    minimum norm solution
    0 references