On Projection Algorithms for Solving Convex Feasibility Problems

@article{Bauschke1996OnPA,
  title={On Projection Algorithms for Solving Convex Feasibility Problems},
  author={Heinz H. Bauschke and J. Borwein},
  journal={SIAM Rev.},
  year={1996},
  volume={38},
  pages={367-426}
}
Due to their extraordinary utility and broad applicability in many areas of classical mathematics and modern physical sciences (most notably, computerized tomography), algorithms for solving convex feasibility problems continue to receive great attention. To unify, generalize, and review some of these algorithms, a very broad and flexible framework is investigated. Several crucial new concepts which allow a systematic discussion of questions on behaviour in general Hilbert spaces and on the… Expand
The Convex Feasibility Problem and Mann-type Iteration
Extrapolation algorithm for affine-convex feasibility problems
AN ALTERNATING PROJECTIONS ALGORITHM FOR SOLVING LINEAR PROGRAMS
Incomplete projection algorithms for solving the convex feasibility problem
Sequential and parallel projection algorithms for feasibility and optimization
  • Y. Censor
  • Mathematics, Engineering
  • International Symposium on Multispectral Image Processing and Pattern Recognition
  • 2001
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 154 REFERENCES
...
1
2
3
4
5
...