Related papers: On Carlier's inequality
We have made some new definitions using the inequalities of Young' and Nesbitt'. And we have given some features of these new definitions. After, we established new Hadamard type inequalities for convex functions in the Young and Nesbitt…
Given a smooth positive function $f$ defined on the unit circle satisfying a simple condition, we obtain a Poincar\'{e}-type inequality for an arbitrary function $u$ whose weighted average with respect to $f$ is zero. The proof uses…
An antinorm is a concave nonnegative homogeneous functional on a convex cone. It is shown that if the cone is polyhedral, then every antinorm has a unique continuous extension from the interior of the cone. The main facts of the duality…
The Alexandrov-Fenchel inequality, a far-reaching generalization of the classical isoperimetric inequality to arbitrary mixed volumes, lies at the heart of convex geometry. The characterization of its extremal bodies is a long-standing open…
We give an example of a pair of nonnegative subharmonic functions with disjoint support for which the Alt-Caffarelli-Friedman monotonicity formula has strictly positive limit at the origin, and yet the interface between their supports lacks…
Maximal inequalities refer to bounds on expected values of the supremum of averages of random variables over a collection. They play a crucial role in the study of non-parametric and high-dimensional estimators, and especially in the study…
The Bell inequalities in three and four correlations are re-derived in general forms showing that three and four data sets, respectively, identically satisfy them regardless of whether they are random, deterministic, measured, predicted, or…
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,…
In this paper, we study constraint qualifications for the nonconvex inequality defined by a proper lower semicontinuous function. These constraint qualifications involve the generalized construction of normal cones and subdifferentials.…
In this paper our aim is to deduce some complete monotonicity properties and functional inequalities for the Bickley function. The key tools in our proofs are the classical integral inequalities, like Chebyshev, H\"older-Rogers,…
The aim of this paper is to implement some new techniques, based on conjugate duality in convex optimization, for proving the existence of global error bounds for convex inequality systems. We deal first of all with systems described via…
We derive a number of sharp upper bounds for the deficit in the Alexandrov-Fenchel inequality using a weighted Minkowski integral formula and an integral formula for the deficit in Jensen's inequality. Our estimates yield results under…
Given an operator convex function $f(x)$, we obtain an operator-valued lower bound for $cf(x) + (1-c)f(y) - f(cx + (1-c)y)$, $c \in [0,1]$. The lower bound is expressed in terms of the matrix Bregman divergence. A similar inequality is…
In this paper, we introduce and study the Fourier transform of functions which are integrable with respect to a vector measure on a compact group (not necessarily abelian). We also study the Fourier transform of vector measures. We also…
In this note we generalize several well known results concerning invariants of finite groups from characteristic zero to positive characteristic not dividing the group order. The first is Schmid's relative version of Noether's theorem. That…
The Polyak-{\L}ojasiewicz (P{\L}) inequality extends the favorable optimization properties of strongly convex functions to a broader class of functions. In this paper, we prove a theorem (also obtained by Criscitiello, Rebjock and Boumal in…
An inequality is derived for the correlation of two univariate functions operating on symmetric bivariate normal random variables. The inequality is a simple consequence of the Cauchy-Schwarz inequality.
We develop a new framework for the Jensen-type inequalities that allows us to deal with functions not necessarily convex and Borel measures not necessarily positive.
Optimization of DR-submodular functions has experienced a notable surge in significance in recent times, marking a pivotal development within the domain of non-convex optimization. Motivated by real-world scenarios, some recent works have…
On a convex set, we prove that the Poincar\'e-Sobolev constant for functions vanishing at the boundary can be bounded from above by the ratio between the perimeter and a suitable power of the $N-$dimensional measure. This generalizes an old…