On Projection Algorithms for Solving Convex Feasibility Problems

Explore this paper's citation graph

Summary

A very broad and flexible framework is investigated which allows a systematic discussion of questions on behaviour in general Hilbert spaces and on the quality of convergence in convex feasibility problems.

Type
article
Published
1996-09-01
Cited by
1,829
References
103
Access
Open access

Keywords

Convergence (economics), Regular polygon, Hilbert space, Projection (relational algebra), Algorithm

References

Cited by

Related papers