Related papers: Means refinements via convexity
For a real-valued non-negative and log-concave function we introduce a notion of difference function; the difference function represents a functional analog on the difference body of a convex body. We prove a sharp inequality which bounds…
Jensen's inequality is ubiquitous in measure and probability theory, statistics, machine learning, information theory and many other areas of mathematics and data science. It states that, for any convex function $f\colon K \to \mathbb{R}$…
We revisit the classical dual ascent algorithm for minimization of convex functionals in the presence of linear constraints, and give convergence results which apply even for non-convex functionals. We describe limit points in terms of the…
The current status concerning Hardy-type inequalities with sharp constants is presented and described in a unified convexity way. In particular, it is then natural to replace the Lebesgue measure $dx$ with the Haar measure $dx/x.$ There are…
A generalization of Mercer inequality for h-convex function is presented. As application, a weighted generalization of triangle inequality is given.
We propose a general method for optimization with semi-infinite constraints that involve a linear combination of functions, focusing on the case of the exponential function. Each function is lower and upper bounded on sub-intervals by…
In this note, first we refine Mandl's inequality. Then, we consider the product $p_1p_2... p_n$ and we refine some known lower bounds for it, and we find some upper bounds for it by using Mandl's inequality and its refinement and the…
Demixing is the problem of identifying multiple structured signals from a superimposed, undersampled, and noisy observation. This work analyzes a general framework, based on convex optimization, for solving demixing problems. When the…
Motivated by the work of Anderson, Vamanamurthy and Vuorinen \cite{avv}, in this paper authors study the log-convexity and log-concavity of Power mean, Identric mean, weighted Power mean, Lehmer mean, Modified Alzer mean, and establish the…
We present a framework to obtain valid inequalities for a reverse convex set: the set of points in a polyhedron that lie outside a given open convex set. Reverse convex sets arise in many models, including bilevel optimization and…
In this paper, two new classes of convex functions as a generalization of convexity which is called (h-s)_{1,2}-convex functions are given. We also prove some Hadamard-type inequalities and applications to the special means are given.
We obtain operator concavity (convexity) of some functions of two or three variables by using perspectives of regular operator mappings of one or several variables. As an application, we obtain, for $ 0<p < 1,$ concavity, respectively…
In this paper we prove some exponential inequalities involving the sinc function. We analyze and prove inequalities with constant exponents as well as inequalities with certain polynomial exponents. Also, we establish intervals in which…
By considering a fixed point in unit disk $\Delta$, a new class of univalent convex functions is defined. Coefficient inequalities, integral operator and extreme points of this class are obtained.
Convexity prior is one of the main cue for human vision and shape completion with important applications in image processing, computer vision. This paper focuses on characterization methods for convex objects and applications in image…
We establish a general criterion for the validity of inequalities of the following form: A certain convex combination of the values of a convex function at n points and of its value at a weighted mean of these n points is always greater or…
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 the paper, we introduce the generalized convex function on fractal sets of real line numbers and study the properties of the generalized convex function. Based on these properties, we establish the generalized Jensen inequality and…
The main result states that every convex set-valued function defined on a real interval with compact values in a locally convex space, admits an affine selection. In the case if the target space is a real line and the values are closed real…
We give an upper bound for the weighted geometric mean using the weighted arithmetic mean and the weighted harmonic mean. We also give a lower bound for the weighted geometric mean. These inequalities are proven for two invertible positive…