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...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:International transactions in operational research Ročník 16; číslo 4; s. 427 - 463
Hlavný autor: Byrne, Charles
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Oxford, UK Blackwell Publishing Ltd 01.07.2009
Predmet:
Algorithms
Maximum likelihood method
Operations research
Optimization
reconstruction
Studies
ISSN:0969-6016, 1475-3995
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
Bibliografia: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