Scalings of matrices which have prespecified row sums and column sums via optimization (Q1123947): Difference between revisions

The biproportional scaling problem for matrices is transformed into a convex minimization problem. This transformation is then used to characterize the existence of such a scaling or of an approximation to one. The approach leads to some new results and to streamlined proofs of known results.