Change search
ReferencesLink to record
Permanent link

Direct link
Limit points of the iterative scaling procedure
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Mathematics (Div.).
2014 (English)In: Annals of Operations Research, ISSN 0254-5330, E-ISSN 1572-9338, Vol. 215, no 1, 15-23 p.Article in journal (Refereed) Published
Abstract [en]

The iterative scaling procedure (ISP) is an algorithm which computes a sequence of matrices, starting from some given matrix. The objective is to find a matrix 'proportional' to the given matrix, having given row and column sums. In many cases, for example if the initial matrix is strictly positive, the sequence is convergent. It is known that the sequence has at most two limit points. When these are distinct, convergence to these two points can be slow. We give an efficient algorithm which finds the limit points, invoking the ISP only on subproblems for which the procedure is convergent.

Place, publisher, year, edition, pages
2014. Vol. 215, no 1, 15-23 p.
Keyword [en]
Iterative scaling procedure, Alternating divergence minimization, Biproportional fitting
National Category
URN: urn:nbn:se:kth:diva-144349DOI: 10.1007/s10479-013-1416-2ISI: 000332831200002ScopusID: 2-s2.0-84897629453OAI: diva2:713458

QC 20140423

Available from: 2014-04-23 Created: 2014-04-22 Last updated: 2014-04-23Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Aas, Erik
By organisation
Mathematics (Div.)
In the same journal
Annals of Operations Research

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 125 hits
ReferencesLink to record
Permanent link

Direct link