Regularized Methods for the Split Feasibility Problem

Yonghong Yao, Wu Jigang and Yeong-Cheng Liou

Abstract and Applied Analysis, 2012, vol. 2012, issue 1

Abstract: 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).

Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2012/140679

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnlaaa:v:2012:y:2012:i:1:n:140679

Access Statistics for this article

More articles in Abstract and Applied Analysis from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().