Abstract
The behavior of a class of block-iterative projection algorithms for solving convex feasibility problems is studied. A limit characterization theorem and a convergence criterion are proven. Ways of accelerating the computational procedures are pointed out.
| Original language | English |
|---|---|
| Pages (from-to) | 79-94 |
| Number of pages | 16 |
| Journal | International Journal of Computer Mathematics |
| Volume | 34 |
| Issue number | 1-2 |
| DOIs | |
| State | Published - Jan 1990 |
Keywords
- Convex feasibility problem
- block-iterative projection method
- orthogonal projection
- relaxation method
- simultaneous projection operator
- transfer operator
ASJC Scopus subject areas
- Computer Science Applications
- Computational Theory and Mathematics
- Applied Mathematics