Related papers: Norm inequalities involving geometric means

In $1977$, G. Bennett proved, by means of non-deterministic methods, an inequality which plays a fundamental role in a series of optimization problems. More precisely, Bennett's inequality shows that, for $p_{1},p_{2} \in\lbrack1,\infty]$…

For an array $\left\{X_{n,j}, \, 1 \leqslant j \leqslant k_{n}, n \geqslant 1 \right\}$ of random variables and a sequence $\{c_{n} \}$ of positive numbers, sufficient conditions are given under which, for all $\varepsilon > 0$,…

The Hardy-Littlewood inequalities for $m$-linear forms on $\ell_{p}$ spaces are stated for $p>m$. In this paper, among other results, we investigate similar results for $1\leq p\leq m.$ Let $\mathbb{K}$ be $% \mathbb{R}$ or $\mathbb{C}$ and…

In this paper we consider the problem of bounding the Betti numbers, $b_i(S)$, of a semi-algebraic set $S \subset \R^k$ defined by polynomial inequalities $P_1 \geq 0,...,P_s \geq 0$, where $P_i \in \R[X_1,...,X_k]$ and $\deg(P_i) \leq 2$,…

Several matrix/operator inequalies are given. Most of them are unexpected extensions of the Araki Log-majorization theorem, obtained thanks to a new log-majorization for positive linear maps and normal operators (Theorem 2.9). The main idea…

In this paper, we prove that the inequalities $\alpha [1/3 Q(a,b)+2/3 A(a,b)]+(1-\alpha)Q^{1/3}(a,b)A^{2/3}(a,b)<M(a,b) <\beta [1/3 Q(a,b)+2/3 A(a,b)]+(1-\beta)Q^{1/3}(a,b)A^{2/3}(a,b)$ and $\lambda [1/6 C(a,b)+5/6…

In this note, we show that for each minimal norm $N(\cdot)$ on the algebra $M_n$ of all $n \times n$ complex matrices, there exist norms $\|\cdot\|_1$ and $\|\cdot\|_2$ on ${\mathbb C}^n$ such that $$N(A)=\max\{\|Ax\|_2: \|x\|_1=1, x\in…

We present inequalities related to generalized matrix function for positive semidefinite block matrices. We introduce partial generalized matrix functions corresponding to partial traces, and then provide a unified extension of the recent…

Given a definite nonnegative matrix $A \in M_n (C)$, we study the minimal index of A: $I(A) = \max \{\lambda \ge 0 : A\circ B \ge \lambda B$ for all $0\le B\}$, where $A\circ B$ denotes the Hadamard product $(A\circ B)_{ij} = A_{ij}…

We show that any Algebraic Branching Program (ABP) computing the polynomial $\sum_{i = 1}^n x_i^n$ has at least $\Omega(n^2)$ vertices. This improves upon the lower bound of $\Omega(n\log n)$, which follows from the classical result of Baur…

Block coordinate methods have been extensively studied for minimization problems, where they come with significant complexity improvements whenever the considered problems are compatible with block decomposition and, moreover, block…

We develop upper and lower bounds for the numerical radius of $2\times 2$ off-diagonal operator matrices, which generalize and improve on the existing ones. We also show that if $A$ is a bounded linear operator on a complex Hilbert space…

Given two sets of positive integers $A$ and $B$, let $AB := \{ab : a \in A,\, b \in B\}$ be their product set and put $A^k := A \cdots A$ ($k$ times $A$) for any positive integer $k$. Moreover, for every positive integer $n$ and every…

Let $G$ be a multiplicative subsemigroup of the general linear group $\Gl(\mathbb{R}^d)$ which consists of matrices with positive entries such that every column and every row contains a strictly positive element. Given a $G$--valued random…

In this paper we consider error sums of the form \[\sum_{m=0}^{\infty} \varepsilon_m\Big( \,b_m\alpha - \frac{a_m}{c_m}\,\Big) \,,\] where $\alpha$ is a real number, $a_m$, $b_m$, $c_m$ are integers, and $\varepsilon_m=1$ or $\varepsilon_m…

In this paper we develop a randomized block-coordinate descent method for minimizing the sum of a smooth and a simple nonsmooth block-separable convex function and prove that it obtains an $\epsilon$-accurate solution with probability at…

The classical inequality of Bohr asserts that if a power series converges in the unit disk and its sum has modulus less than or equal to $1$, then the sum of absolute values of its terms is less than or equal to $1$ for the subdisk…

This note presents a new proof of an important result due to Bourgain and Tzafriri that provides a partial solution to the Kadison--Singer problem. The result shows that every unit-norm matrix whose entries are relatively small in…

Given an operator system $\mathcal{S}$, we define the parameters $r_k(\mathcal{S})$ (resp. $d_k(\mathcal{S})$) defined as the maximal value of the completely bounded norm of a unital $k$-positive map from an arbitrary operator system into…

The supporting vectors of a matrix A are the solutions of max || x ||_2 =1 {||Ax||_2^2}. The generalized supporting vectors of matrices A_1 , . . . , A_k are the solutions of max || x ||_2 =1 {||A_1x||_2^2 + ||A_2x||_2^2 + ... +…