Related papers: Some Operator Inequalities via Convexity
Some new trace inequalities for operators in Hilbert spaces are provided. The superadditivity and monotonicity of some associated functionals are investigated and applications for power series of such operators are given. Some trace…
We establish a new pointwise estimate for a class of rough operators in the setting of metric measure spaces endowed with a measure which is Ahlfors regular. This pointwise inequality can be divided in two steps: the first one relies in a…
Motivated by some recently established operator Jensen-type inequalities related to a usual convexity, in the present paper we derive several more accurate operator Jensen-type inequalities for certain subclasses of convex functions. More…
In this paper we prove a series of Rogers-Shephard type inequalities for convex bodies when dealing with measures on the Euclidean space with either radially decreasing densities, or quasi-concave densities attaining their maximum at the…
In this paper, we establish several new inequalities for some twice differantiable mappings that are connected with the celebrated Hermite-Hadamard integral inequality. Some applications for special means of real numbers are also provided.
In this article we give some improvements and generalizations of the famous Jensen's and Jensen-Mercer inequalities for twice differentiable functions, where convexity property of the target function is not assumed in advance. They…
We systematically study how properties of abstract operator systems help classifying linear matrix inequality definitions of sets. Our main focus is on polyhedral cones, the 3-dimensional Lorentz cone, where we can completely describe all…
In this paper we point out a converse result of the celebrated Jensen inequality for differentiable convex mappings of several variables and apply it to counterpart well-known analytic inequalities. Applications to Shannon's and Renyi's…
Operator convex functions defined on the positive half-line play a prominent role in the theory of quantum information, where they are used to define quantum $f$-divergences. Such functions admit integral representations in terms of…
This article proposes a new two-parameter generalized entropy, which can be reduced to the Tsallis and the Shannon entropy for specific values of its parameters. We develop a number of information-theoretic properties of this generalized…
In this work, we develop a new complexity metric for an important class of low-rank matrix optimization problems in both symmetric and asymmetric cases, where the metric aims to quantify the complexity of the nonconvex optimization…
We continue the analysis in [3] of matrix convex functions of a fixed order defined in a real interval by differential methods as opposed to the characterization in terms of divided differences given by Kraus [5]. We amend and improve some…
In this paper we develop a general method for improving Jensen-type inequalities for convex and, even more generally, for piecewise convex functions. Our main result relies on the linear interpolation of a convex function. As a consequence,…
We revisit the Rellich inequality from the viewpoint of isolating the contributions from radial and spherical derivatives. This naturally leads to a comparison of the norms of the radial Laplacian and Laplace{Beltrami operators with the…
A class of algorithms comprised by certain semismooth Newton and active-set methods is able to solve convex minimization problems involving sparsity-inducing regularizers very rapidly; the speed advantage of methods from this class is a…
This article is a continuation of my paper [arxiv: 1409.1015v2]. R\'enyi and Tsallis entropies are associated to positive linear operators and properties of some functions related to these entropies are investigated.
In a recent work of the authors, we showed some general inequalities governing numerical radius inequalities using convex functions. In this article, we present results that complement the aforementioned inequalities. In particular, the new…
In this note we explore duality in reverse convex optimization with reverse convex inequality constraints. While we are examining the special case of a finite index set of the inequality constraints, we are primarily interested in the…
We describe several algorithms for matrix completion and matrix approximation when only some of its entries are known. The approximation constraint can be any whose approximated solution is known for the full matrix. For low rank…
Several inequalities for eigenvalues involving convex combinations and compressions are given. These inequalities are matrix version of the basic convexity inequality f((a+b)/2) < (f(a)+f(b))/2.