On the behavior of a block-iterative projection method for solving convex feasibility problems
- 1 January 1990
- journal article
- research article
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 34 (1-2) , 79-94
- https://doi.org/10.1080/00207169008803865
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.Keywords
This publication has 12 references indexed in Scilit:
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problemsLinear Algebra and its Applications, 1989
- Parallel application of block-iterative methods in medical imaging and radiation therapyMathematical Programming, 1988
- Convergence results for an accelerated nonlinear cimmino algorithmNumerische Mathematik, 1986
- A simultaneous projections method for linear inequalitiesLinear Algebra and its Applications, 1985
- Convergence of the cyclical relaxation method for linear inequalitiesMathematical Programming, 1984
- New methods for linear inequalitiesLinear Algebra and its Applications, 1982
- Row-Action Methods for Huge and Sparse Systems and Their ApplicationsSIAM Review, 1981
- The Relaxation Method for Solving Systems of Linear InequalitiesMathematics of Operations Research, 1980
- The method of projections for finding the common point of convex setsUSSR Computational Mathematics and Mathematical Physics, 1967
- The Relaxation Method for Linear InequalitiesCanadian Journal of Mathematics, 1954