All Questions
5 questions
1
vote
2
answers
86
views
Entrywise $\infty$-norm of squared difference of square roots of matrices
For a positive $n \times n$ definite real matrix $M$ we denote by $\sqrt{M}$ the positive square root of $M$. For an $n \times n$ matrix $A$ denote its entrywise infinity norm by
$$\|A\|_{\infty,\...
9
votes
2
answers
1k
views
$2$-norm distance between square roots of matrices
Suppose two square real matrices $A$ and $B$ are close in the Schatten 1-norm, i.e. $\|A-B\|_1=\varepsilon$. Can this be used to put a bound on the Schatten 2-norm distance between their square roots. ...
13
votes
2
answers
1k
views
A matrix norm inequality
Suppose that $A, B$ are Hermitian positive definite matrices of the same order and $0\le p\le 1$. Using a standard approach in matrix analysis, one can show that
$\|A^{1-p}B^p\|\ge \|A\sharp_p B\|$, ...
19
votes
1
answer
856
views
A possible extension of a determinant inequality
It is well known that if $A, B$ are positive semidefinite matrices, then $$\det (A+B)\ge \det A+\det B.$$
I am considering a possible extension of this result. Let $\mathbb{M}_m(\mathbb{M}_n)$ ...
21
votes
0
answers
868
views
Noncommutative arithmetic mean geometric mean inequality and symmetric polynomials
While analyzing convergence speed of stochastic-gradient methods for convex optimization problems, Recht et al (2011) posed a tantalizing conjecture. It seems quite tricky, so after having struggled a ...