Regularized Methods for the Split Feasibility Problem
Joint Authors
Jigang, Wu
Liou, Yeong-Cheng
Yao, Yonghong
Source
Issue
Vol. 2012, Issue 2012 (31 Dec. 2012), pp.1-13, 13 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2012-02-20
Country of Publication
Egypt
No. of Pages
13
Main Subjects
Abstract EN
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).
American Psychological Association (APA)
Yao, Yonghong& Jigang, Wu& Liou, Yeong-Cheng. 2012. Regularized Methods for the Split Feasibility Problem. Abstract and Applied Analysis،Vol. 2012, no. 2012, pp.1-13.
https://search.emarefa.net/detail/BIM-448966
Modern Language Association (MLA)
Yao, Yonghong…[et al.]. Regularized Methods for the Split Feasibility Problem. Abstract and Applied Analysis No. 2012 (2012), pp.1-13.
https://search.emarefa.net/detail/BIM-448966
American Medical Association (AMA)
Yao, Yonghong& Jigang, Wu& Liou, Yeong-Cheng. Regularized Methods for the Split Feasibility Problem. Abstract and Applied Analysis. 2012. Vol. 2012, no. 2012, pp.1-13.
https://search.emarefa.net/detail/BIM-448966
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-448966