Reverse forms of a convex matrix inequality (Q1893096)

Let \(A\) and \(B\) be two complex Hermitian positive definite matrices, and let \(0\leq \lambda\leq 1\). Then \[ [\lambda A+ (1-\lambda) B]^{-1}\leq \lambda A^{-1}+(1-\lambda) B^{-1},\tag{1} \] where \(A\geq B\) means that \(A-B\) is a positive semidefinite matrix. The authors prove two reverse forms of (1) up to a multiplicative constant.