A review of matrix scaling and Sinkhorn's normal form for matrices and positive maps
Martin Idel

TL;DR
This paper reviews over 70 years of research on matrix scaling and Sinkhorn's theorem, emphasizing its mathematical foundations and recent generalizations to positive maps, with minimal new unpublished results.
Contribution
It provides a comprehensive overview of the mathematical landscape of matrix scaling and Sinkhorn's theorem, including recent extensions to positive maps.
Findings
Extensive historical overview of matrix scaling methods.
Discussion of generalizations to positive maps.
Highlights of mathematical techniques used in the field.
Abstract
Given a nonnegative matrix , can you find diagonal matrices such that is doubly stochastic? The answer to this question is known as Sinkhorn's theorem. It has been proved with a wide variety of methods, each presenting a variety of possible generalisations. Recently, generalisations such as to positive maps between matrix algebras have become more and more interesting for applications. This text gives a review of over 70 years of matrix scaling. The focus lies on the mathematical landscape surrounding the problem and its solution as well as the generalisation to positive maps and contains hardly any nontrivial unpublished results.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Advanced Optimization Algorithms Research · Graph theory and applications
