Elsevier

Linear Algebra and its Applications

Volume 34, December 1980, Pages 321-339
Linear Algebra and its Applications

On some methods for entropy maximization and matrix scaling

https://doi.org/10.1016/0024-3795(80)90171-8Get rights and content
Under an Elsevier user license
open archive

Abstract

We describe and survey in this paper iterative algorithms for solving the discrete maximum entropy problem with linear equality constraints. This problem has applications e.g. in image reconstruction from projections, transportation planning, and matrix scaling. In particular we study local convergence and asymptotic rate of convergence as a function of the iteration parameter. For the trip distribution problem in transportation planning and the equivalent problem of scaling a positive matrix to achieve a priori given row and column sums, it is shown how the iteration parameters can be chosen in an optimal way. We also consider the related problem of finding a matrix X, diagonally similar to a given matrix, such that corresponding row and column norms in X are all equal. Reports of some numerical tests are given.

Cited by (0)