Related papers: Jensen's Inequality for g-Convex Function under g-…

We consider nonconvex real valued functions whose truncations are either quasiconvex or even convex starting with a certain level. Among them, the $C^2$-smooth functions whose level sets are all completely contained in the positive definite…

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.

Let $f$ be a function on a bounded domain $\Omega \subseteq \mathbb{R}^n$ and $\delta$ be a positive function on $\Omega$ such that $B(x,\delta(x))\subseteq \Omega$. Let $\sigma(f)(x)$ be the average of $f$ over the ball $B(x,\delta(x))$.…

In this paper, the Authors establish a new identity for differentiable functions. By the well-known H\"older and power mean inequality, they obtain some integral inequalities related to the convex functions and apply these inequalities to…

We have recently established some integral inequalities for convex functions via the Hermite-Hadamard's inequalities. In continuation here, we also establish some interesting new integral inequalities for convex functions via the…

The condition number of a smooth convex function, namely the ratio of its smoothness to strong convexity constants, is closely tied to fundamental properties of the function. In particular, the condition number of a quadratic convex…

Subdifferentials (in the sense of convex analysis) of matrix-valued functions defined on $\mathbb{R}^d$ that are convex with respect to the L\"{o}wner partial order can have a complicated structure and might be very difficult to compute…

Let $(M^{2},g_{0})$ be a compact manifold with boundary, and let $g$ and $g_{0}$ be conformally related by $g=e^{2f}g_{0}$. We show that the inequality $$\nu_{1}(g)\geq\Big(\max_{x\in\partial M}e^{-f(x)}\Big)\nu_{1}(g_{0})$$ stated in…

We provide a sufficient condition for an invertible (locally strongly) convex vector-valued function on $\mathbb{R}^N$ to have a (locally strongly) convex inverse. We show under suitable conditions that if the gradient of each component of…

In this paper we established new integral inequalities which are more general results for coordinated convex functions on the coordinates by using some classical inequalities.

We give a necessary and sufficient condition for a difference of convex (DC, for short) functions, defined on a locally convex space, to be Lipschitz continuous. Our criterion relies on the intersections of the "epsilon-subdifferentials of…

We show that $C^0$-fine approximation of convex functions by smooth (or real analytic) convex functions on $\R^d$ is possible in general if and only if $d=1$. Nevertheless, for $d\geq 2$ we give a characterization of the class of convex…

A normalized analytic function f is shown to be univalent in the open unit disk D if its second coefficient is sufficiently small and relates to its Schwarzian derivative through a certain inequality. New criteria for analytic functions to…

In this study, we define g-convex dominated functions on the co-ordinates and prove some Hadamard-type, Fejer-type inequalities for this new class of functions. We also give some results related to the functional H.

The Hermite-Hadamard inequality states that the average value of a convex function on an interval is bounded from above by the average value of the function at the endpoints of the interval. We provide a generalization to higher dimensions:…

The Kantorovich function $(x^TAx)(x^T A^{-1} x)$, where $A$ is a positive definite matrix, is not convex in general. From matrix/convex analysis point of view, it is interesting to address the question: When is this function convex? In this…

This paper deals with the regularization of the sum of functions defined on a locally convex spaces through their closed-convex hulls in the bidual space. Different conditions guaranteeing that the closed-convex hull of the sum is the sum…

In the article the necessary and sufficient conditions for a representation of Lipschitz function of two variables as a difference of two convex functions are formulated. An algorithm of this representation is given. The outcome of this…

For a function defined on a convex set in a Euclidean space, midpoint convexity is the property requiring that the value of the function at the midpoint of any line segment is not greater than the average of its values at the endpoints of…

The main theorem of this paper states that the c-convexity and the alternative c-convexity are equivalent if and only if the cost function c satisfies MTW condition. The alternative c-convex function is an analogy of the definition of the…