Abstract
Some row-action algorithms which exploit special objective function and constraints structure have proven advantageous for solving huge and sparse feasibility or optimization problems. Recently developed block-iterative versions of such special-purpose methods enable parallel computation when the underlying problem is appropriately decomposed. This opens the door for parallel computation in image reconstruction problems of computerized tomography and in the inverse problem of radiation therapy treatment planning, all in their fully discretized modelling approach. Since there is more than one way of deriving block-iterative versions of any row-action method, the choice has to be made with reference to the underlying real-world problem.
Original language | English |
---|---|
Pages (from-to) | 307-325 |
Number of pages | 19 |
Journal | Mathematical Programming |
Volume | 42 |
Issue number | 1-3 |
DOIs | |
State | Published - Apr 1988 |
Keywords
- Cimmino's algorithm
- Full discretization
- block-iterative algorithms
- classification of algorithms
- computerized tomography
- entropy maximization
- image reconstruction
- parallel computations
- radiotherapy treatment planning
ASJC Scopus subject areas
- Software
- General Mathematics