Abstract
Iterative projection algorithms were studied for the convex feasibility problem. An algorithmic scheme was also proposed that generalizes both the string-averaging algorithm and the block-iterative projections (BIP) method with fixed blocks. The convergence of the string-averaging method in the inconsistent case was proved.
| Original language | English |
|---|---|
| Pages (from-to) | 543-554 |
| Number of pages | 12 |
| Journal | Optimization Methods and Software |
| Volume | 18 |
| Issue number | 5 |
| DOIs | |
| State | Published - Oct 2003 |
Bibliographical note
Funding Information:We apprcciate the careful rcviews of two anonymous referees that helpcd us to properly revise and correct the paper. We thank Simeon Reich from the Department of Mathematics at the Technion in Haifa for his useful comments. This work was done O1t the Centcr for Computational Mathematics and Scicntific Computation (CCMSC) of the Univcrsity of Haifa and was supported by grant 592/00 of the Israel Science Foundation, founded by the Israel Academy of Sciences and Humanities, and by grant HL 70472 from the National Institutes of Heallh (NIH).
Keywords
- Convex feasibility
- Inconsistent feasibility problem
- Product space
- Projection methods
- String-averaging
ASJC Scopus subject areas
- Software
- Control and Optimization
- Applied Mathematics