Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4607238 | Journal of Approximation Theory | 2013 | 24 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Analysis
Authors
Alexander J. Zaslavski,