Scalings of matrices which have prespecified row sums and column sums via optimization (Q1123947): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0024-3795(89)90491-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2047354852 / rank | |||
Normal rank | |||
Revision as of 22:19, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scalings of matrices which have prespecified row sums and column sums via optimization |
scientific article |
Statements
Scalings of matrices which have prespecified row sums and column sums via optimization (English)
0 references
1989
0 references
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.
0 references
matrix scaling
0 references
optimization
0 references
biproportional scaling
0 references
convex minimization
0 references
