Convergence of weighted averages of relaxed projections
From MaRDI portal
Publication:5375916
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.
Recommendations
- scientific article; zbMATH DE number 7213713
- On Projection Algorithms for Solving Convex Feasibility Problems
- Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems
- The method of alternating relaxed projections for two nonconvex sets
- On convex feasibility problems
Cites work
- Block-iterative surrogate projection methods for convex feasibility problems
- Hilbertian convex feasibility problem: Convergence of projection methods
- On Projection Algorithms for Solving Convex Feasibility Problems
- Quasi-Fejérian analysis of some optimization algorithms
- Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces
- Strong convergence of projection-like methods in Hilbert spaces
- Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings
Cited in
(6)- Convergence of relaxation algorithms by averaging
- Fixed points of averages of resolvents: geometry and algorithms
- The relation between the weight factor and the number of steps in a projection algorithm
- Relaxed outer projections, weighted averages and convex feasibility
- Comparing averaged relaxed cutters and projection methods: theory and examples
- Generalized relaxations of nonexpansive operators and convex feasibility problems
This page was built for publication: Convergence of weighted averages of relaxed projections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5375916)
