On Block-Iterative Entropy Maximization (Q3768708)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4027212
Language Label Description Also known as
default for all languages
No label defined
    English
    On Block-Iterative Entropy Maximization
    scientific article; zbMATH DE number 4027212

      Statements

      On Block-Iterative Entropy Maximization (English)
      0 references
      0 references
      0 references
      1987
      0 references
      Entropy maximization
      0 references
      linear equality constraints
      0 references
      special-purpose block- iterative algorithm
      0 references
      Multiplicative Algebraic Reconstruction Technique
      0 references
      Entropy maximization under linear equality constraints is considered and convergence of a special-purpose block-iterative algorithm for its solution is investigated. This algorithm processes in each iterative step a group of constraints. When each block contains a single equation then a well known row-action method, called MART (for ``Multiplicative Algebraic Reconstruction Technique''), is obtained. At the other extreme, when all equations are grouped into a single block, a fully simultaneous entropy maximization algorithm is obtained. In the general case the algorithm permits assignment of weights to the equations within each block to reflect any apriori knowledge, which might be available from the modelling of some real-world process, about their relative importance. The blocks are processed in an almost cyclic order and, in contrast to Bregman's method, the iterative step does not require inner-loop iterations but is rather represented by a closed form formula. The iterative step of the algorithm resembles that of the algorithm of \textit{J. N. Darroch} and \textit{D. Ratcliff} [Ann. Math. Statist. 43, 1470-1480 (1972; Zbl 0251.62020)]. However, additional insight into the nature of the algorithm, offered by a primal-dual approach to its analysis, results here in modifications of both theoretical and practical significance.
      0 references

      Identifiers