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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International transactions in operational research Jg. 16; H. 4; S. 427 - 463
1. Verfasser: Byrne, Charles
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Oxford, UK Blackwell Publishing Ltd 01.07.2009
Schlagworte:
ISSN:0969-6016, 1475-3995
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie: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