Convergence of weighted averages of relaxed projections
classification
🧮 math.MG
keywords
convergenceprojectionsrelaxedalgorithmaveragedaveragesbauschkeborwein
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.