In all the problems examined so far, the functions defining the class for optimization were required to be continuously differentiable that is . Yet, it is natural to wonder whether cornered trajectories, i.e., trajectories represented by piecewise continuously differentiable functions, might not yield improved results. Besides improvement, it is also natural to wonder whether those problems of the calculus of variations which do not have extremals in the class of functions actually have extremals in the larger class of piecewise functions.
Definition 3.10: Piecewise functions
A real-valued function is said to be piecewise , denoted , if there is a finite (irreducible) partition such that may be regarded as a function in for each When present, the interior points are called corner points of .
Some remarks are in order. Observe first that, when there are no corners, then . Further, for any is defined and continuous on except at its corner points where it has distinct limiting values ; such discontinuities are said to be simple, and is said to be piecewise continuous on denoted . Figure 3.8 illustrates the effect of the discontinuities of in producing corners on the graph of . Without these corners, might resemble the function whose graph is presented for comparison. In particular, each piecewise function is βalmostβ , in the sense that it is only necessary to round out the corners to produce the graph of a function. These considerations are formalized by the following Lemma:
Lemma 3.4: Smoothing of Piecewise Functions
Let . Then, for each there exists such that except in a neighborhood of each corner point of . Moreover, where is a constant determined by .
Likewise, we shall consider the class of -dimensional vector valued analogue of consisting of those functions with components The corners of such are by definition those of any one of its components Note that the above lemma can be applied to each component of a given and shows that can be approximated by a which agrees with it except in prescribed neighborhoods of its corner points. Both real valued and real vector valued classes of piecewise functions form linear spaces of which the subsets of functions are subspaces. Indeed, it is obvious that the constant multiple of one of these functions is another of the same kind, and the sum of two such functions exhibits the piecewise continuous differentiability with respect to a suitable partition of the underlying interval . Since , we have:
defines a norm on Moreover,
can be shown to be another norm on with being a suitable partition for . (The space of vector valued piecewise functions By analogy to the linear space of functions, the maximum norms and are referred to as the strong norm and the weak norm, respectively; the functions which are locally extremal with respect to the former [latter] norm are said to be strong [weak] extremal functions.
A natural question that arises when considering the class of functions is whether a (local) extremal point for a functional in the class of functions also gives a (local) extremal point for this functional in the larger class of functions. We state the following Theorem:
Theorem 3.8: Extremals vs. Extremals
If gives a [local] extremal point for the functional:
on with
then also gives a [local] extremal point for
on with respect to the same or norm.
On the other hand, a functional may not have extremals, but be extremized by a function. We shall first seek for weak (local) extremals i.e., extremal trajectories with respect to some weak neighborhood .
on where and its partials are continuous on one can therefore duplicate the analysis of the previous section. This is done by splitting the integral into a finite sum of integrals with continuously differentiable integrands, then differentiating each under the integral sign. Overall, it can be shown that a (weak, local) extremal must be stationary in intervals excluding corner points, i.e. the Euler equation is satisfied on except at corner points of .
Besides necessary conditions of optimality on intervals excluding corner points of a local extremal the discontinuities of which are permitted at each are restricted. These are the so-called first Weierstrass-Erdmann corner conditions.
Theorem 3.9: First Weierstrass-Erdmann Corner Condition
Let be a (weak) local extremal of the problem to minimize the functional
on where and its partials are continuous on . Then, at every (possible) corner point of we have:
where and denote the left and right time derivative of at respectively.
Proof. Integrating both sides of Euler equation between and for each component gives:
therefore the function is continuous at each even though may be discontinuous at that point. That is . Moreover, being continuous in its arguments, being continuous at , and having finite limits at we get:
for each β‘
Remark 3.16
The first Weierstrass-Erdmann condition of Theorem 3.9 shows that the discontinuities of which are permitted at corner points of a local extremal trajectory are those which preserve the continuity of . Likewise, it can be shown that the continuity of the Hamiltonian must be preserved at corner points of that is:
which yields the so-called second Weierstrass-Erdmann corner condition.
Example 3.12. Consider the problem to minimize the functional:
where . The lagrangian is independent of the independent variable , we thus have the constancy of the Hamiltonian on a stationary trajectory. Thus:
for some constant . Upon semplification, we get:
in order to solve this differential equation we make the substitution and thence , we get the somewhat simpler equation that can be solved by separation of variable and has general solution:
where is a constant of integration. In turn, substituing back we conclude that a stationary point must be of the form:
In particular, the boundary conditions and produce constants and . However, the resulting stationary function:
is defined only for or . Thus, there is no stationary function for the Lagrangian in . Next, we turn to the problem of minimizing in the larger set . Suppose that is a local minimizer for on . Then, by the Weierstrass-Erdmann condition, we must have:
which gives:
by definition of corner points, we must have , hence corner points are only allowed at those such that . Observe that since and thus the functional is bounded below by . This means that if we are able to find a function that satisfies the necessary conditions and achieve then is the global optimum of the problem. From the boundary condition we have that and and from the Weierstrass-Erdmann condition we have that we can only have corner points at time instants such that . We can then construct a function that is from to where it has a corner point and grows linearly with constant derivative equal to up to so that . More precisely:
such a function achieves the global minimum and satisfies the necessary conditions (i.e. it has a corner point at where ) and thence it is the unique global minimum point for on . The global optimum is plotted in Figure 3.9.
Corollary 3.1: Absence of corner points
Consider the problem to minimize the functional:
on . If is a strictly monotone function of (or, equivalently, is a convex function in on ), for each , then an extremal solution cannot have corner points.
Proof. By the first Weierstrass-Erdmann corner condition, at a corner point holds:
Letβs define vector-valued function . By hypothesis is strictly monotone in and thus it cannot assume twice the same value. The Weierstrass-Erdmann condition can be written in terms of as:
but by definition of corner point thus contradicting the strictly monotonicity of . β‘
Example 3.13 (Minimum Path Problems). Consider again the problem in Example 3.8that is to minimize the distance between two fixed points, namely and in the -plane. We have shown that extremal trajectories for this problem correspond to straight lines. But could we have extremal trajectories with corner points? The answer is no, the lagrangian is and is a strictly monotone function in hence we can apply Corollary 3.1and conclude that extremal trajectories for this problem cannot have corner points.
The GΓ’teaux derivatives of a functional are obtained by comparing its value at a point with those at points in a weak norm neighborhood. In contrast to these (weak) variations, we now consider a new type of (strong) variations whose smallness does not imply that of their derivatives. In the scalar case 6 , we consider variations defined as:
Where and and are positive real coefficients such that and .
Note that strong variations of this kind depend on three parameters . Informally speaking is the point at which the perturbation is centered while determines the extension in time of the perturbation. Note that the conditions and constrain the variation to lie within the open interval . The parameter modulates the magnitude of the variation and of its derivative. We are now ready to state a set of necessary conditions for a strong local minimum, whose proof is based on the foregoing class of variations.
Theorem 3.10: Weierstrassβ Necessary Condition
Consider the problem to minimize the functional:
on Suppose gives a strong (local) minimum for on . Then,
at every and for each . ( is referred to as the excess function of Weierstrass ).
Proof. For the sake of clarity, we shall present and prove this condition for scalar functions only. Let . Note that both and being functions, so is . These smoothness conditions are sufficient to calculate , as well as its derivative with respect to at . Note that and differ only in the interval . Hence, by the definition of , we have:
note that we have splitted the integral in the points of discontinuities of the derivative of . The differential quotient is:
where we have applied Theorem 3.6. In order to analyse the second term we define , its time-derivative is and thus we have:
using the first-order Taylor series expansion in under the integral sign we have:
where the arguments have been compressed for notational simplicity. Therefore we have:
upon integration by parts of the term involving we obtain:
note that the term since Euler equations are necessary condition for optimality. Then by definition of small we have , finally the last term reduces to:
since and . Since is a local strong minimizer we have , for all sufficiently small , and thence also in the limit
and thus:
for every and . β‘
Example 3.14 (Minimum path problem II). Consider again the problem in Example 3.8that is to minimize the distance between two fixed points, namely and in the -plane. We have shown that extremal trajectories for this problem correspond to straight lines joining and , that is:
where and . We now ask the question whether is a strong minimum for that problem? The Weierstress excess function is:
note that in this simple case it can be regarded as a function of and only. The excess function is plotted as a function of for different values of in Figure 3.11. It is easily checked that it is always nonnegative therefore is also a strong local minimum for the minimum path problem. In fact, we note that the function is convex 7 . The Weierstrass condition is equivalent to:
That holds true for every being precisely the first-order characterization of convexity of .
The following corollary indicates that the Weierstrass condition is also useful to detect strong (local) minima in the class of functions.
Corollary 3.2: Weierstrassβ Necessary Condition
Consider the problem to minimize the functional:
where the functional space is defined as and a continuously differentiable function. Suppose that gives a (local) minimum for on .
Then :
at every and for each .
Remark 3.17: Weierstrassβ Condition and Convexity
It is readily seen that the Weierstrass condition of Theorem 3.10 is satisfied automatically when the Lagrangian function is partially convex (and continuously differentiable) in , for each .
Remark 3.18: Weierstrassβ Condition and Pontryaginβs Maximum Principle
Interestingly enough, the Weierstrassβ condition can be rewritten as:
which given the definition of Hamiltonian gives:
for each and for each . This necessary condition prefigures Pontryaginβs Maximum Principle in optimal control theory.