Regularized Methods for the Split Feasibility Problem
Copyright policy )Regularized Methods for the Split Feasibility Problem
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).
- Tianjin Polytechnic University China (People's Republic of)
- Cheng Shiu University Taiwan
split feasibility problem (SFP), minimum norm solution, QA1-939, Image processing (compression, reconstruction, etc.) in information and communication theory, Mathematics
split feasibility problem (SFP), minimum norm solution, QA1-939, Image processing (compression, reconstruction, etc.) in information and communication theory, Mathematics
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).40 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!