1. Introduction
Lin and Fukushima [
1] introduced the concept of higher order strongly convex functions and used it in the study of mathematical program with equilibrium constraints. Mishra and Sharma [
2] derived the Hermite-Hadamard type inequalities for higher order strongly convex functions.
To be more precise, a function
F on the convex and closed set
K is said to be a
higher order strongly convex, if there exists a constant
such that
for all
,
,
, where
If
, then higher order strongly convex functions become strongly convex functions with the same
as defined in (
1). That is,
We would like to point out that the strongly convex functions were introduced and studied by Polyak [
3], which play an important part in optimization theory and related areas. For example, Karmardian [
4] used the strongly convex functions to discuss the unique existence of a solution of the nonlinear complementarity problems. Strongly convex functions also played an important role in the convergence analysis of the iterative methods for solving variational inequalities and equilibrium problems, see Zu and Marcotte [
5]. Nikodem and Pales [
6] investigated the characterization of the inner product spaces using the strongly convex functions, which can be viewed as a novel and innovative application. Qu and Li [
7] investigated the exponentially stability of primal-dual gradient dynamics using the concept of strongly convex functions. Awan et al. [
8] have derived Hermite-Hadamard type inequalities for various classes of strongly convex functions, which provide upper and lower estimates for the integrand. For more applications and properties of the strongly convex functions, see References [
1,
2,
3,
4,
5,
6,
7,
8,
9,
10,
11,
12,
13,
14,
15,
16,
17,
18] and the references therein.
We have noticed that the function
in (
1) is not correct and must be modified. Characterizations of the higher order strongly convex functions discussed in Lin and Fukushima [
1] are not correct. These facts and observations inspired us to consider higher order strongly convex functions involving an arbitrary bifuction
New concepts of monotonicity are introduced. New results under some mild conditions have been obtained. Our results represent the refinement and improvement of the results of Lin and Fukushima [
1]. Higher order strongly convex functions can be used to characterize the uniformly reflex Banach spaces. We have also deduced the weakly parallelogram laws for the
-spaces, which have been discussed in References [
19,
20,
21,
22,
23] from the concept of higher order strongly affine convex functions. This fact can be viewed as an elegant and interesting application of the higher order strongly convex functions. As special cases, one can obtain various new and refined versions of known results. It is expected that the ideas and techniques of this paper may stimulate further research in this field.
2. Formulations and Basic Facts
Let K be a nonempty set in a real Hilbert space The inner product and norm are denoted by by and respectively.
Definition 1 ([
1,
7])
. A set K in H is said to be a convex set if We now introduce some new classes of higher order strongly convex functions and higher order strongly affine convex functions with respect to the bifunction .
Definition 2. A function F on the convex set K is said to be higher order strongly convex with respect to the bifunction if there exists a constant such thatfor all , . A function F is said to higher order strongly concave with respect to bifunction if and only if, is higher order strongly convex .
The function F is said to be a higher order strongly J-convex function.
We now discuss some special cases.
(I). If
then the higher order strongly convex function becomes strongly convex functions, that is,
For the properties of the strongly convex functions in variational inequalities and equilibrium problems, see Noor [
2,
6] and Oettli et al. [
17].
(II). If then Definition 2 reduces to
Definition 3. A function F fn the convex set K is said to be higher order strongly convex if there exists a constant such thatfor all , . This notion was introduced and studied by Noor and Noor [
16].
(III). If , then Definition 2 reduces to
Definition 4. A function F on the convex set K is said to be higher order strongly convex with respect to an arbitrary function , if there exists a constant such thatfor all , . The above notion appears to be new one. For
, we have the strongly convex functions, introduced and studied by Ademak [
9].
For appropriate and suitable choice of the bifunction and p one can obtain various new and known classes of strongly convex functions. This shows that the higher order strongly convex functions involving the bifunction is quite a general and unifying one. One can explore the applications of the higher order strongly convex functions, this is another direction for further research.
Definition 5. A function F on the convex set K is said to be a higher order strongly affine convex with respect to the bifunction if there exists a constant such thatfor all , . Note that, if a function is both higher order strongly convex and higher order strongly concave, then it is a higher order strongly affine convex function.
A function
F is called a higher order strongly quadratic equation with respect to the bifunction
if there exists a constant
such that
for all
,
. This function
F is also called a higher order strongly affine
J-convex function.
Definition 6. A function F on the convex set K is said to be higher order strongly quasi convex, if there exists a constant such thatfor all , . Definition 7. A function F on the convex set K is said to be higher order strongly log-convex, if there exists a constant such thatfor all , . where . From the above definitions, we have
This shows that every higher order strongly log-convex function is a higher order strongly convex function and every higher order strongly convex function is a higher order quasi-convex function. However, the converse is not true.
Definition 8. An operator is said to be:
- 1.
higher order strongly monotone, if and only if there exists a constant such that - 2.
higher order strongly pseudomonotone if and only if there exists a constant such that - 3.
higher order strongly relaxed pseudomonotone if and only if there exists a constant such that
Definition 9. A differentiable function F on the convex set K is said to be higher order strongly pseudo convex function if and only if there exists a constant such that We also need the following assumptions regarding the bifunction .
Condition N. The bifunction
is required to satisfy this assumption:
If
, then the Definition 2 becomes
and if
, then the Definition 2 become
3. Main Results
In this section, we consider some basic properties of higher order strongly convex functions.
Theorem 1. Let F be a differentiable function on the convex set K and condition N hold. Then the function F is higher order strongly convex function, if and only if, Proof. Let
F be a higher order strongly convex function on the convex set
K. Then
which can be written as
Taking the limit in the above inequality as
, we have
which is (
2), the required result.
Conversely, let (
2) hold. Then, for all
,
,
, and using Condition N, we have
In a similar way, we obtain
Multiplying (
3) by
t and (
4) by
and adding the resultant, we have
showing that
F is a higher order strongly convex function. □
Theorem 2. Let F be a differentiable higher order strongly convex function on the convex set K. Then Proof. Let
F be a higher order strongly convex function on the convex set
Then, from Theorem 1. we have
Changing the role of
u and
v in (
5), we have
Adding (
5) and (
6), we have
which shows that
is a higher order strongly monotone operator. □
We remark that the converse of Theorem 2 is not true. In this direction, we have the following result.
Theorem 3. If the differential operator of a differentiable higher order strongly convex function F is a higher order strongly monotone operator and Condition N holds, then Proof. Let
be a higher order strongly monotone operator. Then, from (
7), we have
Since
K is an convex set, for all
,
,
. Taking
in ((
9) and using Condition N, we have
which implies that
Consider the auxiliary function
, for all
, from which we get
and
. Then, from (
10), we have
Integrating (
11) between 0 and 1, we have
Thus it follows that
which is the required (
8). □
We note that if then Theorem 3 can be viewed as the converse of Theorem 2.
We now give a necessary condition for a higher order strongly pseudo-convex function.
Theorem 4. Let be a higher order strongly relaxed pseudomonotone operator and condition N holds. Then F is a higher order strongly pseudo-connvex function.
Proof. Let
be a higher order strongly relaxed pseudomonotone operator. Then,
implies that
Since K is an convex set,
Taking
in (
12) and using Condition N, we have
Consider the auxiliary function
which is differentiable, since
F is differentiable function. Then, using (
13), we have
Integrating the above relation between 0 to 1, we obtain
that is,
showing that
F is a higher order strongly pseudo-convex function. □
Definition 10. A function F is said to be sharply higher order strongly pseudo convex, if there exists a constant such thatfor all , . Theorem 5. Let F be a sharply higher order strongly pseudo convex function on K with a constant Then Proof. Let
F be a sharply higher order strongly pesudo convex function on
K. Then
from which, we have
Taking limit in the above inequality, as
we have
the required result. □
Definition 11. A function F is said to be a pseudo convex function, if there exists a strictly positive bifunction such thatfor all , . Theorem 6. If the function F is higher order strongly convex function such that , then the function F is higher order strongly pseudo convex.
Proof. Since
and
F is higher order strongly convex function, then for all
,
, we have
where
, the required result. □
We now discuss the optimality for the differentiable generalized strongly convex functions, which is the main motivation for our next result.
Theorem 7. Let F be a differentiable higher order strongly convex function with modulus . If is the minimum of the function F, then Proof. Let
be a minimum of the function
F. Then
Since
K is a convex set, so, for all
,
,
Taking
in (
15), we have
Since
F is differentiable higher order strongly convex function, so
from which, using (
16), we have
the required result (
14). □
Remark 1. We would like to mention that ifthen is the minimum of the function F. The inequality (17) is called the higher order strongly variational inequality and appears to be a new one. Theorem 8. Let f be a higher order strongly affine function. Then F is a higher order strongly convex function if and only if is a convex function.
Proof. Let
f be a higher order strongly affine function, then
for all
.
From the higher order strongly convexity of
F, we have
for all
.
From (
18) and (
19), we have
from which it follows that
which show that
is a convex function. The inverse implication is obvious. □
It is worth mentioning that the higher order strongly convex function is also Wright higher order strongly convex function. From the definition 2, we have
for all
,
, which is called a higher order Wright strongly exponentially generalized preinvex function. One can study the properties and applications of the Wright higher order strongly convex functions in optimization operations research.
4. Application
Bynum [
19] and Chen et al. [
20,
21,
22] have studied the properties and applications of the parallelogram laws for the Banach spaces. Xi [
5] established new characteristics of
p-uniform convexity and
q-uniform smoothness of a Banach space using
and
, respectively. These results can be obtained from the concepts of higher order strongly convex (concave) functions, which can be viewed as a novel application.
Setting
and
in Definition 2, we have
for all
,
. Taking
in (
21), we have
which implies that
which is known as the lower parallelogram for the
-spaces. In a similar way, one can obtain the upper parallelogram law as
Similar to Definition 3, we can have
which is known as the parallelogram for the
-spaces. For the applications of the parallelogram laws in Banach spaces in prediction theory and applied sciences, see References [
19,
20,
21,
22,
23] and the references therein.