Highly Influenced

# On the complexity of general matrix scaling and entropy minimization via the RAS algorithm

@article{Kalantari2008OnTC, title={On the complexity of general matrix scaling and entropy minimization via the RAS algorithm}, author={Bahman Kalantari and Isabella Lari and Federica Ricca and Bruno Simeone}, journal={Math. Program.}, year={2008}, volume={112}, pages={371-401} }

- Published 2008 in Math. Program.
DOI:10.1007/s10107-006-0021-4

Given an n × m nonnegative matrix A = (aij) and positive integral vectors r ∈ n and c ∈ m having a common one-norm h, the (r, c)-scaling problem is to obtain positive diagonal matrices X and Y, if they exist, such that XAY has row and column sums equal to r and c, respectively. The entropy minimization problem corresponding to A is to find an n × m matrix z = (zij) having the same zero pattern as A, the sum of whose entries is a given number h, its row and column sums are within given integral… CONTINUE READING

Highly Cited

This paper has 26 citations. REVIEW CITATIONS