DYNAMIC STRING-AVERAGING PROJECTION METHODS FOR CONVEX FEASIBILITY PROBLEMS IN THE PRESENCE OF COMPUTATIONAL ERRORS

被引：1
|
作者：
Zaslavski, Alexander J. [1 ]
机构：
[1] Technion Israel Inst Technol, Dept Math, IL-32000 Haifa, Israel
来源：
JOURNAL OF NONLINEAR AND CONVEX ANALYSIS | 2014年 / 15卷 / 03期
关键词：
Approximate solution; feasibility problem; Hilbert space; string-averaging projection algorithm; CONVERGENCE; ALGORITHMS; PRODUCTS; HILBERT;
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
In the present paper we study convergence of dynamic string-averaging projection methods for solving convex feasibility problems in a Hilbert space. Our goal is to obtain an approximate solution of the problem in the presence of computational errors. We show that our dynamic string-averaging projection algorithm generates a good approximate solution, if the sequence of computational errors is bounded from above by a constant.
引用
收藏
页码：623 / 636
页数：14
相关论文
共 37 条
1234