Block-iterative algorithms

The recently presented sequential unconstrained minimization algorithm, SUMMA, is extended to provide a framework for the derivation of block‐iterative, or partial‐gradient, optimization methods. This block‐iterative SUMMA (BI‐SUMMA) includes, and is motivated by, block‐iterative versions of the alg...

Full description

Saved in:
Bibliographic Details
Published in:International transactions in operational research Vol. 16; no. 4; pp. 427 - 463
Main Author: Byrne, Charles
Format: Journal Article
Language:English
Published: Oxford, UK Blackwell Publishing Ltd 01.07.2009
Subjects:
Algorithms
Maximum likelihood method
Operations research
Optimization
reconstruction
Studies
ISSN:0969-6016, 1475-3995
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The recently presented sequential unconstrained minimization algorithm, SUMMA, is extended to provide a framework for the derivation of block‐iterative, or partial‐gradient, optimization methods. This block‐iterative SUMMA (BI‐SUMMA) includes, and is motivated by, block‐iterative versions of the algebraic reconstruction technique (ART) and its multiplicative variant, the MART. The BI‐SUMMA approach is designed to provide computationally tractable and quickly convergent algorithms. The rescaled block‐iterative expectation maximization maximum likelihood method (RBI‐EMML) is closely related to the RBI‐MART, but is not a particular case of BI‐SUMMA.
Bibliography:istex:63B5722B795C715887AE591E3C0E7383F2FC15A8
ArticleID:ITOR683
ark:/67375/WNG-CGGFZQ33-R
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0969-6016
1475-3995
DOI:10.1111/j.1475-3995.2008.00683.x