Convergence of weighted averages of relaxed projections

Abstract

The convergence of the algorithm for solving convex feasibility problem is studied by the method of sequential averaged and relaxed projections. Some results of H. H. Bauschke and J. M. Borwein are generalized by introducing new methods. Examples illustrating these generalizations are given.