Subgradient projection algorithms for convex feasibility problems in the presence of computational errors

被引:4
|
作者
Zaslavski, Alexander J. [1 ]
机构
[1] Technion Israel Inst Technol, Dept Math, IL-32000 Haifa, Israel
关键词
Approximate solution; Feasibility problem; Hilbert space; Subgradient projection algorithm; CONVERGENCE;
D O I
10.1016/j.jat.2013.07.012
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
In the present paper we study convergence of subgradient projection algorithms 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 subgradient projection algorithm generates a good approximate solution, if the sequence of computational errors is bounded from above by a constant. (c) 2013 Elsevier Inc. All rights reserved.
引用
收藏
页码:19 / 42
页数:24
相关论文
共 50 条