Scaling of symmetric matrices by positive diagonal congruence

We consider the problem of characterizing n-by-n real symmetric matrices A for which there is an n-by-n diagonal matrix D, with positive diagonal entries, so that DAD has row (and column) sums 1. Under certain conditions we provide necessary and sufficient conditions for the existence of a scaling for A, based upon both the positive definiteness of A on a cone lying in the nonnegative orthant and the semipositivity of A. This generalizes known results for strictly copositive matrices. Also given are (1) a condition sufficient for a unique scaling; (2) a characterization of those positive semidefinite matrices that are scalable; and (3) a new condition equivalent to strict copositivity, which we call total scalability. When A has positive entries, a simple iterative algorithm (different from Sinkhorn's) is given to calculate the unique scaling.

[1]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[2]  Peter Lancaster,et al.  The theory of matrices , 1969 .

[3]  U. Rothblum,et al.  On complexity of matrix scaling , 1999 .

[4]  M. V. Menon.  REDUCTION OF A MATRIX WITH POSITIVE ELEMENTS TO A DOUBLY STOCHASTIC MATRIX , 1967 .

[5]  Rajesh Pereira,et al.  Differentiators and the geometry of polynomials , 2003 .

[6]  A UNIFIED TREATMENT OF SOME THEOREMS ON POSITIVE MATRICES , 2010 .

[7]  R. Brualdi.  The DAD theorem for arbitrary row sums , 1974 .

[8]  Richard Sinkhorn.  Diagonal equivalence to matrices with prescribed row and column sums. II , 1967 .

[9]  K. Schittkowski,et al.  NONLINEAR PROGRAMMING , 2022 .

[10]  David London,et al.  On matrices with a doubly stochastic pattern , 1971 .

[11]  P. Lancaster,et al.  The theory of matrices : with applications , 1985 .

[12]  Richard Sinkhorn,et al.  A Relationship between Arbitrary Positive Matrices and Stochastic Matrices , 1966, Canadian Journal of Mathematics.

[13]  Leonid Khachiyan,et al.  Diagonal Matrix Scaling and Linear Programming , 1992, SIAM J. Optim..

[14]  Katta G. Murty,et al.  Some NP-complete problems in quadratic and nonlinear programming , 1987, Math. Program..

[15]  R. Brualdi,et al.  The diagonal equivalence of a nonnegative matrix to a stochastic matrix , 1966 .

[16]  L. Khachiyan,et al.  ON THE COMPLEXITY OF NONNEGATIVE-MATRIX SCALING , 1996 .

[17]  Wilfred Kaplan,et al.  A test for copositive matrices , 2000 .

[18]  R. Bapat.  D1AD2 theorems for multidimensional matrices , 1982 .

[19]  M. Lewin.  On nonnegative matrices , 1971 .

[20]  U. Rothblum,et al.  Scalings of matrices which have prespecified row sums and column sums via optimization , 1989 .

[21]  I. Olkin,et al.  Scaling of matrices to achieve specified row and column sums , 1968 .

[22]  Kh. D. Ikramov,et al.  Conditionally definite matrices , 2000 .

[23]  M. Marcus,et al.  A Survey of Matrix Theory and Matrix Inequalities , 1965 .

[24]  Richard Sinkhorn.  A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices , 1964 .

[25]  Richard Sinkhorn,et al.  Concerning nonnegative matrices and doubly stochastic matrices , 1967 .

[26]  J. Csima,et al.  The DAD Theorem for Symmetric Non-negative Matrices , 1972, J. Comb. Theory, Ser. A.

[27]  Alberto Borobia,et al.  Matrix scaling: A geometric proof of Sinkhorn's theorem , 1998 .

[28]  Richard W. Cottle,et al.  Linear Complementarity Problem , 2009, Encyclopedia of Optimization.

[29]  R. Pyke,et al.  Doubly stochastic operators obtained from positive operators , 1965 .

[30]  Richard Sinkhorn.  Diagonal equivalence to matrices with prescribed row and column sums. II , 1974 .

[31]  Alex Samorodnitsky,et al.  A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents , 1998, STOC '98.

[32]  Generalized functions of symmetric matrices , 1965 .

[33]  Charles R. Johnson,et al.  Spectral theory of copositive matrices , 2005 .

[34]  D. Djoković,et al.  Note on nonnegative matrices , 1970 .