Abstract
An iterative method is proposed for solving convex feasibility problems. Each iteration is a convex combination of projections onto the given convex sets where the weights of the combination may vary from step to step. It is shown that any sequence of iterations generated by the algorithm converges if the intersection of the given family of convex sets is nonempty and that the limit point of the sequence belongs to this intersection under mild conditions on the sequence of weight functions. Special cases are block-iterative processes where in each iterative step a certain subfamily of the given family of convex sets is used. In particular, a block-iterative version of the Agmon-Motzkin-Schoenberg relaxation method for solving systems of linear inequalities is derived. Such processes lend themselves to parallel implementation and will be useful in various areas of applications, including image reconstruction from projections, image restoration, and other fully discretized inversion problems.
| Original language | English |
|---|---|
| Pages (from-to) | 165-175 |
| Number of pages | 11 |
| Journal | Linear Algebra and Its Applications |
| Volume | 120 |
| Issue number | C |
| DOIs | |
| State | Published - Aug 1989 |
Bibliographical note
Funding Information:*Y. Censor's work on this research was supported by the National Institutes of Health, Grant No. HL-28438, while visiting the Medical Image Processing Group (MIPG) at the Department of Radiology, Hospital of the University of Pennsylvania, Philadelphia.
ASJC Scopus subject areas
- Algebra and Number Theory
- Numerical Analysis
- Geometry and Topology
- Discrete Mathematics and Combinatorics