2. Basic Results on Interval Valued Functions
We denote by
the family of all bounded closed intervals in
, i.e.,
The well-known midpoint-radius representation is very useful: for
, define the midpoint
and radius
, respectively, by
so that
and
. We will denote an interval by
or, in midpoint notation, by
; so
Using midpoint notation, the Minkowski-type operations, for and are:
,
,
,
.
The
-difference of two intervals always exists and, in midpoint notation, is given by
the
-addition for intervals is defined by
Endowed with Pompeiu–Hausdorff distance
, defined by
with
and given also as
(here, for
,
), the metric space
is complete.
In part I we have introduced a family of general partial order relations, in terms of the gH-comparison index, as follows:
Definition 1. Given two intervals and and , (eventually and/or ) we define the following order relation, denoted , The space
is a lattice [
28,
29]. A strict partial order
and a strong partial order
(asymmetric and transitive) are defined as follows:
Definition 2. Given and and , (eventually and/or ) we define the following (strict) order relation, denoted ,and the following (strong) order relation, denoted , We have seen in part I that, by varying the two parameters
and
, we can obtain a continuum of partial order relations for intervals and, in particular, we have the following equivalences [
29]:
(Part I, Proposition 6): If A and B are two intervals, then it holds that
- (1)
,
- (2)
,
- (3)
,
- (4)
,
- (5)
.
(Part I, Proposition 7-e)
are the sets of intervals dominated by A, dominating A and incomparable with A, respectively.
(Part I, Proposition 8) for all
,
(Part I, Proposition 9) For
,
and all
,
where
and
are the opposite intervals of
A and
B.
(Part I, Lemma 1) For the lattice with , and for any it is
(1a) ⟹ (in the right part of implication, is not involved);
(1b) ⟹ (in the right part of implication, is not involved);
(2) ;
(3) assuming , then .
Recall that, from
the reverse order is defined by
, i.e.,
An interval-valued function is defined to be any
with
and
for all
. In midpoint representation, we write
where
is the midpoint value of interval
and
is the nonnegative half-length of
:
so that
In the half-plane , , each interval is identified with the point .
We will consider the same example functions adopted in part I:
Example 1. Let , , in midpoint notation, i.e., , . For we have and for it is ; the values of where the midpoint function is minimal or maximal are, approximately, with interval value and with interval value .
Example 2. Let , , . Function is differentiable on with and is differentiable with for and ; at these two points the left and right derivatives exist: , , , . Function is gH-differentiable on (including the points and ) and ; right and left gH-derivatives exist at and , respectively. At the points , , and , the gH-derivatives are (approximately) , , , .
Limits and continuity can be characterized, in the Pompeiu–Hausdorff metric
for intervals, by the
-difference. Recalling Proposition 10 in part I, we have that, for a function
, an interval
and an accumulation point
, we have
where the limits are in the metric
. If, in addition,
, we have
In midpoint notation, let
and
. Then the limits and continuity can be expressed, respectively, as
and
The gH-derivative for an interval-valued function, expressed in terms of the difference quotient by gH-difference, is defined as follows:
Definition 3. Let and h be such that . Then the gH-derivative of a function at is defined asif the limit exists. The interval satisfying (6) is called the generalized Hukuhara derivative of F (gH-derivative for short) at . Recall that if is not differentiable or if its left and right derivatives do not have the same absolute value, then does not exist, but possibly the left and right gH-derivatives , exist and we have , , where and are the notations for left and right derivatives.
The right gH-derivative of
F at
is
while, to the left, it is defined as
. The gH-derivative exists at
if and only if the left and right derivatives at
exist and are the same interval. In terms of midpoint representation
, the existence of the left and right derivatives
and
is required with
(in particular
if
exists) so that
For a gH-differentiable function, higher-order gH-derivatives are defined analogously to the ordinary case, using the gH-differences applied to the gH-derivatives of previous order:
Definition 4. Let be gH-differentiable on and and h be such that . The second order gH-derivative of at is defined asif the limit exists. The interval satisfying (8) is called the second order gH-derivative of F at . Inductively, if the gH-derivatives of orders of exist on , denoted respectively by , the gH-derivative of order k is defined asif the limit exists. The interval satisfying (9) is called the k-order gH-derivative of F at . In terms of notation, we will denote also by . The class of functions with continuous gH-derivatives of orders at all points for , will be denoted by ; in particular, will denote the class of continuous functions on (with right and left continuity at the extremal points).
Remark 1. In the case of an interval-valued function in the form , , with where and (assuming that has at most a finite number of zeros in [a,b]) have derivatives , for , we have that has all the gH-derivatives , i=1,…,k. Indeed, either does not change sign or it changes sign at a finite set of points , we have that the absolute value function has derivative at all points with ; on the other hand, considering left and right derivatives at each , it is for all ; it follows that has always left and right derivatives with the same absolute values and this ensures that, at all points , . Considering that has the same form as , it is immediate to conclude inductively that the same form is valid for all .
3. Extrema of Interval Valued Functions
The three concepts of monotonicity defined in part I (simple, strict and strong), based on the orders
,
and
, translate into different concepts of extrema. We will adopt the following terminology:
Definition 5. If , we say that dominates with respect to the partial order (for short, -dominates ), or equivalently that is -dominated by .
We say that and are incomparable with respect to if both and are not valid.
Analogous domination rules are defined in terms of the strict and strong order relations and , respectively.
Remark 2. Observe that if and , i.e., if and are -dominating each other, then and vice-versa, i.e., reciprocal dominance is equivalent to coincidence; the same remains true if the two orders for the dominance are obtained with different pairs , , and (), i.e., if and , then and vice-versa.
Let us now define the important definitions of order-based minimum and maximum points for an interval valued function.
Definition 6. Let be an interval-valued function and . Consider the order with , . We say that, with respect to ,
- (a)
is a local lattice-minimum point of F (-point for short) if there exists such that for all , i.e., if all around are -dominated by ;
- (b)
is a local lattice-maximum point of F (-point for short) if there exists such that for all , i.e., if all around -dominate .
In case (a) we say that is a -min-point for F and in case (b) we say that is a -max-point.
Conditions (a) or (b) in the definition above imply that if there exists such that and then it is impossible to have nor (unless and ); this means that, except for trivial cases, if then and are -incomparable or coincident.
Remark that a lattice-type extremal value corresponds, locally, to the smallest or greatest elements in the lattice ; it is clear that condition (a) implies that a min-point of F is necessarily a local minimum of the midpoint function , while condition (b) implies that a max-point of F is a local maximum of . It follows that a min-point or a max-point of F are to be searched, respectively, among the minimum or the maximum points of the midpoint function . But this is not sufficient; indeed, lattice-type minimality and maximality, with respect to the partial order can be recognized exactly in terms of the three function , and , as we will see in this section.
It will be useful to explicitly write the conditions for
-dominance of a general interval
, with respect to the intervals
and
, that characterize the minimality and the maximality of a point
(for min) or a point
(for max). Without explicit distinction between strict or strong dominance, we have
and
Proposition 1. Let be an interval-valued function. Then
- (a)
is a min-point of F if and only if it is a minimum of and and it is a maximum of ;
- (b)
is a max-point of F if and only if it is a maximum of and and it is a minimum of .
Proof. For (a), from the three conditions in (
10), the first
says that
is a local minimum of
, the second
say that
is a local maximum of
, the third
say that
is a local minimum of
. The proof of (b) is analogous, using the conditions in (
11). □
In particular, for the order, obtained with , , we have , and the conditions to have a min-point are equivalent to having simultaneously a minimum for and (and automatically for ); on the other hand, max-point conditions are equivalent to have the same maximum points for and , in the ordinary sense.
The discussion above highlights the restricting notion of a lattice-extreme point, as it is not frequent that simultaneous extrema occur for the three functions , and . The following definition is more general, as it considers the possibility that intervals for different x are locally incomparable with respect to the actual order relation.
Definition 7. Let be an interval-valued function and . We say that, with respect to the order and the corresponding strict order ,
(c) is a local best-minimum point of F (best-min for short) if:
(c.1) it is a local minimum for the midpoint function , and
(c.2) there exists and no point with such that ;
(d) is a local best-maximum point of F (best-max for short) if:
(d.1) it is a local maximum for the midpoint function , and
(d.2) there exists and no point with such that .
Remark 3. The definitions above are clearly valid also for points coincident with one of a or b. It is also evident that a lattice-type extremum is also a best-type extremum.
Definitions of strict and strong (local) extremal points can be given by considering the strict or the strong orders associated to the lattice order .
Definition 8. Let be an interval-valued function. With respect to an order and the associated strict order or strong order , we say that
- -
a best-min point is a strict (respectively strong) best-minimum point if there exists and no point with (or , respectively);
- -
a best-max point is a strict (respectively strong) best-maximum point if there exists and no point with (or , respectively).
Remark 4. It is clear that the definitions of lattice-type and best-type extremality do not require any assumptions on continuity of the interval-valued function F on ; in the case of continuity (or left/right continuity) the existence of extreme points is also related to the local left and/or right monotonicity of F (with respect to the same partial order ).
In order to illustrate basic properties of the various concepts of min/max ()-extremality, we will consider a continuous function and will suppose that there exist two points such that is a local minimum point and is a local maximum point, in one of the types defined above.
In the half plane of points
,
, the intervals
and
have midpoint representation, respectively,
It is immediate that if
is a lattice-minimum point, i.e., there exists a neighborhood of
such that all
satisfy (
10), then no such
is incomparable with
; analogously, if
is a lattice-maximum point, i.e., there exists a neighborhood of
such that all
satisfy (
11), then no such
is incomparable with
. We can express this fact by saying that the (local) min-efficient frontier for the
-point
is concentrated into the single interval
; analogously, the (local) max-efficient frontier for the max-point
is concentrated into the single interval
.
When instead and are best-type extrema and not lattice-type, then it is important to identify the intervals , in particular with x in a neighborhood of or , that are not min-dominated by (or do not max-dominate ); clearly, these are necessarily ()-incomparable with (or with , respectively).
Corresponding to a minimum and to a maximum point of F, we are then interested in identifying the locally (min/max)-efficient intervals and what we will call the local min or max efficient frontier for and around points and , respectively.
In the half plane
the conditions to recognize the (
)-based dominance and incomparability, assuming
and
, can be written by considering the two lines through
with equations
and the two lines through
with equations
For any
define the following sets of points (sets of intervals in midpoint representation)
The intervals
belonging to
are
-dominated by interval
and the ones belonging to
are
-dominated by interval
. If
and
are not lattice-type extrema of
F, then there exist points
around
(respectively,
) such that
(respectively,
). The first step in finding the efficient frontier for a strict minimum and a strict maximum is the following:
Proposition 2. Let be an interval-valued function with values in the lattice endowed by a partial order , . Let be local strict best-min and local strict best-max points of F. Then, there exist , , and (all belonging to ) such that, respectively,
- 1.
is incomparable with , for all , ;
- 2.
is incomparable with , for all , .
Proof. The proof follows immediately from the definition of strict best-min and best-max points and from the fact that the sets and are indeed intervals (eventually singletons). □
With reference to Example 1, function
has a local minimum point
and a local maximum point
; with the partial order
, i.e.,
and
, the locally non-dominated points corresponding to
and
are black colored in the top picture of
Figure 1; we have
and
, marked with vertical red colored lines around
and
in the bottom picture.
The intervals for a minimum, or for a maximum, are not difficult to determine; for example, for a minimum point , a simple algorithm is to move on left and right of by small steps of length at points , until is not dominated by and at points , until is not dominated by ; if is the first dominated value on left and is the first dominated value on right, the extremes and are found by appropriate bisection iterations to refine the search up to a prescribed precision. An analogous procedure can be designed for a maximum point , by moving on the left and right until points and with and dominated by ; in this case the extremes and are found by bisections up to a prescribed precision.
A first consequence of Proposition 2 is a sufficient condition for a lattice-type extremal point.
Proposition 3. Let ; if (respectively, ) is a minimum point (a maximum point) of function and (or ) then is a lattice min-point (respectively is a lattice max-point) of and vice versa.
Proof. Indeed, in this cases, we have and . □
A second consequence of the last proposition is that the efficient intervals , relative to the best-min point or to the best-max point , in the case where they are not lattice extrema, are to be searched among the points and , respectively.
The final step is now to characterize the points of and that contain, respectively, , and are such that all the corresponding define the local efficient frontier of F around and , respectively.
We start with a formal definition of the min/max efficient frontier:
Definition 9. Let be an interval-valued function and let be local strict best-min and local strict best-max points of F with respect to the partial order , .
- (a)
The (local) min-efficient frontier of function F associated to the best-min point (or to the best-min interval-value ) is the set of interval-values such that:
- (a.1)
,
- (a.2)
if and then and are ()-incomparable,
- (a.3)
no other set containing has property (a.2).
The set of points such that are the local min-efficient points corresponding to and is denoted by .
- (b)
The (local) max-efficient frontier of function F associated to the best-max point (or to the best-max interval-value ) is the set of interval-values such that:
- (b.1)
,
- (b.2)
if and then and are ()-incomparable,
- (b.3)
no other set containing has property (b.2).
The set of points such that are the local max-efficient points corresponding to and is denoted by .
Clearly, the efficient frontiers
or
are subsets of the interval in Proposition 2; but their characterization is not easy, as we can imagine in cases where the function
has possible inflexion or angular points, tangency of high order, multiple nodes, fractal-like or complex pathological patterns (see, e.g., [
30]). In those cases it is not immediate to determine which points are not dominated by others of the same interval, or possibly the efficient frontiers may not be intervals.
In the case where function
represents locally a convex plane curve, standard results in elementary differential geometry (see, e.g., [
31], chapter 2) are of help in our context. We recall briefly some facts.
Let be the curve, in the half-plane with parametric equations , and parameter and assume that the curve is simple (no multiple points) and differentiable (i.e., both and are differentiable at internal points); one says that the curve has the convexity property if each of its points is such that the curve lies on one side of the tangent line to this point. In our setting, the convexity of is required only locally, by considering the restriction of to points around (or ). More precisely, let’s fix the notion of local convexity of by distinguishing the case of a minimum to the case of a maximum point.
Assumption 1. For a min point (not a lattice min) we will assume that there exist (not both equal to zero) such that the curve corresponding to the restriction of to the interval is simple and convex; this happens if the portion of plane on right of the curve, i.e., the setis convex; in this case, the following portion of the half plane is convex and boundedwhere , and , . It is not restrictive to assume that interval is the biggest subinterval of where the curve is locally convex.
Assumption 2. For a max point (not a lattice max), assuming the existence of such that the curve on interval is simple and convex, we obtain that the portion of plane on left of the curve, i.e.,is convex; in this case, the following set is convex and boundedwhere, this time, ,
and similarly for and in terms of .
It is not restrictive to assume that interval is the biggest subinterval of where the curve is locally convex.
Under Assumptions 1 or 2 (using the same notation) we can prove the following results:
Proposition 4. Let be a partial order on and let be such that is a local min point of and Assumption (A) is satisfied. Then there exist two points with and such that, for ,
- (1)
either maximizes and minimizes ,
- (2)
or minimizes and maximizes .
Furthermore, interval is the local efficient frontier of Definition 9.
In particular, if and are internal to the local convexity region and , are differentiable, then Proof. Consider the two lines with equations and ; points of the curve in common with one of the two lines will satisfy the equations and . Solving for and one obtains and and at such common points the two lines have equations: and . Now, by condition (A), the intercepts and , as functions of x, are monotonic around ; then the maximum value of the is attained at a point and the has a minimum value attained at a point .
By taking and , it is clear that conclusions (1) or (2) are satisfied.
If the points
and
are internal to the convexity region
, then the derivatives of
and
at the attained max and min points (respectively) will be zero; this proves conditions (
17). They mean that the line of equation
is tangent to the curve
at point
and the line
is tangent to
at point
.
The proof concludes by observing that the efficient region is exactly the interval ; indeed, by local convexity,
- (a)
no points with are dominated (or dominate) other points in the same interval, and
- (b)
points with and (if any) are dominated by and by , respectively.
□
Proposition 5. Let be a partial order on and let be such that is a local max point of and Assumption (B) is satisfied. Then there exist two points with and such that, for ,
- (1)
either minimizes and maximizes ,
- (2)
or maximizes and minimizes .
Furthermore, interval is the local efficient frontier of Definition 9.
In particular, if and are internal to the local convexity region and , are differentiable, then Proof. We can proceed analogously to the proof of Proposition 4; in this case, under condition (B), two points
and
are obtained by minimizing the intercept
and by maximizing
, respectively. Taking
and
, the tangency conditions with the curve
are exactly the ones in (
18). □
A procedure for the efficient frontiers corresponding to a minimum or maximum point can be obtained in a similar way as for determining the intervals , or ; e.g., for a minimum, we move on left and right of by small steps and , until the monotonicity of intercepts or is interrupted in two consecutive points or, equivalently, until a point is found which dominates the next one. Also in this case, we can refine the search by appropriate bisections.
A complete example with several possible situations is presented in
Section 5.
With reference to Example 1, the efficient frontiers are
and
(see
Figure 2).
In the next
Figure 3, the first derivatives of the three functions
,
and
are visualized (the second is changed in sign with respect to the notation in conditions (A) and (B)); by checking appropriate monotonicity of the three derivatives, we see that condition (A) is satisfied in a neighborhood of
and condition (B) is valid around
. Corresponding to the relevant points, the three derivatives are zero, according to Propositions 4 and 5 (picture on top).
Consider the function
(midpoint notation) of Example 2 with
.
Figure 4 contains the graph of
in interval form (top picture) and in midpoint form
(bottom).
The point with is a local maximum of function and the point with is a local minimum of .
Let us chose, e.g.,
and
;
Figure 5 shows the (
)-dominance for the interval-values
with
x around
and
. In midpoint representation,
appears on the left portion of the top picture and
on the right portion; the parallelogram contains the intervals
(in red color) of the graph of
F that are (
)-dominated by
and (
)-dominated by
. The bottom picture marks the intervals
and
and shows the intervals
and
corresponding to the points around
and
with dominated interval-values. Clearly,
results in a local (and global on the considered domain
of
F) lattice-maximum point of
F, while
is a local (and global) best-minimum point. Indeed, we have that
reduces to the single point
while
is the interval
, approximated numerically as it is depending on the actual values of
and
.
The local min-efficient frontier corresponding to the best-min point
, i.e., the points in
, can be easily computed (see below) and are pictured in
Figure 6. In the top picture, the green points are the ones min-dominated by
, corresponding to the points in
; the efficient frontier
is identified in the mid-point graph of
by the green points intercepted by the lines with angular coefficients
,
and “tangent” to the graph of
F (see below for the details). In the bottom part of the same Figure, the min-efficient frontier is evidenced by vertical lines around
, corresponding to the points
.
We conclude this section to see how local extremality of a point (minimum) or (maximum) is connected to the left and/or right gH-derivatives , or to the gH-derivative if the two are equal.
Let
and
be a partial order. Suppose first that
,
exists (here
). We have seen that if
is a local minimum or maximum point, then
so that
; as a consequence, a necessary condition for a local min or max at a point of differentiability is that
. If also
(i.e., if
), then
. Otherwise, if
, by the continuity of
, there exists a neighborhood of
where
is (
)-incomparable with
. So, we have the following Fermat-like property:
Proposition 6. Let , , F gH-differentiable at and be a partial order on .
- (1)
If is a lattice extremum for F (a lattice-min or a lattice-max point), then ;
- (2)
If is a best-extremum for F (a best-min or a best-max point), then .
Also contrapositive versions of the statements are evident: if , then is not a local extremum for F.
In the cases where F has left or right gH-derivatives at (or they are not equal), necessary conditions for a lattice-min or a best-min (respectively, a lattice-max or a best-max) can be easily deduced according to Proposition 14 in part I.
Proposition 7. Let , and be a partial order on . Suppose that F has left and right gH-derivatives at (if or we consider only the right or the left gH-derivatives, respectively)
- (1.a)
If is a lattice minimum point for F, then and ;
- (1.b)
If is a lattice maximum point for F, then and ;
- (2.a)
If is a best-minimum point for F, then .
- (2.b)
If is a best-maximum point for F, then .
The following are sufficient conditions based on the “sign” of left and right gH-derivatives, analogous to the well known situation for single-valued functions.
Proposition 8. Let , and be a partial order on . Suppose that F has left and right gH-derivatives at (if or we consider only the right or the left gH-derivatives, respectively)
- (a)
If and , then is a best minimum point for F;
- (b)
If and , then is a best maximum point for F.
5. Complete Discussion of an Example
We conclude the presentation of our results with a complete discussion of the following example.
Complete Example: function
is defined by
and
for
. In this example, we have chosen
,
. Remark that both
and
are differentiable so that, in midpoint notation, the first order gH-derivative is
and the second order gH-derivative is
(see [
12,
14]).
All computations are performed with a precision of at least five decimal digits.
Internally to
, we consider eleven points where
is locally minimal or maximal (we will ignore the first and last ones as too near to boundaries
a,
b). They are marked in
Figure 7 by a blue diamond symbol. They are denoted
corresponding to the rows in
Table 1.
The two points
and
, corresponding to a local minimum and maximum of
and marked, in the
-plane, with a square symbol, will be analyzed in detail. The vertical segments in top of
Figure 7 represent intervals
and
.
Figure 8 gives the first order gH-derivative of
; remark that, according to fourth column in
Table 1, we always have
and
.
In
Figure 9 the gH-derivative is pictured in midpoint half plane
; the points where
are marked in correspondence with the value
on the abscissa (compare also with
Table 1).
The second order gH-derivative, represented in
Figure 10, shows that the intervals
, as expected, are entirely positive at the minima and negative at the maxima. Remark that in no points the first and second derivatives of
are simultaneously zero.
In this example, where both
and
have continuous second order derivative, the convexity region is particularly simple to identify, due to a well known Theorem based on the sign of the curvature of curve
associated to
. We consider the following function
(its sign coincides with the sign of the curvature of
at
x). We then search for the points, on the left and right of
, at which the sign of
has the same sign of
. Analogous result is valid for
(see Chapter 6 in [
32] for the general result). In our example we find the interval
around
and the interval
around
(see
Figure 11).
From the local convexity of the curve
, the efficient regions corresponding to
and
are computed under Assumption 1 for min and Assumption 2 for max; the resulting intervals, illustrated in
Figure 12, are, respectively,
around
and the interval
for
.
The next
Figure 13 gives the three functions
,
,
; as we have seen in part I, their sign gives information on the monotonicity of
. In particular, if all three functions (observe that the second function is changed in sign with respect to the properties in part I) have the same sign (hence are also not zero) at a point
x, then
is strictly increasing or decreasing with respect to the partial order
. The same information can be eventually deduced from the sigh of the tree derivatives
,
,
, given in
Figure 14; at points where the three derivatives have different signs, then function
is not
-monotonic.
The results of our analysis, as described for the min and max points
and
, are visualized in
Figure 15, giving the midpoint representation of
. Here, we see the position of point
, with the delimiters
,
of the efficient region
(in green color); analogously, the position of the max point
is evidenced, with the delimiters
,
of the efficient region
. Clearly, the two points correspond to local best-min and best-max points (not of lattice type).
The last three Figures summarize, respectively, the computations for all the local minima and maxima considered in
Table 1. The first
Figure 16 reproduces
in interval form, with the visualization of the six local maxima and the five local minima, classified according to the computations. The points
,
in the first column of
Table 1, together with corresponding interval values
(as in the second column) are marked with a vertical segment in black color. Correspondingly, the efficient regions are delimited by vertical lines (cyan-colored for max points and magenta for min points). There are two local maxima, corresponding to
with
and
with
which are lattice max-points: the efficient frontier coincides with the point itself and the two maximal intervals dominate locally all the near intervals
(in the figure, the black and cyan vertical lines are coincident). This is also visible in
Figure 17 in terms of the values of the three derivatives
,
and
evaluated at
and at the points defining the efficient regions: for the two lattice maxima, the three derivative are zero, while in the other minima or maxima only
is zero and the other two derivatives do not have (at least generally) the same sign (but one or both may possibly be zero).
Finally,
Figure 18 summarizes all the computations by the midpoint visualization of our function
, with all the points
and the corresponding efficient regions.