Translator Disclaimer
2012 A Perturbed Projection Algorithm with Inertial Technique for Split Feasibility Problem
Yazheng Dang, Yan Gao, Yanli Han
J. Appl. Math. 2012(SI03): 1-10 (2012). DOI: 10.1155/2012/207323

Abstract

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.

Citation

Download Citation

Yazheng Dang. Yan Gao. Yanli Han. "A Perturbed Projection Algorithm with Inertial Technique for Split Feasibility Problem." J. Appl. Math. 2012 (SI03) 1 - 10, 2012. https://doi.org/10.1155/2012/207323

Information

Published: 2012
First available in Project Euclid: 3 January 2013

zbMATH: 1256.65052
MathSciNet: MR2927264
Digital Object Identifier: 10.1155/2012/207323

Rights: Copyright © 2012 Hindawi

JOURNAL ARTICLE
10 PAGES


SHARE
Vol.2012 • No. SI03 • 2012
Back to Top