A Perturbed Projection Algorithm with Inertial Technique for Split Feasibility Problem
Joint Authors
Dang, Yazheng
Han, Yanli
Gao, Yan
Source
Journal of Applied Mathematics
Issue
Vol. 2012, Issue 2012 (31 Dec. 2012), pp.1-10, 10 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2012-05-29
Country of Publication
Egypt
No. of Pages
10
Main Subjects
Abstract EN
This paper deals with the split feasibility problem that requires to find a point closest to a closed convex set in one space such that its image under a linear transformation will be closest to another closed convex set in the image space.
By combining perturbed strategy with inertial technique, we construct an inertial perturbed projection algorithm for solving the split feasibility problem.
Under some suitable conditions, we show the asymptotic convergence.
The results improve and extend the algorithms presented in Byrne (2002) and in Zhao and Yang (2005) and the related convergence theorem.
American Psychological Association (APA)
Dang, Yazheng& Gao, Yan& Han, Yanli. 2012. A Perturbed Projection Algorithm with Inertial Technique for Split Feasibility Problem. Journal of Applied Mathematics،Vol. 2012, no. 2012, pp.1-10.
https://search.emarefa.net/detail/BIM-1028764
Modern Language Association (MLA)
Dang, Yazheng…[et al.]. A Perturbed Projection Algorithm with Inertial Technique for Split Feasibility Problem. Journal of Applied Mathematics No. 2012 (2012), pp.1-10.
https://search.emarefa.net/detail/BIM-1028764
American Medical Association (AMA)
Dang, Yazheng& Gao, Yan& Han, Yanli. A Perturbed Projection Algorithm with Inertial Technique for Split Feasibility Problem. Journal of Applied Mathematics. 2012. Vol. 2012, no. 2012, pp.1-10.
https://search.emarefa.net/detail/BIM-1028764
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1028764