1. Introduction
There is no doubt that the convex sets and convex functions are widely used in numerous areas of science, such as control theory, operations research, optimization, geometry, information theory, and functional analysis. Roughly speaking, convex functions are extensively used in applied and theoretical mathematics because of thei two basic features: any local minima of the convex function is the global one and the convex function achieves its upper bound at the boundary point. Furthermore, there is at most one minimum of the strictly convex functions [
1,
2,
3]. The popular book of Littlewood, Hardy, and Pólya played a dominant role in the popularization of convexity [
4]. Mathematically, convex function is defined as follows [
5]:
A function
is convex if the inequality
holds for all
and
. There are several fruitful and interesting properties of convex functions which attract several mathematicians to this class of functions. In what follows, we present some important and basic properties of convex functions.
If the function
is convex, then
must be continuous and the left and right derivative of
will exist. Moreover,
will be differentiable almost everywhere on
. The right and left derivative of a convex function is increasing and for each point in the domain of the convex function, and there must be at least one support line. The epi-graph of a convex function is always a convex set. Due to those useful properties, several mathematicians generalized and extended the convex function and gave numerous results for the generalized convex functions. Many results associated to Hermite–Hadamard inequality for the
n-polynomial
P-convexity can be found in [
6]. In the following part of this section, we focus on some of the generalized families of convex functions. In [
7], Dragomir introduced the idea of convexity of the functions on the coordinate and introduced the following family of generalized convexity of the functions defined on the rectangular domain.
Let
be a function and the functions
be the partial functions defined as:
and
for all
and
. Then
is called coordinate convex on
, if
and
both are convex on
and
respectively. The important feature this class of functions is that a function which is convex must be coordinate convex and with the help of the example the author explained that every coordinate convex function may not be convex. The Hermite–Hadamard (H-H) and Jensen’s type inequalities are presented for this family of functions [
7,
8].
Gordji et al. [
9] gave the idea of
-convexity. This generalized convex function is given below (also see [
10]): a function
is known as
-convex with respect to the function
if
holds for all
and
.
It is obvious that if
is
-convex associated to the
defined by
, then
will be convex. The authors elaborated with the help of examples that there are nonconvex functions which are
-convex functions. Various related results to convexity are also presented for this class of functions, such as boundedness, support line inequality, Hermite–Hadamard, determinantal, and Jensen’s type inequalities. Using the idea of coordinate convex function, Zaheer Ullah et al. further generalized the family of
-convex functions and gave the idea of coordinate
-convex functions as follows ([
11]):
A function is coordinate -convex if the functions defined by and defined by are -convex and -convex for each and , respectively. Particularly, if , then is said to be coordinate -convex function.
The authors proved that if
is
-convex function defined on a rectangular domain, then
will be coordinate
-convex but the converse is not valid in general. Some interesting examples are presented and Hermite–Hadamard inequality is proved for this class of functions. One of the most widely applicable and dominant families of functions is the family of strong convexity. This family of functions was originally introduced and studied by Polyak in 1966 [
12]. The strongly convex function is defined as follows:
If
is a function such that the inequality
is valid for all
and
and for some
, then
is called a strong convex function.
The simple and easy criteria for checking the strong convexity of a function are: A differentiable function
is a strongly convex function if and only if
Moreover, if a function
is twice differentiable, then
is strongly convex associated to
c if and only if
It is remarkable to note that each strongly convex function is convex while it is not valid in general that every convex function will be strongly convex. Actually, the idea of strong convexity provides a strengthened form of the classical convexity. There are numerous applications of strong convexity in optimization theory. As Dragomir generalized the concept of convex function to the concept of coordinate convex function, in a similar fashion Adil Khan et al. presented a novel class of coordinate strongly convex functions ([
13]), which is stated below.
A function is coordinate strongly convex if and are strongly convex for each and , where and are defined as above.
In [
13] the authors noted that strong convexity implies coordinate strong convexity while the converse is not generally true. For more related interesting results we recommend [
13]. Before finishing this part, we recall the strong
-convexity definition which has been presented in [
14].
A function
is strongly
-convex associated to
and
, if
holds for all
and
. The Hermite–Hadamard inequality for this class of functions is given as follows:
In a similar fashion, a strongly
-convex function defined on a rectangular domain is given below: Let
and
. Then the function
is said to be strongly
-convex with respect to
c, if
holds for all
and
.
In [
14], the authors investigated Fejér as well as as Hermite–Hadamard type inequalities for
n-times differentiable strongly
-convex functions. The strong
-convexity of the
nth derivative of certain functions has been utilized and has derived some interesting inequalities [
15]. Moreover, further generalization of this class of functions has been presented in [
16], which is known as a strongly
-convex function. Some useful examples of strongly
-convex functions have been constructed. Furthermore, they presented Hermite-Hadamard type inequalities for this class of generalized convex functions.
2. Coordinated Strongly (,)-Convex Functions
This section is devoted to proposing a novel important class of functions which is named coordinated strongly (,)-convex function.
Definition 1. Let , be two intervals and , , be three functions, and the functions and be defined by Then Y is known as the coordinated strongly -convex on if and are strongly -convex and strongly -convex, respectively. In particular, if , then Y is said to be a coordinated strongly η-convex function.
Example 1. Let be defined by and . Then Y is a coordinated strongly η-convex on .
Proof. Consider the function
defined by
and
defined by
. Then for any
and
, we have
This represents that is strongly -convex on . In a similar fashion, we can show that is strongly -convex on .
Therefore, is coordinated strongly -convex on . □
Example 2. Let be defined by , and . Then Y is coordinated strongly (,)-convex.
Proof. The function defined by and defined by . Then, by the technique as given in the solution of Example 1, we can derive that is strongly -convex.
Now, we prove that
is strongly
-convex. For this
Noting that
,
and
, we have
which shows that
is strongly
-convex on
. Consequently,
is coordinated strongly
-convex.
The next result gives an important relation among the coordinated strongly -convex and strongly -convex functions. □
Lemma 1. Every strongly η-convex function defined on rectangular domain is coordinated strongly η-convex, while the converse is not generally true.
Proof. Let
be strongly
-convex on
and consider the partial mappings
defined by
and
defined by
. For any
and
, we have
The above inequality holds by using (
2).
This concludes that is a strongly -convex function. Similarly, we can show that is strongly -convex. Hence, is a coordinated strongly -convex function. □
For the converse of the above result, we describe the following example for an illustration.
Example 3. Let be defined by and . Then, Y is a coordinated strongly η-convex but not strongly η-convex function.
Proof. Consider
is defined by
and
is defined by
be partial mapping of
. For any
and
we get
This shows that is strongly -convex with modulus 1. In a similar fashion, we may prove that is strongly -convex on [1, 5] with modulus 1. Hence, is coordinated strongly -convex on .
Next, suppose that
is a strongly
-convex function. Then by (
2), we have
Substituting
,
and
, we deduce
which is not true for all
. Thus, the condition of strongly
-convexity fails and hence
is not a strongly
-convex function.
The H-H type inequality for coordinated strongly -convex function is given in the following theorem. □
Theorem 1. Let be coordinated strongly -convex with respect to and such thatwhere and are two positive real numbers. Then Proof. If
and
are two partial mappings of
, then by H-H inequality for the class of strongly
-convex functions given in (
1), we may write
Integrating (
4) with respect to
x on
, we get
Similarly, for the partial mapping
we deduce
Adding (
5) and (
6), we achieve the second and the third inequalities in (
3).
Now, again by Hadamard inequality, we get
Adding
and
to both sides of (
7) and (
8), respectively, and then summing the obtained inequalities, we derive the first inequality of (
3).
Next, by using Hadamard inequality again, we get
Summing all the above inequalities and then adding and to the both hand sides, we achieve the last required inequality. □
3. Results Arround Strongly -Convex Functions
In the below mentioned lemma, it is presented that the convex combination of strongly -convex functions is a strongly -convex function.
Lemma 2. Let be strongly η-convex functions with modulus and η be non-negative homogeneous functions. If such that , then the function is also a strongly η-convex function.
Proof. Set
with
. Then, we have:
It is clear from this that is a strongly -convex function. □
Lemma 3. Let , where is a strongly η-convex function and is η-convex function such that η is additive. Then, prove that Y is a strongly η-convex function.
Proof. This gives the strong -convexity of . □
Lemma 4. Let Y be a strongly η-convex function and . Thenwith and . Proof. Consider
is a strongly
-convex function, then
This proves the required inequality. □
Theorem 2. Consider the nonempty set of strongly η-convex functions such that
- (a).
There exist and with for all .
- (b).
For each , exists in .
Then, the function defined by for each , is a strongly η-convex function.
Proof. For any
and
, we have
This gives that is a strongly -convex function. □
Theorem 3. (Schur-type inequality).Suppose that is a strongly η-convex function. Then for such that and , we haveif and only if Y is a strongly η-convex function. Proof. With the help of strong
-convexity, we may write that
By setting
,
and
in (
10), we have
Conversely, let (
9) hold, and then by setting
,
and
in (
9) we deduce
which implies that
This is the required result. □
In the upcoming result, an important relation among the strong -convexity and -convexity has been presented.
Lemma 5. Prove that a strongly η-convex function is η-convex, while the converse is not generally true.
Proof. Let
be a strongly
-convex function, then by definition
Implies that
which shows that
is
-convex, □
For the converse of the above result, we demonstrate examples.
Example 4. Let be a function defined as and be defined as . Then Y is η-convex but not a strongly η-convex function.
Proof. For
and
, we have
Hence is an -convex function.
Next, If
is a strongly
-convex function, then by definition
which implies that
Substitute
, we deduce
which is not true for all
,
and
. Thus,
is not a strongly
-convex function on
. □
Example 5. Let be a function defined as and be defined as . Then Y is an η-convex but not strongly convex function.
Proof. For any
and
, we have
This yields the -convexity of on .
Now, suppose that
is a strongly
-convex function. Then
which implies that
Substitute
, we get
which is a contradiction for all
,
and
. Thus,
is not a strongly
-convex function on
. □
4. Brief History and Conclusions
One cannot ignore the great importance and scope of the class of convex functions in almost every branch of mathematics due to several features of convex functions [
17,
18,
19]. The convex function has been refined, extended, and generalized in numerous angles, such as
p-convex,
h-convex,
-convex, and Godunova–Levin functions [
20,
21,
22,
23,
24]. We give a brief history of some generalizations of convex functions. In 2001, Dragomir gave the idea of convexity on the co-ordinates and proved that every convex function implies convex on the co-ordinates and they found some examples that there are functions which have the property of convex on the co-ordinate but are not convex [
7]. In 2016, Gordji et al. extended further the family of convex functions to the family of
-convex functions [
9]. Gordji’s interesting work on
-convexity was devoted to pointing out the certain features and results for
-convex function. In 2019, Zaheer Ullah et al. further extended an
-convex function to
-convex on the co-ordinate [
11]. They also presented some results and inequalities for this class of functions and elaborated this with the help of some interesting examples. There is another strengthened version of convex function which was introduced by Polyak in 1966 and which is known as strong convex function [
12]. There is a rich body of literature devoted to strong convexity and numerous applications are devoted to strong convexity. In particular, it has a great role in the theory of optimization. As Dragomir gave the concept of convexity on the co-ordinate, in a similar fashion in 2019, Adil Khan et al. presented the idea of strong convexity on the co-ordinate and derived several important results and inequalities which clearly show the role of strong convexity on the co-ordinate [
13]. In 2017, Awan et al. introduced an interesting generalized family of convex functions which is named strong
-convex function [
14]. They also obtained several important results for this class of functions. Looking to the aforementioned history of different generalizations and extensions, in this article we presented a more advanced generalized
-convexity on the co-ordinate. Some examples and results are presented for this class of functions which show the relations and importance of this class of functions with earlier generalized convex functions. The article also presents some properties, examples, and results for the strong
-convex functions.