Inequalities for semi-convex matrix functions (Q1336155)

Let us consider the Perron-Frobenius order for real matrices i.e., \(A \geq B\) means that every element of \(A - B\) is positive. The mapping \(f\) defined on the set \(T\) of matrices with values in the set of matrices is said to be semi-convex if \(X,Y \in T\), \(X \leq Y\) implies that \(\lambda X + (1 - \lambda)Y \in T\) for all \(0 < \lambda < 1\) and \(f(\lambda X + (1 - \lambda)Y) \leq \lambda f(X) + (1 - \lambda) f(Y)\). The authors point out some very interesting inequalities of Jensen's and Szegö's type for this kind of mappings. Some related results are also given.