Abstract
In this chapter, we introduce some new notions of generalized convex functionals in normed linear spaces. It unifies and generalizes the many known and new classes of convex functions. The corresponding Schur, Jensen, and Hermite-Hadamard type inequalities are also established.
Access provided by Autonomous University of Puebla. Download chapter PDF
Similar content being viewed by others
Mathematics Subject Classification
1 Introduction
Definition 1
A function \(f:[a,b]\rightarrow \mathbb {R}\) is called convex if
∀x 1, x 2 ∈ [a, b], ∀λ ∈ [0, 1].
This classical inequality (1) plays an important role in analysis, optimization and in the theory of inequalities, and it has a huge literature dealing with its applications, various generalizations and refinements. Further, convexity is one of the most fundamental and important notions in mathematics. Convexity theory and its inequalities are fields of interest of numerous mathematicians and there are many paper, books, and monographs devoted to these fields and various applications (see, e.g., [1, 4, 6,7,8,9,10,11,12,13,14, 16, 18,19,20,21,22] and the references therein).
In this chapter, we introduce some new notions of generalized convex functionals in normed linear spaces in Section 2. It unifies and generalizes the many known and new classes of convex functions. Some new basic inequalities are presented in Section 3. New generalized Hermite-Hadamard type inequalities are presented in Section 4. In Sections 5 and 6, strongly convex functional and the corresponding inequalities in normed linear spaces are also given.
2 Generalized Convex Functionals in Normed Linear Spaces
In what follows, (X, ∥⋅∥) denotes the real normed linear spaces, D be a convex subset of X, h : (0, 1) → (0, ∞) is a given function, whose h is not identical to 0.
In this section, we introduce and study a new class of generalized convex functionals, that is, (α, β, λ, λ 0, t, ξ, h) convex functionals.
Definition 2
A functional f : D → (0, ∞) is called (α, β, λ, λ 0, t, ξ, h) convex if
∀x 1, x 2 ∈ D, ∀λ, λ 0, t, ξ ∈ [0, 1], α, β are real numbers, and α, β ≠ 0.
If λ 0 = 1 in (2), that is,
we say that f is a (α, β, λ, t, ξ, h) convex functional.
If ξ = 1 in (3), that is,
we say that f is a (α, β, λ, t, h) convex functional.
For t = λ in (2), that is,
we say that f is a (α, β, λ, λ 0, ξ, h) convex functional.
If ξ = 1 in (4), that is,
we say that f is a (α, β, λ, λ 0, h) convex functional.
For λ 0 = 1 in (5), that is,
we say that f is a (α, β, λ, h) convex functional.
In particular, if h(λ) = λ s, 0 < |s|≤ 1 in (6), that is,
we say that f is a (α, β, λ, s) convex functional. If s = 1, then (7) reduces to (α, β, λ) convex functional.
For α = β = 1 in (2), that is,
we say that f is a (λ, λ 0, t, ξ, h) convex functional.
If λ 0 = 1 in (8), that is,
we say that f is a (λ, t, ξ, h) convex functional.
In particular, if t = λ in (8), that is,
we say that f is a (λ, λ 0, ξ, h) convex functional.
If ξ = 1 in (10), that is,
we say that f is a (λ, λ 0, h) convex functional.
If λ 0 = 1 in (11), that is,
we say that f is an h-convex functional.
In the following Examples 1–6, we make appointment that
Then (2) reduces to
∀x 1, x 2 ∈ D, ∀λ, λ 0, t, ξ ∈ [0, 1], α, β are real numbers, and α, β ≠ 0.
If ξ = 1 in (13), that is,
∀x 1, x 2 ∈ D, ∀λ, t ∈ [0, 1], we say that f is a (α, β, λ, λ 0, t, h) convex function.
If t = λ in (14), that is,
∀x 1, x 2 ∈ D, ∀λ ∈ [0, 1], we say that f is a (α, β, λ, λ 0, h) convex function.
If λ 0 = 1 in (14), that is,
∀x 1, x 2 ∈ D, ∀λ, t ∈ [0, 1], we say that f is a (α, β, λ, t, h) convex function. If t = λ in (16), that is,
∀x 1, x 2 ∈ D, ∀λ ∈ [0, 1], we say that f is a (α, β, λ, h) convex function.
If h(λ) = λ s, 0 < |s|≤ 1 in (16), (17), that is,
we say that f is a (α, β, λ, t, s), (α, β, λ, s) convex function, respectively.
In particular, if s = 1, then (18), (19) reduce to (α, β, λ, t), (α, β, λ) convex function, respectively.
Example 1
If α = β = 1 in (13), then
∀x 1, x 2 ∈ D, ∀λ, λ 0, t, ξ ∈ [0, 1], we say that f is a (λ, λ 0, t, ξ, h) convex function.
In particular, if λ 0 = 1 in (20), that is,
∀x 1, x 2 ∈ D, ∀λ, t, ξ ∈ [0, 1], we say that f is a (λ, t, ξ, h) convex function.
For h(t) = t s, 0 < |s|≤ 1, ξ = 1 in (21), that is,
∀x 1, x 2 ∈ D, ∀λ, t ∈ [0, 1], we say that f is a (λ, t, s) convex function.
In particular, when s = 1 in (22), that is,
∀x 1, x 2 ∈ D, ∀λ, t ∈ [0, 1], we say that f is a (λ, t) convex function (see, e.g., [8]).
For t = λ in (20), that is,
∀x 1, x 2 ∈ D, ∀λ, λ 0, ξ ∈ [0, 1], we say that f is a (λ, λ 0, ξ, h) convex function.
If ξ = 1 in (24), that is,
∀x 1, x 2 ∈ D, ∀λ ∈ [0, 1], we say that f is a (λ, λ 0, h) convex function. In particular, when λ 0 = 1,(25) reduces to h-convex function (see [4, 19]), that is,
If h(λ) = λ, then (26) reduces to (1).
If h(λ) = λ s, 0 < s ≤ 1 in (26), that is,
∀x 1, x 2 ∈ D, ∀λ ∈ [0, 1], we say that f is a s-Breckner convex function (see, e.g., [4, 5, 8]).
If h(λ) = λ −s, 0 < s ≤ 1 in (26), that is,
∀x 1, x 2 ∈ D, ∀λ ∈ [0, 1], we say that f is a s-Godunova-Levin function (see [4]). In particular, when s = 1, (28) reduces to Godunova-Levin function (see, e.g., [5, 8])
If h(λ) = 1 in (26), that is,
∀x 1, x 2 ∈ D, ∀λ ∈ [0, 1], we say that f is a P-function (see, e.g., [5]).
If h(λ) = λ s, 0 < |s|≤ 1, in (24), that is,
∀x 1.x 2 ∈ D, ∀λ, λ 0, ξ ∈ [0, 1], we say that f is a (λ, λ 0, ξ, s) convex function. In particular, if ξ = s = 1 in (30), that is,
we say that f is a λ 0-convex function (that is, m-convex function in [2]).
If λ 0 = 0 in (20), then
When t = λ, ξ = 1, h(t) = t in (32), that is,
we say that f is a starshaped function (see [2])
Example 2
If β = 1 in (13), then
∀x 1, x 2 ∈ D, ∀λ, λ 0, t, ξ ∈ [0, 1], α ≠ 0, we say that f is a (α, λ, λ 0, t, ξ, h) convex function.
For t = λ in (34), that is,
∀x 1, x 2 ∈ D, ∀λ, λ 0, t, ξ ∈ [0, 1], α ≠ 0, we say that f is a (α, λ, λ 0, ξ, h) convex function. When λ 0 = 1, ξ = 1, (35) reduces to (α, h) convex function (that is, (p, h) convex function in [5]). In particular, if λ 0 = 1, ξ = 1, h(t) = t, (35) reduces to α-convex function (that is, p-convex function in [5, 22] )
Example 3
If α = 1, β = q in (13), then
∀x 1, x 2 ∈ D, ∀λ, λ 0, t, ξ ∈ [0, 1], q ≠ 0, we say that f is a (q, λ, λ 0, t, ξ, h) convex function.
For t = λ in (36), that is,
∀x 1, x 2 ∈ D, ∀λ, λ 0, t, ξ ∈ [0, 1], q ≠ 0, we say that f is a (q, λ, λ 0, ξ, h) convex function. When λ 0 = 1, ξ = 1, h(t) = t, (37) reduces to q-convex function (see, e.g., [8]).
Example 4
If α = 1, β = −1 in (13), then
∀x 1, x 2 ∈ D, ∀λ, λ 0, t, ξ ∈ [0, 1], we say that f is a (AH, λ, λ 0, t, ξ, h) convex function, where AH means the arithmetic-harmonic means.
For t = λ in (38), that is,
∀x 1, x 2 ∈ D, ∀λ, λ 0, ξ ∈ [0, 1], we say that f is a (AH, λ, λ 0, ξ, h) convex function.
For h(λ) = λ s, 0 < |s|≤ 1, λ 0 = ξ = 1 in (39), that is,
∀x 1, x 2 ∈ D, ∀λ ∈ [0, 1], we say f is a (AH, λ, s) convex function. In particular, if s = 1, then (40) reduces to AH convex function.
Example 5
If α = −1, λ 0 = 1, h(λ) = λ in (15), then
∀x 1, x 2 ∈ D, ∀λ ∈ [0, 1], β ≠ 0, we say that f is a harmonically β-convex functions, see [15].
Example 6
If α = −1, β = 1 in (13), then
∀x 1, x 2 ∈ D, ∀λ, λ 0, t, ξ ∈ [0, 1], we say that f is a (HA, λ, λ 0, t, ξ, h) convex function.
For t = λ in (41), that is,
∀x 1, x 2 ∈ D, ∀λ, λ 0, ξ ∈ [0, 1], we say that f is a (HA, λ, λ 0, ξ, h) convex function.
For h(λ) = λ s, 0 < |s|≤ 1, λ 0 = ξ = 1 in (42), that is,
∀x 1, x 2 ∈ D, ∀λ ∈ [0, 1], we say f is a (HA, λ, s) convex function. In particular, if s = 1, then (43) reduces to HA convex function.
Example 7
If α = β = −2 in (13), then
∀x 1, x 2 ∈ D, ∀λ, λ 0, t, ξ ∈ [0, 1], we say that f is a (HS, λ, λ 0, t, ξ, h) convex function.
For t = λ in (44), that is,
∀x 1, x 2 ∈ D, ∀λ, λ 0, ξ ∈ [0, 1], we say that f is a (HS, λ, λ 0, ξ, h) convex function.
For h(λ) = λ s, 0 < |s|≤ 1, λ 0 = ξ = 1 in (45), that is,
∀x 1, x 2 ∈ D, ∀λ ∈ [0, 1], we say that f is a (HS, λ, s) convex function, that is, f is the harmonic square s-convex function. In particular, if s = 1, then (46) reduces to HS convex function.
Example 8
Let X be a real normed linear space, and D be a convex subset of X, h : (0, 1) → (0, ∞) is a given function. If
then
and by (25), we get
∀x 1, x 2 ∈ D, ∀λ, λ 0 ∈ [0, 1], we say that f is a (λ, λ 0) convex function. When λ 0 = 1,(47) reduces to λ-convex function (see, e.g., [3, 4]).
Hence, Definition 2 unifies and generalizes the many known and new classes of convex functions.
3 Some New Basic Inequalities
The classical Schur, Jensen, and Hermite-Hadamard inequalities play an important role in analysis, optimization and in the theory of inequalities, and it has a huge literature dealing with its applications, various generalizations and refinements (see, e.g., [2, 6,7,8,9, 11, 12, 18,19,20,21,22], and the references therein). In this and next section, we present the corresponding inequalities for (α, β, λ, λ 0, t, ξ, h) convex functionals.
Definition 3 ([19])
A function h : (0, 1) → (0, ∞) is called a super-multiplicative function if
for all t, u ∈ (0, 1).
Lemma 1
Let g(∥x∥) = f β(∥x∥1∕α), x ∈ D, α, β are real numbers, and α, β ≠ 0. Then a functional f : D → (0, ∞) is (α, β, λ, λ 0, t, ξ, h) convex if and only if the functional g : D → (0, ∞) is (λ, λ 0, t, ξ, h) convex. In particular, a functional f : D → (0, ∞) is (α, β, λ, λ 0, ξ, h) convex if and only if the functional g : D → (0, ∞) is (λ, λ 0, ξ, h) convex, and a functional f : D → (0, ∞) is (α, β, λ, h) convex if and only if the functional g : D → (0, ∞) is h-convex.
Proof
Setting ∥u∥ = ∥x∥1∕α, x ∈ D. Assume that f is (α, β, λ, λ 0, t, ξ, h) convex, then for all x 1, x 2 ∈ D, we get
which proves that g is (λ, λ 0, t, ξ, h) convex.
Conversely, if g is (λ, λ 0, t, ξ, h) convex, then
which proves that f is (α, β, λ, λ 0, t, ξ, h) convex.
First of all, we establish Schur type inequalities of (α, β, λ, h) convex functionals.
Theorem 1
Let f : D → (0, ∞) be a h-convex functional and h : (0, 1) → (0, ∞) is a super-multiplicative function, then for all x 1, x 2, x 3 ∈ D, such that ∥x 1∥ < ∥x 2∥ < ∥x 3∥, and 0 < ∥x 3∥−∥x 1∥ < 1, the following generalized Schur inequality holds:
Proof
Setting
we have 0 < λ < 1,
and ∥x 2∥ = λ∥x 1∥ + (1 − λ)∥x 3∥. By (12), we get
By (48), we get
Hence,
Similarly, we get
Therefore, (49) follows from (50), (51), and (52). The proof is complete.
Using Lemma 1, we get
Corollary 1
Let f : D → (0, ∞) be a (α, β, λ, h) convex functional, and h : (0, 1) → (0, ∞) is a super-multiplicative function, then for all x 1, x 2, x 3 ∈ D, such that∥x 1∥α < ∥x 2∥α < ∥x 3∥α, and 0 < ∥x 3∥α −∥x 1∥α < 1, the following Schur-type inequalities holds:
Corollary 2
Let f : (0, ∞) → (0, ∞) be a (α, β, λ, h) convex function and h : (0, 1) → (0, ∞) is a super-multiplicative function, then for all x 1, x 2, x 3 ∈ (0, ∞), such that \(x_{1}^{\alpha }<x_{2}^{\alpha }<x_{3}^{\alpha }\), and \(0<x_{3}^{\alpha }-x_{1}^{\alpha }<1\), the following generalized Schur inequality holds:
Next by using the definition of (λ, t, ξ, h) convex functional and induction, one obtains the following new generalized Jensen inequality:
Theorem 2
Let f : D → (0, ∞) be a (λ, t, ξ, h) convex functional and h : (0, 1) → (0, ∞) is a super-multiplicative function, then
for any x k ∈ D, λ k, t k, ξ ∈ [0, 1], 1 ≤ k ≤ n, with \(\sum _{k=1}^{n}\lambda _{k}=1\) and \(\sum _{k=1}^{n}t_{k}^{\xi }=1\).
Proof
For n = 2, this is just the definition of (λ, t, ξ, h) convex functional, and for n > 2 it follows by induction. Assume that (55) is true for some positive integer n > 2, we shall prove that
for any x k ∈ D, λ k, t k, ξ ∈ [0, 1], 1 ≤ k ≤ n + 1, with \(\sum _{k=1}^{n+1}\lambda _{k}=1\) and \(\sum _{k=1}^{n+1}t_{k}^{\xi }\,{=}\,1\).
To show that (56) is true, we note that
By (48), we get
that is,
Similarly, we get
Using (9), (58), and (59), we have
Hence, (56) follows from (57) and (60). The proof is complete.
Corollary 3
Let f : D → (0, ∞) be a (α, β, λ, t, ξ, h) convex functional and h : (0, 1) → (0, ∞) is a super-multiplicative function, then
for any x k ∈ D, λ k, t k, ξ ∈ [0, 1], 1 ≤ k ≤ n, with \(\sum _{k=1}^{n}\lambda _{k}=1\) and \(\sum _{k=1}^{n}t_{k}^{\xi }=1\).
Corollary 4
Let f : (0, ∞) → (0, ∞) be a (α, β, λ, t, ξ, h) convex function and h : (0, 1) → (0, ∞) is a super-multiplicative function, then
for any x k ∈ (0, ∞), λ k, t k, ξ ∈ [0, 1], 1 ≤ k ≤ n, with \(\sum _{k=1}^{n}\lambda _{k}=1\) and \(\sum _{k=1}^{n}t_{k}^{\xi }=1\).
Corollary 5
Let f : (0, ∞) → (0, ∞) be a (α, β, λ, t, s) convex function, then
for any x k ∈ (0, ∞), λ k, t k, s ∈ [0, 1], 1 ≤ k ≤ n, with \(\sum _{k=1}^{n}\lambda _{k}=1\), and \(\sum _{k=1}^{n}t_{k}^{s}=1\).
Corollary 6
Let f : (0, ∞) → (0, ∞) be a (λ, t, s) convex function, then
for any x k ∈ (0, ∞), λ k, t k, s ∈ [0, 1], 1 ≤ k ≤ n, with \(\sum _{k=1}^{n}\lambda _{k}=1\), and \(\sum _{k=1}^{n}t_{k}^{s}=1\).
4 New Generalized Hermite-Hadamard Type Inequalities
In this section, we present a counterpart of the Hermite-Hadamard type inequality for (α, β, λ, λ 0, h) convex functional. In what follows, we write
In particular, E n(2) is an n-dimensional Euclidean space \(\mathbb {R}^{n}\).
Theorem 3
Let B(0, r 1) be an n-ball of radius r 1 in E n(p), E = B(0, r 2) − B(0, r 1), 0 < r 1 < r 2 < ∞. Let f : E → (0, ∞) be a (α, β, λ, λ 0, h) convex functional. If \(\int _{E}\|x\|{ }_{p}^{\alpha -n}f^{\beta }(\|x\|{ }_{p})dx<\infty \), and h ∈ L(0, 1), then
where Γ(α) is the Gamma function:
Proof
By transforming the integral to polar coordinates (see [9]), we have
Setting \(r=\big (\frac {r_{2}-u}{r_{2}-r_{1}}r_{1}^{\alpha /p} +\lambda _{0}\frac {u-r_{1}}{r_{2}-r_{1}}r_{2}^{\alpha /p}\big )^{p/\alpha }\), we have
By (5) in Definition 2, we get
Thus, by (62), (63), and (64), we obtain
which gives the right-hand inequality in (61).
To show the left-hand inequality in (61), setting \(u=\frac {1}{2}(r_{1}+r_{2})+t\), then
Setting
we get
Thus, by the definition of (α, β, λ, h) convex functional, we have
Hence, by (63), (65), and (66), we get
which finishes the proof.
Corollary 7
Let f : E n(p) → (0, ∞) be a (α, β, λ, λ 0, h) convex functional. If h ∈ L(0, 1) and \(\int _{B(0,r)}\|x\|{ }_{p}^{\alpha -n}f^{\beta }(\|x\|{ }_{p})dx<\infty \), then
Corollary 8
Let f : (0, ∞) → (0, ∞) be a (α, β, λ, λ 0, h) convex function. If h ∈ L(0, 1), and \(\int _{a}^{b}x^{\alpha -1}f^{\beta }(x)dx<\infty \), 0 < a < b < ∞, then
Corollary 9 ([4])
Let f : (0, ∞) → (0, ∞) be an h-convex function. If h ∈ L(0, 1), f ∈ L[a, b], [a, b] ⊂ (0, ∞), then
In particular, if h(t) = t s, 0 < s ≤ 1, then (70) reduces to (25) in [4]; if h(t) = t −s, 0 < s ≤ 1, then (70) reduces to (26) in [4].
Remark 1
If β = 1 and λ 0 = 1, then (69) reduces to Theorem 5 in [5]. For h(t) = t, λ 0 = 1 in (69), we get
For α = 1 in (71), we get
If β = 1, then (72) reduces to the classical Hermite-Hadamard inequality:
Remark 2
Inequality (72) is proved by Yang Zhen-hang, but he adds the conditions: β ≥ 1 and f(x), f ′′(x) > 0. (see [11, P. 12]).
Theorem 4
Let f : (0, ∞) → (0, ∞) be a (α, β, λ, h) convex function and h : (0, 1) → (0, ∞) is a super-multiplicative function, if [a, b] ⊂ (0, ∞) and \(a^{\alpha }=x_{1}^{\alpha }<x_{2}^{\alpha }<\cdots <x_{n}^{\alpha }=b^{\alpha }\) be equidistant points, then
where \(\lambda _{k}=\frac {k-1}{n-1}, k=1,2,\cdots ,n , n>1.\)
Proof
Since the points \(x_{1}^{\alpha },\cdots ,x_{n}^{\alpha }\) are equidistant, putting \(t=\frac {x_{n}^{\alpha }-x_{1}^{\alpha }}{n-1}\), we have \(x_{k}^{\alpha }=x_{1}^{\alpha }+(k-1)t, k=1,2,\cdots ,n\) and \(\frac {1}{n}\sum _{k=1}^{n}x_{k}^{\alpha }=\frac {1}{2}(x_{1}^{\alpha }+x_{n}^{\alpha })\). By Corollary 4, we get
which gives the left-hand inequality in (74).
To show the right-hand inequality in (74), we note that \(x_{k}^{\alpha }=x_{1}^{\alpha }+(k-1)t\) can be written as \(x_{k}^{\alpha }=(1-\lambda _{k})x_{1}^{\alpha }+\lambda _{k}x_{n}^{\alpha }\), where \(\lambda _{k}=\frac {k-1}{n-1},k=1,2,\cdots ,n\). By the definition of (α, β, λ, h) convex function, we get
Summing up the above inequalities, we get
which finishes the proof.
Corollary 10
Let f : (0, ∞) → (0, ∞) be an h-convex function and h : (0, 1) → (0, ∞) is a super-multiplicative function. If [a, b] ⊂ (0, ∞) and a = x 1 < x 2 < ⋯ < x n = b be equidistant points, then
where \(\lambda _{k}=\frac {k-1}{n-1},k=1,2,\cdots ,n , n>1\).
Remark 3
Using Lemma 1, we also obtain Theorem 4 from Corollary 10. For h(t) = t s, 0 < |s|≤ 1 in (74), we get
In particular, when s = 1, we get
If α = β = 1, then (76) reduces to the discrete analogous of the classical Hermite-Hadamard inequality (73) (see [13]):
5 Strongly Convex Functionals in Normed Linear Spaces
Strongly convex functions have been introduced by Polyak [17] and they play an important role in optimization theory, mathematical economics, and other branches of pure and applied mathematics. Many properties and applications of them can be found in the literature (see, for instance, [1, 4, 10, 13, 14, 16, 17], and the references therein).
In what follows, (X, ∥⋅∥) denotes the real normed linear spaces, D be a convex subset of X, h : (0, 1) → (0, ∞) is a given function and c be a positive constant.
Definition 4 (See [13])
A function \(f:D\rightarrow \mathbb {R}\) is called strongly convex with modulus c, if
∀x 1, x 2 ∈ D, ∀λ ∈ [0, 1].
In this section, we introduce a new class of strongly convex functional with modulus c in real normed linear spaces, that is, (α, β, λ, t, h) strongly convex functional with modulus c in real normed linear spaces, and present the new Schur, Jensen, and Hermite-Hadamard type inequalities for these strongly convex functional with modulus c. They are significant generalizations of the corresponding inequalities for the classical convex functions.
Definition 5
A functional f : D → (0, ∞) is said to be a (α, β, λ, t, h) strongly convex with modulus c, if
∀x 1, x 2 ∈ D, ∀λ, t ∈ [0, 1], α, β are real numbers, and α, β ≠ 0.
For c = 0 in (78), we get
that is, f reduces to (α, β, λ, t, h) convex functional in Section 2.
For t = λ in (78), that is,
then f is said to be a (α, β, λ, h) strongly convex functional with modulus c. If c = 0 in (80), then f reduces to (α, β, λ, h) convex functional in Section 2.
If h(λ) = λ s, 0 < |s|≤ 1, then (α, β, λ, t, h), (α, β, λ, h) strongly convex functional with modulus c reduce to (α, β, λ, t, s), (α, β, λ, s) strongly convex functional with modulus c, respectively. In particular, if s = 1, then f is said to be a (α, β, λ, t), (α, β, λ) strongly convex functional with modulus c, respectively.
If D = (0, ∞) in (78), that is, if a function f : (0, ∞) → (0, ∞) satisfies
∀x 1, x 2 ∈ (0, ∞), ∀λ, t ∈ [0, 1], α, β are real numbers, and α, β ≠ 0, then f is said to be a (α, β, λ, t, h) strongly convex function with modulus c.
For c = 0 in (81), we get
that is, f reduces to (α, β, λ, t, h) convex function in Section 2.
If t = λ in (81), that is,
∀x 1, x 2 ∈ (0, ∞), ∀λ ∈ [0, 1], α, β are real numbers, and α, β ≠ 0, then f is said to be a (α, β, λ, h) strongly convex function with modulus c.
For c = 0 in (83), we get
that is, f reduces to (α, β, λ, h) convex function in Section 2. If h(λ) = λ s, 0 < |s|≤ 1 in (83), we get
then f is said to be a (α, β, λ, s) strongly convex function with modulus c.
For c = 0 in (85), that is,
that is, f reduces to (α, β, λ, s) convex function in Section 2.
Remark 4
If α = β = 1, s = 1, then (86) reduces to the classical convex function. In fact, the notion of (α, β, λ, t, h) strongly convex functional with modulus c unifies and generalizes the many known and new classes of convex functions, see, e.g., [1, 10, 13, 14, 16, 17], and the references therein.
6 New Schur, Jensen, Hermite-Hadamard Type Inequalities
In this section, we present the Schur, Jensen, and Hermite-Hadamard type inequalities for (α, β, λ) strongly convex functional with modulus c.
Lemma 2
Let g = {f β − c∥⋅∥2α}1∕β with f β(∥x∥) ≥ c∥x∥2α, x ∈ D, then a functional f : D → (0, ∞) is (α, β, λ) strongly convex with modulus c if and only if the functional g : D → (0, ∞) is (α, β, λ) convex.
Proof
Assume that f is (α, β, λ) strongly convex with modulus c, then
which proves that g is (α, β, λ) convex.
Conversely, if g is (α, β, λ) convex, then
which proves that f is (α, β, λ) strongly convex with modulus c.
Using Corollary 1 (with h(t) = t) and Lemma 2, and the definition of (α, β, λ) strongly convex with modulus c, we get
Theorem 5
Let a functional f : D → (0, ∞) be (α, β, λ) strongly convex with modulus c, and h : (0, 1) → (0, ∞) is a super-multiplicative function, then for all x 1, x 2, x 3 ∈ D, such that ∥x 1∥α < ∥x 2∥α < ∥x 3∥α, and 0 < ∥x 3∥α −∥x 1∥α < 1, the following Schur-type inequalities holds:
Using Corollary 3 (with h(λ k = λ k, t k = λ k, ξ k = 1)) and Lemma 2, and the definition of (α, β, λ) strongly convex with modulus c, one obtains the following new Jensen-type inequality:
Theorem 6
Let a functional f : D → (0, ∞) be (α, β, λ) strongly convex with modulus c, and f β(∥x∥) ≥ c∥x∥2α, x ∈ D, and h : (0, 1) → (0, ∞) is a super-multiplicative function, then
for any x k ∈ D, λ k ∈ [0, 1], 1 ≤ k ≤ n, with \(\sum _{k=1}^{n}\lambda _{k}=1\).
We present a counterpart of the Hermite-Hadamard inequality for (α, β, λ, h) strongly convex functional with modulus c. In what follows, we use the notations in Section 4.
Theorem 7
Let B(0, r 1) be an n-ball of radius r 1 in E n(p), E = B(0, r 2) − B(0, r 1), 0 < r 1 < r 2 < ∞. Let f : E → (0, ∞) be a (α, β, λ, h) strongly convex functional with modulus c. If \(\int _{E}\|x\|{ }_{p}^{\alpha -n}f^{\beta }(\|x\|{ }_{p})dx<\infty \), and h ∈ L(0, 1), then
Proof
By transforming the integral to polar coordinates (see [9]), we have
Setting \(r=\big ( \frac {r_{2}-u}{r_{2}-r_{1}} r_{1}^{\alpha /p}+ \frac {u-r_{1}}{r_{2}-r_{1}} r_{2}^{\alpha /p} \big )^{p/\alpha }\), we have
By the definition of (α, β, λ, h) strongly convex with modulus c, we get
Thus, by (90), (91) and (92), we obtain
which gives the right-hand inequality in (89).
To show the left-hand inequality in (89), setting \(u=\frac {1}{2}(r_{1}+r_{2})+t\), then
Setting
we get
Thus, by (80), we have
Hence, by (91), (93), and (94), we get
which finishes the proof.
Corollary 11
Let \(X=\mathbb {R}^{n}, B(0,r_{k})\) be an n-ball of radius r k in \(\mathbb {R}^{n}, E=B(0,r_{2})-B(0,r_{1}),0<r_{1}<r_{2}<\infty \). Let a functional f : E → (0, ∞) be (α, β, λ, h) strongly convex with modulus \(c, \int _{E}\|x\|{ }_{2}^{\alpha -n}f^{\beta }(\|x\|{ }_{2})dx<\infty \), and h ∈ L(0, 1), then
Corollary 12
Let a function f : (0, ∞) → (0, ∞) be (α, β, λ, h) strongly convex with modulus c. If \(\int _{a}^{b}x^{\alpha -1}f^{\beta }(x)dx<\infty ,0<a<b<\infty \), and h ∈ L(0, 1), then
If α = −1, then (97) reduces to
In particular, if c = 0, h(t) = t, then the above inequality reduces to the mail result of [15]:
If α = β = 1, then (97) reduces to the Hermite-Hadamard inequality for strongly h-convex functions:
If h(t) = t s, 0 < s ≤ 1, then (98) reduces to:
If h(t) = t −s, 0 < s < 1, then (98) reduces to:
If h(t) = t, s = 1, then (98) reduces to:
If c = 0, then (101) reduces to the classical Hermite-Hadamard inequality (73).
Hence, the above results are some substantial refinements and generalizations of the corresponding results obtained by Nikodem [13] and Merentes and Nikodem [10].
References
A. Azócar, J. Giménez, K. Nikodem, J.L. Sánchez, On strongly midconvex functions. Opusc. Math. 31(1), 15–26 (2011)
S.S. Dragomir, On some new inequalities of Hermite-Hadamard type for m-convex functions. Tamkang J. Math. 33(1), 55–65 (2002)
S.S. Dragomir, Inequalities of Hermite-Hadamard type for λ-convex functions on linear spaces. RGMIA Rep. Coll.17 Art 13 (2014, preprint)
S.S. Dragomir, Bounding the čebyšev functional for a differentiable function whose derivative is h or λ-convex in absolute value and applications. Le Matematiche 71(1), 173–202 (2016)
Z.B. Fang, R.J. Shi, On the (p, h)-convex function and some integral inequalities. J. Inequal. Appl. (2014, Paper No. 45)
G.H. Hardy, J.E. Littlewood, G. Polya, Inequalities, 2nd edn. (Cambridge University Press, London, 1952)
J.-B. Hiriart, C. Lemaréchal, Fundamentals of Convex Analysis (Springer, Berlin, 2001)
J.C. Kuang, Applied Inequalities, 4th edn. (Shangdong Science and Technology Press, Jinan, 2010)
J.C. Kuang, Real and Functional Analysis (continuation), vol. 2 (Higher Education Press, Beijing, 2015)
N. Merentes, K. Nikodem, Remarks on strongly convex functions. Aequ. Math. 80, 193–199 (2010)
D.S. Mitrinović, J.E. Pec̆arić, A.M. Fink, Classical and New Inequalities in Analysis (Kluwer Academic Publishers, Dordrecht, 1993)
C.P. Niculescu, L.-E. Persson, Convex Functions and Their Applications. A Contemporary Approach. CMS Books in Mathematics, vol. 23 (Springer, New York, 2006)
K. Nikodem, On strongly convex functions and related classes of functions, in Handbook of Functional Equations-Functional Inequalities. Springer Optimization and Its Applications, ed. by T.M. Rassias, vol. 95 (Springer, Berlin, 2014)
K. Nikodem, Z. Páles, Characterizations of inner product spaces by strongly convex functions. Banach J. Math. Anal. 5(1), 83–87 (2011)
M.A. Noor, K.I. Noor, M.U. Awan, Some new estimates of Hermite-Hadamard inequalities via harmonically r-convex functions. Le Matematiche 71(2), 117–127 (2016)
E.S. Polovinkin, Strongly convex analysis. Sb. Math. 187(2), 259–286 (1996)
B.T. Polyak, Existence theorems and convergence of minimizing sequence in extremum problems with restrictions. Sov. Math. Dokl. 7, 72–75 (1966)
H.N. Shi, Theory of Majorization and Analytic Inequalities (Harbin Institute of Technology Press, Harbin, 2012)
S. Vars̆anec, On h-convexity. J. Math. Anal. Appl. 326, 303–311 (2007)
W.L. Wang, Approaches to Prove Inequalities (Harbin Institute of Technology Press, Harbin, 2011)
X.M. Zhang, Y.M. Chu, New Discussion to Analytic Inequalities (Harbin Institute of Technology Press, Harbin, 2009)
K.S. Zhang, J.P. Wang, p-convex functions and their properties. Pure Appl. Math. 23(1), 130–133 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Kuang, J.C. (2019). Recent Advances of Convexity Theory and Its Inequalities. In: Rassias, T., Pardalos, P. (eds) Mathematical Analysis and Applications. Springer Optimization and Its Applications, vol 154. Springer, Cham. https://doi.org/10.1007/978-3-030-31339-5_12
Download citation
DOI: https://doi.org/10.1007/978-3-030-31339-5_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-31338-8
Online ISBN: 978-3-030-31339-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)