Mohammad Sababheh
In this article, we prove that convex functions and log-convex functions obey certain general refinements that lead to several refinements and reverses of well known inequalities for matrices, including Young's inequality, Heinz inequality, the arithmetic-harmonic and the geometric-harmonic mean inequalities.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We define a convex-polynomial to be one that is a convex combination of the monomials $\{1, z, z^2, \ldots\}$. This paper explores the intimate connection between peaking convex-polynomials, interpolating convex-polynomials, invariant convex sets, and the dynamics of matrices. In particular, we use these intertwined relations to both prove which matrices are convex-cyclic while at the same time proving that we can prescribe the values and a finite number of the derivatives of a convex-polynomial subject to certain natural constraints. These properties are also equivalent to determining those m…
We study various convex functions on $R^n$ associated with positive definite matrices. This yiels some exotic Holder matrix inequalities.
The matrix convexity and the matrix monotony of a real $C^1$ function $f$ on $(0,\infty)$ are characterized in terms of the conditional negative or positive definiteness of the Loewner matrices associated with $f$, $tf(t)$, and $t^2f(t)$. Similar characterizations are also obtained for matrix monotone functions on a finite interval $(a,b)$.
In this article, we are going to search for $n\times n$ matrices $A$ and $B$ such that their generalized numerical range $$W_A(B)=\{tr(AU^*BU) \ :\ U^*U=UU^*=I\}$$ is convex. More specifically, we consider $A=\hat{A}\oplus I_k$ and $B=\hat{B}\oplus I_k$ where $\hat{A}$ and $\hat{B}$ are $2\times 2$. If $W_A(B)=W_{\hat{A}}(\hat{B})$ then it is a convex set.
In this paper we prove a conjecture stated by the first two authors establishing the closure of the numerical range of a certain class of $n+1$-periodic tridiagonal operators as the convex hull of the numerical ranges of two tridiagonal $(n+1) \times (n+1)$ matrices. Furthermore, when $n+1$ is odd, we show that the size of such matrices simplifies to $\frac{n}{2}+1$.
We develop \emph{geometric optimisation} on the manifold of Hermitian positive definite (HPD) matrices. In particular, we consider optimising two types of cost functions: (i) geodesically convex (g-convex); and (ii) log-nonexpansive (LN). G-convex functions are nonconvex in the usual euclidean sense, but convex along the manifold and thus allow global optimisation. LN functions may fail to be even g-convex, but still remain globally optimisable due to their special structure. We develop theoretical tools to recognise and generate g-convex functions as well as cone theoretic fixed-point optimis…
The quaternionic numerical range of matrices over the ring of quaternions is not necessarily convex. We prove Toeplitz-Hausdorff like theorem, that is, for any given quaternionic matrix every section of its quaternionic numerical range is convex. We provide some additional equivalent conditions for the quaternionic numerical range of matrices over quaternions to be convex and prove some numerical radius inequalities.
For a given set of $n\times n$ matrices $\mathcal F$, we study the union of the $C$-numerical ranges of the matrices in the set $\mathcal F$, denoted by $W_C({\mathcal F})$. We obtain basic algebraic and topological properties of $W_C({\mathcal F})$, and show that there are connections between the geometric properties of $W_C({\mathcal F})$ and the algebraic properties of $C$ and the matrices in ${\mathcal F}$. Furthermore, we consider the starshapedness and convexity of the set $W_C({\mathcal F})$. In particular, we show that if ${\mathcal F}$ is the convex hull of two matrices such that $W_C…
We offer a new proof of uniform convexity inequalities for the Finsler manifold of nonpositive curvature taken on the space of positive-semidefinite matrices with the weighted matrix geometric mean defining the geodesic between two points. Using the technique of log majorization, we are able to characterize that the equality cases of said equalities occur if and only if the matrices commute, and hence are the same as in $\ell^p$.
This short but self-contained survey presents a number of elegant matrix/operator inequalities for general convex or concave functions, obtained with a unitary orbit technique. Jensen, sub or super-additivity type inequalities are considered. Some of them are substitutes to classical inequalities (Choi, Davis, Hansen-Pedersen) for operator convex or concave functions. Various trace, norm and determinantal inequalities are derived. Combined with an interesting decomposition for positive semi-definite matrices, several results for partitioned matrices are also obtained.
In this article, we employ a standard convex argument to obtain new and refined inequalities related to the matrix mean of two accretive matrices, the numerical radius and the Tsallis relative operator entropy.
Suppose p is a symmetric matrix whose entries are polynomials in freely noncommutating variables and p(0) is positive definite. Let D(p) denote the component of zero of the set of those g-tuples X of symmetric matrices (of the same size) such that p(X) is positive definite. By a previous result of the authors, if D(p) is convex and bounded, then D(p) can be described as the set of all solutions to a linear matrix inequality (LMI). This article extends that result from matrices of polynomials to matrices of rational functions in free variables. As a refinement of a theorem of Kaliuzhnyi-Verbove…
The H-unistochastic matrices are a special class of symmetric bistochastic matrices obtained by taking the square of the absolute value of each entry of a Hermitian unitary matrix. We examine the geometric relationship of the convex hull of the n by n H-unistochastic matrices relative to the larger convex set of n by n symmetric bistochastic matrices. We show that any line segment in the convex set of the n by n symmetric bistochastic matrices which passes through the centroid of this convex set must spend at least two-thirds of its length in the convex hull of the n by n H-unistochastic matri…
For positive semidefinite matrices $A$ and $B$, Ando and Zhan proved the inequalities $||| f(A)+f(B) ||| \ge ||| f(A+B) |||$ and $||| g(A)+g(B) ||| \le ||| g(A+B) |||$, for any unitarily invariant norm, and for any non-negative operator monotone $f$ on $[0,\infty)$ with inverse function $g$. These inequalities have very recently been generalised to non-negative concave functions $f$ and non-negative convex functions $g$, by Bourin and Uchiyama, and Kosem, respectively. In this paper we consider the related question whether the inequalities $||| f(A)-f(B) ||| \le ||| f(|A-B|) |||$, and $||| g(A…
We characterize real functions $f$ on an interval $(-α,α)$ for which the entrywise matrix function $[a_{ij}] \mapsto [f(a_{ij})]$ is positive, monotone and convex, respectively, in the positive semidefiniteness order. Fractional power functions are exemplified and related weak majorizations are shown.
Sub-additive and super-additive inequalities for concave and convex functions have been generalized to the case of matrices by several authors over a period of time. These lead to some interesting inequalities for matrices, which in some cases coincide with, and in other cases are at variance with the corresponding inequalities for real numbers. We survey some of these matrix inequalities and do further investigations into these. We introduce the novel notion of dominated majorization between the spectra of two Hermitian matrices $B$ and $C$, dominated by a third Hermitian matrix $A$. Based on…
Faber polynomials of matrices for non-convex sets
研究非凸集的Faber多项式，扩展了线性算子范数界结果，用于Krylov子空间方法的误差界推导。
The variance conjecture in Asymptotic Convex Geometry stipulates that the Euclidean norm of a random vector uniformly distributed in a (properly normalised) high-dimensional convex body $K\subset {\mathbb R}^n$ satisfies a Poincaré-type inequality, implying that its variance is much smaller than its expectation. We settle the conjecture for the cases when $K$ is the unit ball of the operator norm in classical subspaces of square matrices, which include the subspaces of self-adjoint matrices. Through the estimates we establish, we are also able to show that the unit ball of the operator norm in…
We study upper bounds on the Schur multiplier norm of Loewner matrices for concave and convex functions. These bounds then immediately lead to upper bounds on the ratio of Schatten $q$-norms of commutators $||\;[A,f(B)]\;||_q/||\;[A,B]\;||_q$. We also consider operator monotone functions, for which sharper bounds are obtained.
We prove majorization inequalities for different means of positive definite matrices. These include the Cartan mean (the Karcher mean), the log Euclidean mean, the Wasserstein mean and the power mean.
We give a proof of Cartlidge's result on the $l^{p}$ operator norms of weighted mean matrices for $p=2$ on interpreting the norms as eigenvalues of certain matrices.
We show that any $n\times m$ matrix $A$ can be approximated in operator norm by a submatrix with a number of columns of order the stable rank of $A$. This improves on existing results by removing an extra logarithmic factor in the size of the extracted matrix. Our proof uses the recent solution of the Kadison-Singer problem. We also develop a sort of tensorization technique to deal with constraint approximation problems. As an application, we provide a sparsification result with equal weights and an optimal approximate John's decomposition for non-symmetric convex bodies. This enables us to sh…
We study $l^{p}$ operator norms of weighted mean matrices using the approaches of Kaluza-Szegö and Redheffer. As an application, we prove a conjecture of Bennett.
We present some results concerning the $l^p$ norms of weighted mean matrices. These results can be regarded as analogues to a result of Bennett concerning weighted Carleman's inequalities.
We give another proof of a result of Bennett on the $l^{p}$ operator norms of some weighted mean matrices for the case $p=2$ and we also present some related results.
Convex functions have played a major role in the field of Mathematical inequalities. In this paper, we introduce a new concept related to convexity, which proves better estimates when the function is somehow more convex than another. In particular, we define what we called $g-$convexity as a generalization of $\log-$convexity. Then we prove that $g-$convex functions have better estimates in certain known inequalities like the Hermite-Hadard inequality, super additivity of convex functions, the Majorization inequality and some means inequalities. Strongly related to this, we define the index of…
The concept of Loewner (partial) order for general complex matrices is introduced. After giving the definition of arithmetic, geometric, and harmonic mean for accretive-dissipative matrices, we study their basic properties. An AM-GM-HM inequality is established for two accretive-dissipative matrices in the sense of this extended Loewner order. We also compare the harmonic mean and parallel sum of two accretive-dissipative matrices, revealing an interesting relation between them. A number of examples are included.
Some rearrangement inequalities for symmetric norms on matrices are given as well as related results for operator convex functions.
Eigenvalues inequalities involving (log) convex/concav functions and Hermitian matrices, positive unital maps are considered. Simple proofs of Bhatia-Kittaneh inequality and Naimark dilation theorem are given.
In 1957, Chandler Davis proved that unitarily invariant convex functions on the space of hermitian matrices are precisely those which are convex and symmetrically invariant on the set of diagonal matrices. We give a simple perturbation theoretic proof of this result. (Davis' argument was also very short, though based on completely different ideas).
Convexity plays a prominent role in a number of problems, but practical considerations frequently give rise to non-convex functions. We suggest a method for determining convex regions, and also for assessing the lack of convexity in the other regions. The method relies on a specially constructed decomposition of symmetric matrices, such as the Hessian. We illustrate theoretical results using several examples, one of which analyses a problem arising in risk measurement and management in insurance and finance.
To better understand the algebra $\mathcal{M}_n$ of all $n\times n$ complex matrices, we explore the class of accretive matrices. This class has received renowned attention in recent years due to its role in complementing those results known for positive definite matrices. More precisely, we have several results that allow a better understanding of accretive matrices. Among many results, we present order-preserving results, Choi-Davis-type inequalities, mean-convex inequalities, sub-multiplicative results for the real part, and new bounds of the absolute value of accretive matrices. These resu…
An Operator Theoretic Approach to Birkhoff's Problem 111
本文运用算子理论的多种拓扑，证明伯克霍夫第111问题在这些拓扑下均无解，同时验证肯德尔第二定理适用于更精细的局部凸豪斯多夫拓扑，给出该闭包性质的拓扑上限，并探讨了置换矩阵闭凸包的暴露点与闭仿射包的构成。
We give a characterization for the extreme points of the convex set of correlation matrices with a countable index set. A Hermitian matrix is called a correlation matrix if it is positive semidefinite with unit diagonal entries. Using the characterization we show that there exist extreme points of any rank.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。