Reverse forms of a convex matrix inequality (Q1893096)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 769034
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reverse forms of a convex matrix inequality |
scientific article; zbMATH DE number 769034 |
Statements
Reverse forms of a convex matrix inequality (English)
0 references
3 July 1995
0 references
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.
0 references
convex matrix inequality
0 references
complex Hermitian positive definite matrices
0 references
0.8318761587142944
0 references
0.8146770000457764
0 references
0.8012086749076843
0 references
0.8012086749076843
0 references
