Diagonal matrix scaling is NP-hard (Q1908195)

The author shows that the general scaling problem \(XAX e = e\), \(X = \text{diag} \{x_1,\dots,x_n\} > 0\), where \(e\) is the vector of all ones, \(X\) is a positive diagonal matrix and \(A\) is a symmetric \(n \times n\) matrix, is NP-hard. Equivalently, it is NP-hard to check for a given symmetric matrix \(A\) whether the logarithmic barrier function \({1 \over 2} x^T Ax - \Sigma \ln x_i\) has a stationary point in the positive orthant \(x > 0\).