Necessary Optimality Conditions For Average Cost Minimization Problems
Piernicola Bettiol, Nathalie Khalil

TL;DR
This paper establishes necessary optimality conditions for average cost control problems with unknown parameters affecting dynamics, cost, and constraints, accommodating non-compact parameter spaces, thus broadening the theoretical framework for uncertain control systems.
Contribution
It introduces new necessary optimality conditions for control problems with unknown parameters in a general metric space, extending previous results to non-compact parameter sets.
Findings
Derived necessary conditions for optimality in average cost problems.
Extended the theory to include non-compact parameter spaces.
Applicable to control systems with uncertainties in dynamics and constraints.
Abstract
Control systems involving unknown parameters appear a natural framework for applications in which the model design has to take into account various uncertainties. In these circumstances the performance criterion can be given in terms of an average cost, providing a paradigm which differs from the more traditional minimax or robust optimization criteria. In this paper, we provide necessary optimality conditions for a nonrestrictive class of optimal control problems in which unknown parameters intervene in the dynamics, the cost function and the right end-point constraint. An important feature of our results is that we allow the unknown parameters belonging to a mere complete separable metric space (not necessarily compact).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Necessary Optimality Conditions For Average Cost Minimization Problems
Piernicola Bettiol111 *Laboratoire de Mathématiques, Université de Bretagne Occidentale, 6 Avenue Victor Le Gorgeu, 29200 Brest, France, e-mail: * [email protected] , Nathalie Khalil222 *MODAL’X, Université Paris Ouest Nanterre La Défense, 200 Avenue de la République, 92001 Paris Nanterre, France, e-mail: * [email protected]
Abstract
Control systems involving unknown parameters appear a natural framework for applications in which the model design has to take into account various uncertainties. In these circumstances the performance criterion can be given in terms of an average cost, providing a paradigm which differs from the more traditional minimax or robust optimization criteria. In this paper, we provide necessary optimality conditions for a nonrestrictive class of optimal control problems in which unknown parameters intervene in the dynamics, the cost function and the right end-point constraint. An important feature of our results is that we allow the unknown parameters belonging to a mere complete separable metric space (not necessarily compact).
1 Introduction
In this paper we consider a class of optimal control problems in which uncertainties appear in the data in terms of unknown parameters belonging to a given metric space. Though the state evolution is governed by a deterministic control system and the initial datum is fixed (and well-known), the description of the dynamics depends on uncertain parameters which intervene also in the cost function and the right end-point constraint. Taking into consideration an average cost criterion, a crucial issue is clearly to be able to characterize optimal controls independently of the unknown parameter action: this allows to find a sort of ‘best trade-off’ among all the possible realizations of the control system as the parameter varies. In this context we provide, under non-restrictive assumptions, necessary optimality conditions. More precisely, we consider the following average cost minimization problem:
[TABLE]
Here, is the Euclidean distance of a point from the set . The data for this problem comprise a time interval , a probability measure defined on a metric space , functions and , a nonempty multifunction , and a family of closed sets . A measurable function that satisfies
[TABLE]
is called a control function. The set of all control functions is written . A process is a control function coupled with a family of arcs , satisfying, for each , the dynamic constraint:
[TABLE]
A process is said to be feasible if, in addition, the arcs ’s satisfy the averaged right end-point constraint
[TABLE]
If the integral cost term in (LABEL:intprob) does not exist for a feasible process then we set . To underline the dependence on a given control , sometimes we shall employ the notation for the feasible arc belonging to the family of trajectories , associated with the control and the element .
A feasible process is said to be a local minimizer for (LABEL:intprob) if there exists such that
[TABLE]
for all feasible processes such that
[TABLE]
Control systems involving unknown parameters have been well-studied in literature finding widespread applications particularly from the point of view of the robust (worst-case) control, see for instance the monographs [1], [20] and [6] (and the references therein), and the paper [18] on minimax optimal control. In the introductory section of [20, Chapter IX], control problems with uncertainties are considered comparing the conservative approach (minimax) with an alternative approach in which one might minimize, for instance, an “expected value” (which corresponds to the average cost problem studied in our paper). Then, in [20, Chapters IX and X] Warga investigates the so-called “conflicting/adverse control problems” providing necessary conditions for this broad class of problems which covers minimax problems (under some regularity assumptions), but which does not cover optimal control problems having the average cost criterion studied in our paper. (See [21] for further developments on adverse control problems in the nonsmooth context; cf. the recent papers [13] on adverse control problems and [11] on state-constrained minimax problems.)
A growing interest has recently emerged in considering an ‘averaged’ (or ‘expected’ with respect to a given measure) approach, exploring various issues, directions and applications: see for instance a recent series of papers on aerospace systems [15], [16], [7], and the articles [2] and [22] on averaged controllability (from different viewpoints); see also [17] for results on heterogeneous systems.
Therefore, motivated not only by theoretical reasons but also by a recent growing interest in applications (such as aerospace engineering, see in particular [15] and [16]), in our paper we consider the ‘average cost’ paradigm rather than the more ‘classical’ criteria employed in the minimax/robust or adverse optimization framework.
For the general (nonsmooth) case we derive necessary optimality conditions ensuring the existence of a costate function which satisfies an averaged (on ) maximality condition. Moreover, the costate arcs ’s satisfy also the somewhat expected adjoint system and transversality condition, when belongs at least to a countable dense subset of supp. We show that these last two necessary conditions extend to the whole supp for free right end-point problems, if we impose (suitable) regularity assumptions on the dynamics and the cost function. We also prove that a further (non-trivial) case, in which the conditions of maximum principle extend to the whole supp, is when the measure is purely atomic (not necessarily with finite support).
This paper is organized as follows. We first study the simpler case in which the measure has a finite support (Section 2), which constitutes a discretization model for the general case of an arbitrary measure on a complete separable metric space (which is investigated successively). The main results are displayed in Section 3, and their proofs are given in Section 5. Section 4 is devoted to recall some fundamental theorems in measure theory and provide a limit-taking lemma which play a crucial role in our analysis. The approach that we suggest in our paper consists in approximating the measure by measures with finite support (convex combination of Dirac measures). Owing to Ekeland’s variational principle, we construct a suitable family of auxiliary optimal control problems, the solutions of which approximate the reference problem (LABEL:intprob). Invoking the maximum principle (applicable in a more traditional version) for the approximating minimizers, we obtain properties which, taking the limit (in a suitable sense), allow us to derive the desired necessary conditions. The most difficult part in our proof is to show the maximality condition: this requires non-trivial consideration of multifunction representation and selection theorems. This part becomes simpler for the ‘purely atomic’ case and the ‘smooth’ case.
An important source of inspiration for the techniques here employed is represented by Vinter’s paper [18] (which is devoted to minimax optimal control but, in fact, contains flexible and effective analytical tools that can be extended or adapted to our case). As one may expect, the necessary conditions that we obtain differ from those ones in the minimax context (in particular for the general nonsmooth case and the purely atomic case), for the nature of the minimization criterion is different. For instance, for the general (nonsmooth) case the most evident difference with respect to the costate arcs characterization given in [18] is that (avoiding a formulation which might involve somewhat complicate sets) we show that the ‘expected’ adjoint system and transversality conditions are satisfied by a family of costate arcs ’s, at least when the parameter belongs to a countable dense set . We highlight that an important feature of our paper is the unrestrictive nature of our assumptions: indeed, we allow not only nonsmooth data (on the dynamics, the cost function and the averaged right end-point constraint), but we also provide results for unknown parameters belonging to a mere complete separable metric space . This aspect is particularly relevant for applications (cf. [15]) where (and the support of the reference measure ) need not to be compact. Our techniques could be used to generalize the conditions in [18] and might provide some insights into dealing with adverse/conflicting control problems with non-compact parameter sets (in [20] and [21] parameter sets are assumed to be compact.)
Notation Let be a metric space. Denote by the -algebra of Borel sets in . A probability measure on the measurable space takes non-negative values, verifies the -additivity property and is such that . The family of all probability measures on is denoted by . Recall that a sequence of measures in is said to converge weakly∗ to a measure (in symbol ), if for every bounded continuous function on . The support of a measure defined on is written supp(). denotes the Lebesgue subsets of , while are the Borel subsets of . (respectively ) is the product algebra of and (respectively , and ). The Euclidean norm is written . We shall employ the following norm on : . We write the limiting subdifferential of the (possibly extended valued) function at If , then is the partial limiting subdifferential with respect to the variable . is the closed unit ball in Euclidean space. is the limiting normal cone of a closed set at a point , and . (We refer the reader to [4], [9], [10], and [19] and the references therein for these nonsmooth analytical tools.)
2 Average on measures with finite support
We start considering the particular and simple case of optimal control problems of the form (LABEL:intprob), where the probability measure of the integral functional has a finite support: it is a convex combination of unit Dirac measures. This constitutes also a preliminary step to derive necessary conditions for the general case.
The following assumptions will be needed throughout this section. For a given local minimizer and for some , we shall suppose:
-
(H1)
-
(i)
The function is measurable for each 2. (ii)
The multifunction has nonempty values, and is a measurable set. 2. (H2)
There exists a measurable function such that is integrable, and for each ,
[TABLE]
for all , , a.e. . 3. (H3)
The function is Lipschitz continuous on for all .
Proposition 2.1**.**
Let be a local minimizer for (LABEL:intprob). Assume that is a given probability measure with finite support and that for some , hypotheses (H1)-(H3) are satisfied. Then, there exist a family of arcs and a number such that
- (a)
* for all ;* 2. (b)
** 3. (c)
* for ;* 4. (d)
* for .*
Proof.
The measure can be written as a convex combination of Dirac measures at points , for , where is a suitable integer, as follows:
[TABLE]
As a consequence the integral functional to minimize (LABEL:intprob) reduces to the following finite sum:
[TABLE]
and, the minimization problem (LABEL:intprob) turns out to be easily treated, for it can be equivalently written as a standard optimal control problem:
[TABLE]
Observe that in writing (), we can restrict attention only to elements belonging to the . Under the stated assumptions (H1)-(H3) and using the sum rule (cf. [19, Theorem 5.4.1]), the necessary conditions for () can be derived from the nonsmooth maximum principle [19, Theorem 6.2.1] which guarantees the existence of a multiplier and arcs , for such that
- (i)
; 2. (ii)
for all ; 3. (iii)
for all ; 4. (iv)
a.e. .
For each , we set
[TABLE]
We deduce, therefore, conditions (a)-(d) of the proposition statement. This concludes the proof.
∎
3 Main results
We take now a probability space where is a (general) probability measure. For a given local minimizer and for some , we shall suppose:
- (A1)
is a complete separable metric space. 2. (A2)
- (i)
The function is measurable for each . 2. (ii)
The multifunction has nonempty values and is a measurable set. 3. (iii)
The set is closed for all , and 3. (A3)
There exist a constant and an integrable function such that
[TABLE]
for all , , a.e. . 4. (A4)
- (i)
The function is measurable. 2. (ii)
There exist positive constants and such that for all we have and for all , for all 3. (iii)
There exists a modulus of continuity such that for all and we have
[TABLE]
and
[TABLE] 5. (A5)
There exists a modulus of continuity such that for all ,
[TABLE]
(We say that is a modulus of continuity if is increasing and )
The first result provides necessary optimality conditions for the general nonsmooth case.
Theorem 3.1**.**
Let be a local minimizer for (LABEL:intprob) in which is given. Assume that, for some , hypotheses (A1)-(A5) are satisfied. Then, there exist , a measurable function and a countable dense subset of supp such that
- (i)
* for all * 2. (ii)
** 3. (iii)
* for all where *
[TABLE]
Moreover, we consider two special cases in which condition (iii) becomes much simpler and the desired properties involving the costate arcs extend to the whole : when the measure is purely atomic, and the smooth right end-point free case.
Theorem 3.2** (Purely atomic case).**
Let be a local minimizer for (LABEL:intprob) in which is a purely atomic measure such that each atom is a singleton. Assume that, for some , hypotheses (A1)-(A5) are satisfied. Then, there exist , a measurable function and a (at most) countable set supp such that
- (i)
* for all * 2. (ii)
** 3. (iii)
, and for all supp
[TABLE]
Theorem 3.3** (Smooth case).**
Let be a local minimizer for (LABEL:intprob) where is given. Suppose that, for some , hypotheses (A1)-(A3), (A4)(i) and (A5) are satisfied. In addition, assume that
- (C1)
* is differentiable on , for each , and is continuous;* 2. (C2)
* is continuously differentiable on for all and a.e. , and is uniformly continuous with respect to * 3. (C3)
.
Then, there exists a measurable function such that
- (i)′
* for all supp; * 2. (ii)′
** 3. (iii)′
* a.e. , for all supp*; 4. (iv)′
* for all supp.*
Comments
Condition (iii) of Theorem 3.1 is interpreted in the following sense: for each , one considers functions (such that is uniformly bounded by a constant) satisfying the adjoint system
[TABLE]
and the transversality condition
[TABLE]
Then, from this set of functions, one takes into account only the ’s such that
[TABLE]
to generate the family of arcs sets of .
In optimal control theory, necessary optimality conditions results are usually provided avoiding the ‘trivial’ case, which is given by the couple , where is the multiplier associated with the cost. However, in literature dealing with optimal control problems with unknown parameters in the non-smooth context, results are often written including possible trivial cases which are not considered so relevant for the general properties expressed in the results statement; cf. [18] on nonsmooth minimax problems and [21] on nonsmooth adverse problems, in which the operator ‘’ (convexifying over sets of costate arcs) is considered possibly bringing trivial cases. (The fact that in [18] and [21] the multiplier associated with the cost does not appear in the necessary conditions should not be so surprising: this multiplier is somewhat hidden in the analysis and, in these contexts, the situation ‘’ alone might be considered as ‘trivial’). In our case, we might have a trivial couple which satisfies the conditions of Theorem 3.1, indeed, employing the convexification operator ‘’ on the set of costate arcs, it may happen that, taking , even if , with , also is an admissible costate arc; convexifying, . We decided to be consistent with part of previous (nonsmooth) literature on problems with unknown parameters and provide a general nonsmooth result (Theorem 3.1), which allows (in some particular circumstances) a trivial case, but at the same time covers a number of non-restrictive non-trivial cases. For instance, (iii) of Theorem 3.1 immediately implies a non-triviality condition for the pair when
- (a)
the right end-point constraints are absent (); 2. (b)
the given measure has a nonatomic component, the averaged right end-point constraints
[TABLE]
are imposed but the normal cone to the end-point constraint is pointed for all (or even for belonging to a countable dense subset of the support of the nonatomic component of ). We recall that a convex cone is said to be ‘pointed’ if for any nonzero elements .
Concerning (b), the abnormal situation (i.e. ) is admissible, but the fact that is pointed ensures that for all .
The ‘degeneracy issue’ (i.e. the necessary conditions are satisfied by any control) is a longstanding issue which has been widely investigated in optimal control. It is well-known that this issue may arise, for instance, in presence of state constraints for ‘standard’ (in the sense that parameters are absent) optimal control problems (cf. [19, Chapter X] and the references therein). Rather less is known for the case when unknown parameters intervene in the dynamics and the cost: minimax, adverse, and average optimal control problems. (See [11] for a non-degeneracy result on state constrained minimax problems avoiding the degeneracy caused by the state constraint; see also [18] for a link between minimax and state-constrained problems). In our context degeneracy might occur for the general nonsmooth case (Theorem 3.1) when the given measure has a nonatomic component. Indeed, our construction of the costate arcs for is based on a limit-taking procedure starting from the information provided by (non-trivial) costate arcs for (cf. (5.21) below). If has a nonatomic component, we have no reason to expect (under the general assumptions considered in Theorem 3.1) that the non-degenerate property of the costate arcs () always propagates on as desired: there might be some degenerate situations in which for a full-measure subset of the limit we take in the proof of Theorem 3.1 does not exist, and extends with the value zero on , obtaining a degeneracy issue. However, under some circumstances, the information provided on the set does propagate: if there is no right end-point constraint and, in addition, we impose regularity assumptions on the dynamics and the terminal cost function, properties (i) and (iii) of Theorem 3.1 extend to the whole parameter set , as stated in Theorem 3.3. Theorems 3.2 and 3.3 do provide non-degenerate results.
Nonsmooth results on optimal control problems with unknown parameters, such as adverse and minimax problems (see [21] and [18]), are concerned with a ‘degenerate issue’ which is not far from the one of our nonsmooth result Theorem 3.1, maybe, in a more ‘dramatic’ way, for the measure -appearing there as a multiplier in the necessary conditions- is not uniquely determined, and may have a support with degenerate effects on the necessary conditions. Consider for instance the simple example [18, Example 4.1] in the context of minimax problem:
[TABLE]
A minimax minimizer is: . In [18] there is a detailed discussion comparing [18, Proposition 2.1] (finite parameter sets case) and [18, Theorem 3.1] (general nonsmooth case), and the necessity of convexifying the set of costate arcs in the general nonsmooth case, for, otherwise, the necessary conditions would not be valid. In particular, in [18] the (Dirac) measure concentrated at (point at which the reference minimizer attains its maximum) is considered, for which “an arbitrary collection of functions such that ” satisfies the necessary conditions of [18, Theorem 3.1]. The counterpart of this choice is that it is degenerate: any control satisfies the necessary conditions of [18, Theorem 3.1].
One might go a little bit further in this direction, observing that degeneracy is -in fact- much more dramatic for this particular example: indeed, for any probability measure on the parameter set the maximality conditions of [18, Theorem 3.1] are necessarily degenerate for the reference minimax minimizer (and the trivial case is also admitted). On the other hand, if one is interested in the different performance criterion given by the average cost with the same dynamics, these dramatic issues of triviality and degeneracy disappear. (To see this, we can take, for instance, the average minimizer associated with the costate .)
At first glance our results might look similar to some statements on necessary conditions appearing in [20] and [21]. Not only these results do not cover the class of average cost minimization problems (in the sense of our paper), but we also highlight a crucial aspect concerning the completely different role of the measures entering in the picture of the necessary conditions: in Warga’s framework the existence of a positive Radon measure (on the set of ‘adverse’ relaxed controls) is a necessary condition, and this measure plays the role of a ‘multiplier’. In our context (of average control problems) the probability measure is a given datum, and we underline the fact that our objective is to give necessary conditions w.r.t. the given measure .
We finally observe that the construction of the countable set proposed in this paper could be useful for applications: it provides a constructive way to approximate the reference measure by means of a sequence of convex combinations of Dirac measures concentrated at points of . Therefore the set can be considered as a reference set of parameters ’s for which one starts computing the costate arcs and, eventually, derives conditions for optimal controls.
4 Preliminary results in measure theory
This section is devoted to display results which will be relevant for the proofs of Theorems 3.1, 3.2 and 3.3. We shall make repeatedly use of the following theorem (also referred to as Portmanteau Theorem, cf. [3, Theorem 4.5.1] or [14, Theorem 6.1. pp. 40]) which provides conditions characterizing the weak∗ convergence of probability measures on a metric space .
Theorem 4.1**.**
Let be a metric space. Take a sequence of measures in and a measure . The following conditions are equivalent:
- (a)
* for any bounded continuous function on (i.e. ) ;* 2. (b)
* for any bounded uniformly continuous function on ;* 3. (c)
* for every Borel set whose boundary has **measure zero. (Such sets are also referred to as *continuity sets) ; 4. (d)
* for every closed set in ;* 5. (e)
* for every open set in .*
We recall that is said to be tight if for each , there exists a compact set such that . A very well-known result asserts that when is a complete separable metric space, then every is tight (cf. [14, Theorem 3.2. pp. 29]). We shall invoke also a generalized version of the Prokhorov’s Theorem [5, Theorem 8.6.2] which provides a useful characterization of the relatively compact subsets of Borel measures on , when is a complete separable metric space. This result will be crucial to derive measure convergence properties (see Lemma 4.3 below).
Theorem 4.2** (Generalized Prokhorov Theorem).**
Let be a complete separable metric space and consider a family of Borel measures on . Then, is relatively compact if and only if is uniformly tight and uniformly bounded in the variation norm; in particular a sequence of measures admits a weakly∗ convergent subsequence if and only if the sequence is uniformly tight and uniformly bounded in the variation norm.
We consider now subsets and , for , of . We denote respectively by the multifunctions defined as
[TABLE]
Let be a weak∗ convergent sequence of measures in . Our aim is to justify the limit-taking of sequences like
[TABLE]
in which is a sequence of Borel measurable functions satisfying
[TABLE]
The required convergence result is provided by Lemma 4.3 below, which represents an extension of [19, Proposition 9.2.1] and [18, Proposition 6.1] to the case in which is an arbitrary complete separable metric space (not necessarily compact).
Lemma 4.3**.**
Let be a complete separable metric space. Consider a sequence of measures in such that for some , a sequence of sets such that
[TABLE]
for some closed set , and a sequence of Borel functions. Suppose that
- (i)
* is convex for each ;* 2. (ii)
the multifunctions and , for all , are uniformly bounded; 3. (iii)
for each ,
Define, for each , the vector of signed measures . Then, along a subsequence, we have
[TABLE]
where is a vector-valued Borel measure on such that
[TABLE]
for some Borel measurable function satisfying
[TABLE]
(The upper limit in (4.1) above must be understood in the Kuratowski sense, cf. [4] or [19].)
Proof.
Since is a complete separable metric space, the sequence turns out to be uniformly tight as result of Theorem 4.2. We also know that a.e. and is uniformly bounded for all . It follows that there exists a constant such that
[TABLE]
For each , the vector-valued measure can be expressed as . From the tightness of and (4.2), it immediately follows that, for all , is a family of uniformly tight, possibly signed measures. Therefore according to Theorem 4.2, for each one can extract a subsequence (we do not relabel) which converges weakly∗ to some . We show that is absolutely continuous with respect to . Let and be the Jordan decompositions of and , where and are respectively the weak∗ limits of and . Let be the common family of continuity sets (in the sense of (c) of Theorem 4.1) for the measures , and . Take any Borel set in , we have
[TABLE]
But since generates all the Borel sets of (cf. [12, Chapter 7, Appendix]), it follows that is absolutely continuous with respect to . Therefore, by the Radon-Nikodym Theorem, there exists a -valued, Borel measurable and -integrable function on such that for any Borel subset of we have
[TABLE]
equivalently,
[TABLE]
It remains to show that a.e. For all fixed, following the approach suggested in [19, Proposition 9.2.1], we define . We fix . Since is uniformly bounded and is closed, the multifunction is upper semicontinuous. Then, for large enough, the marginal function defined by
[TABLE]
turns out to be upper semicontinuous and bounded on , owing to the Maximum Theorem (cf. [4, Theorem 1.4.16]). From standard results on semicontinuous maps (cf. [3, A6.6]), there exists a sequence of bounded continuous functions such that:
[TABLE]
Recalling that the sets and for are uniformly bounded, and owing to (4.1), we have that, for all , there exists such that for all , Then for and for any Borel subset of , for all , we have
[TABLE]
The last inequality is a consequence of (4.3). Before passing to the limit, we observe that
[TABLE]
Indeed, take any open set . Since for sufficiently large, and for all , from (e) of Theorem 4.1, we have
[TABLE]
We deduce that for all . Following the same reasoning, one can conclude that for all . Hence, for all open subsets and . The inclusion (4.5) is therefore proved. By passing to the limit in (4) as , since is bounded continuous on , we obtain for any Borel set
[TABLE]
As , for any , we have
[TABLE]
Recalling that generates the Borel algebra , we deduce that (4.6) is actually valid for all Borel subsets of . As a consequence, and letting , we obtain
[TABLE]
Inequality (4.7) holds for all with . (Indeed, from the continuity of the map , it is enough to establish inequality (4.7) for , and subsequently use the density of in .)
Since is a closed and convex set, for each , invoking the Hahn-Banach separation theorem, we obtain that
[TABLE]
Taking the limit as , we deduce that a.e. which concludes the proof.
∎
5 Proofs of Theorem 3.1, Theorem 3.2 and Theorem 3.3
We first employ a standard hypotheses reduction argument establishing that we can, without loss of generality, replace assumptions (A3)-(A5) by the stronger conditions in which (i.e. the conditions are satisfied globally).
- (A3)′
There exist a constant and an integrable function such that
[TABLE]
for all 2. (A4)′
- (i)
There exist positive constants and such that for all
and for all , for all 2. (ii)
There exists a modulus of continuity such that we have
[TABLE]
and
[TABLE]
for all and . 3. (A5)′
There exists a modulus of continuity such that for all ,
[TABLE]
This is possible if we consider the “truncation” function , defined to be
[TABLE]
and we replace and above by their local expression , and defined as follows
[TABLE]
Indeed, the problems involving the functions and do coincide in a neighbourhood of the local minimizer for (LABEL:intprob). Therefore, does remain a local minimizer for the problem (LABEL:intprob) when we substitute the pair with . Furthermore, the assertions of the theorem are unaffected by changing the data in this way.
We provide two technical lemmas which will be employed in the approximation techniques used in the theorems proof. These preliminary results establish the uniform continuity of trajectories with respect to and the existence of a sequence of suitable finite support measures approximating the reference measure . Throughout this section, denotes the Ekeland metric defined on the control set as
[TABLE]
We recall that, given a control , to make clearer which control is used we shall employ the alternative notation for the feasible arc belonging to the family of trajectories associated with the control .
Lemma 5.1**.**
Let be a metric space. Suppose that assumptions (A2)(i)-(ii), LABEL:A2'_nco_general_case and LABEL:A5'_nco_general_case are satisfied. Then,
- (i)
we can find such that
[TABLE]
for all . 2. (ii)
for all , we can find , such that for any given ,
[TABLE]
Proof.
(i) Write
[TABLE]
Fix any . Take any . Owing to Filippov Existence Theorem [19, Theorem 2.4.3] (recall that we have the same initial datum ), for each , we obtain
[TABLE]
The last inequality is a consequence of the bound on the dynamic (assumption LABEL:A2'_nco_general_case). The particular choice allows to conclude.
(ii) Fix now any . Take a control . Owing to assumption LABEL:A5'_nco_general_case, we choose such that
[TABLE]
Take such that Taking two different trajectories and with the same initial point and the same control , for all we have,
[TABLE]
Taking into account assumptions LABEL:A2'_nco_general_case and LABEL:A5'_nco_general_case, we conclude that
[TABLE]
Applying Gronwall Lemma, for all , we deduce
[TABLE]
The particular choice of as in (5.2) and the fact that allow to conclude the proof.
∎
Lemma 5.2**.**
Suppose that conditions (A1), (A2)(i)-(ii), LABEL:A2'_nco_general_case-LABEL:A5'_nco_general_case are satisfied, and . Then, there exist a sequence of finite subsets of , and a sequence of convex combinations of Dirac measures , such that the following properties are satisfied.
- (i)
* for all integer , and is a countable dense subset of ;* 2. (ii)
, where and , and ; 3. (iii)
for each , we can find such that for all ,
[TABLE]
and
[TABLE]
for all .
Moreover, if the measure has a purely atomic component such that each atom is a singleton, then the countable set can be constructed in such a manner that contains all the atoms of .
Proof.
(i). Since is a complete separable metric space, the measure is tight. As a consequence, for all integer , there exists a compact set such that Write . Therefore, employing an iterative argument, a suitable choice of the compact set allows us to obtain, for each , a family of disjoint Borel subsets , for some , such that the following conditions are satisfied:
- (a)
; 2. (b)
for each , , and diam. (Recall that diam.) 3. (c)
and .
We can also choose elements , for all , in such a manner that we have . If is compact, then we can always assume that for all integer . In this case, we can relabel the elements chosen in the Borel sets ’s, taking
[TABLE]
and we replace with . In any case, we obtain, for each , a finite set such that . From the standard properties of complete separable metric spaces, it is easy to see that the sequence of sets can be constructed in such a way that is (countable) dense in .
(ii). We assume here that is not compact (the compact case can be treated in a similar and easier way). Consider, for each , the family of Borel disjoint subsets of , and the finite sequence of elements , with , provided in the proof of (i). We define the measure
[TABLE]
Owing to Theorem 4.1, we can check the weak∗ convergence of the sequence on the set of bounded real valued uniformly continuous functions on (instead of the set of bounded continuous functions). Take any bounded uniformly continuous function . Write . Fix any . Then, there exists such that
[TABLE]
Let such that . Then for all , we have
[TABLE]
For each , we define
[TABLE]
Therefore, we can find such that
[TABLE]
Then for all , using also (5.4) and the fact that , it follows that
[TABLE]
As a consequence, for all , from (5.5) we deduce that
[TABLE]
Then, from inequality (5.6) and the choice of , for all , we obtain
[TABLE]
Setting , for , we conclude the proof of (ii).
(iii). Fix any . Choose such that
[TABLE]
Take any such that . Then, from assumption 0(A4)′(ii)
[TABLE]
Take any . From Lemma 5.1(ii), there exists such that for all verifying , we have
[TABLE]
Write . For all verifying , from assumption 0(A4)′(i), we deduce
[TABLE]
Similarly, . Therefore, for each , the maps and are uniformly continuous, and from LABEL:A4'_nco_general_case (uniformly) bounded by the constant (observe that and above do not depend on ). Invoking the same argument employed in the proof of (ii) we conclude that, whenever we fix , we can find such that for all , we have
[TABLE]
and
[TABLE]
This confirms property (iii).
Finally, if the measure has a purely atomic component such that each atom is a singleton, then at each step of the iterative argument employed in (i), the compact set , for all , is such that it contains a finite number of atoms of which will be included in .
∎
Proof of Theorem 3.1. The proof is build up in four parts. The first part consists in approximating the reference problem with a given probability measure by an auxiliary problem which involves measures with finite support. This is possible invoking the result on the weak∗ convergence established in Lemma 5.2 and the Ekeland’s variational Principle. In the second part, we apply necessary optimality conditions (cf. Proposition 2.1 previously obtained) for the auxiliary problem. In the third part, we pass to the limit a first time to obtain optimality conditions on a countable dense subset of supp. The last part of the proof is devoted to deriving, via a second limit-taking process, all the desired necessary conditions of the theorem statement. Since it is not restrictive to assume that supp, we shall consider this assumption throughout the proof. 1. Take a local minimizer for problem (LABEL:intprob). Then there exists such that
[TABLE]
for all feasible processes such that
[TABLE]
Take a decreasing sequence such that for all , where is the number provided by Lemma 5.1. For each , we define the functional as follows:
[TABLE]
It is clear that , for all controls . Moreover, we have for all controls , where
[TABLE]
Otherwise, there would exist such that , contradicting the fact that is a local minimizer for (P). Observe also that
[TABLE]
which means that is an minimizer for on . Then, since is a continuous function on the complete metric space (it suffices to use here the Lipschitz continuity of and and Lemma 5.1(i)), we deduce from Ekeland’s Theorem (cf. [19, Theorem 3.3.1]) that, for each , there exists such that
[TABLE]
[TABLE]
Consider the sequence of convex combinations of Dirac measures provided by Lemma 5.2. Recall, in particular, that and
[TABLE]
where , for all and . We can find a decreasing sequence , with for all , and an increasing sequence such that, setting
[TABLE]
(we write , for the corresponding convex combination of Dirac measures which approximate , and , , so that ), we have
[TABLE]
and
[TABLE]
Therefore, is a minimizer on for
[TABLE]
Invoking Ekeland’s theorem one more time, we deduce that there exists which minimizes
[TABLE]
such that . As a consequence we obtain
[TABLE]
Write the process associated with the control . Therefore, from Lemma 5.1 (i) we have that
[TABLE]
Bearing in mind (5.9) it immediately follows that .
Now we introduce two measurable functions
[TABLE]
Therefore we can write:
[TABLE]
The minimizing property (5.10) can be expressed in terms of the following auxiliary optimal control problem
[TABLE]
whose minimizer is the family verifying, as , and
[TABLE]
2. The second step of the proof consists in applying necessary optimality conditions (cf. Proposition 2.1) to problem (Pi) for each sufficiently large: for all (that is for a.e. ), there exist arcs (associated with the state variable ), (associated with the variable ), and (associated with the variable ) such that
[TABLE]
and satisfying the necessary conditions below:
The transversality condition (owing to the Max Rule [19, Theorem 5.5.2]), for suitable , leads to
[TABLE]
(Here, , for .) The adjoint system gives and , which implies that and Moreover,
[TABLE]
From the maximality condition, we obtain, for a.e.
[TABLE]
This implies that for a.e. and for every
[TABLE]
From (5.11) we deduce that
[TABLE]
Moreover, taking note of the fact that and, owing to Lemma 5.1 (i), we can also deduce that
[TABLE]
Therefore, for each , and a.e. , from the optimality conditions (5.14)-(5.17), we have
- (a1)
; 2. (a2)
for all ; 3. (a3)
4. (a4)
for all and for any
Following the idea of Proposition 2.1, and dividing each term of the family of the costate arcs across by the corresponding coefficient (without relabelling), we obtain that for each large enough and a.e. ,
- (a1)′
; 2. (a2)′
for all ; 3. (a3)′
4. (a4)′
for all and for any
3. We derive now consequences of the limit-taking for conditions (a1)′-(a3)′ of the previous step. Recall that from Lemma 5.2, we have a countable dense subset of , such that where provides an increasing sequence of finite subsets of : . Since is a countable set, we can write it as the collection of the elements of a sequence such that
[TABLE]
Fix . When we take , two possible cases may occur: either for the fixed ; or . In the first case, it means that there exists such that and the corresponding adjoint arc satisfies conditions (a1)′-(a4)′. So, we can define the arc as follows:
[TABLE]
Therefore, by iterating on , associated with each , we can construct a sequence of families of arcs . Observe that there exists always such that, for all , is an adjoint arc for which (a1)′-(a4)′ hold true. From (a3)′ and (A4)′ it immediately follows that the sequence is uniformly bounded by . On the other hand (a2)′ and (A3)′ imply that are uniformly integrably bounded. Then, the hypotheses are satisfied under which the Compactness Theorem [19, Theorem 2.5.3] is applicable to
[TABLE]
We conclude that, along some subsequence (we do not relabel),
[TABLE]
for some which satisfies (for the fixed )
[TABLE]
We can also take the subsequence in such a manner that converges to some . Moreover, from the closure of the graph of the limiting subdifferential and the normal cone (seen as multifunctions), we have that
[TABLE]
But is a countable set. Then, we can repeat the similar analysis for each , taking into account the subsequence obtained for the previous element . As a consequence, we have a collection of subsequences verifying the convergence properties (5.19) to a collection of adjoint arcs which satisfies, for all
[TABLE]
and
[TABLE]
Furthermore, since for all , is measurable, we obtain that its limit is also measurable. The final step is represented by the extension of to a measurable function on which satisfies conditions (5.20) and (5.22) below when restricted to . This can be done as follows. Writing explicitly the coordinates of , for each , we have the decomposition into the positive and negative parts: . Consider a sequence of simple functions (for ) which approximates from below : . Let be the simple function which provides an extension of to . Then, define
[TABLE]
Then, we obtain the desired extension setting and . Clearly we have the following transversality condition:
[TABLE]
Finally, we derive a non-triviality condition for . This is immediate if the , so we continue examining the case in which . Choose such that for all , . In particular, for all , from the Max Rule we have , and using the fact that , it follows that
[TABLE]
Then there exists and such that and
[TABLE]
Recalling that is the Lipschitz constant of , we have
[TABLE]
And from the choice of , we obtain that
[TABLE]
and so
[TABLE]
We deduce that
[TABLE]
In any case, we obtain the non-triviality condition
[TABLE]
4. In the last part of the proof, we want to use also the information contained in the maximality condition (a4)′ (or in its alternative version (5.17)) as . This task requires to use Castaing’s Representation Theorem (cf. [8, Theorem III.7], the Aumann’s Measurable Selection Theorem (cf. [8, Theorem III.22]), and Lemma 4.3 which has a central role for the limit-taking of all the necessary conditions obtained in Step 2 at the same time. Write
[TABLE]
Owing to assumption (A2) and the Lipschitz continuity of , we obtain that is a measurable with closed values. Using the Castaing’s Representation Theorem, we know that there exists a countable family of measurable functions , such that
[TABLE]
in which is a set of full-measure. We can also assume that . For all , define the multifunction
[TABLE]
The graph of is a measurable set. Indeed, we have
[TABLE]
which is the union of two measurable sets. Now invoking Aumann’s Measurable Selection Theorem, we deduce that has a measurable selection .
Let now be a countable and dense subset of . Consider the sequence of intervals having extrema in . We construct now a further countable family of controls as follows
[TABLE]
Writing , in such a manner that (up to a reordering) , we obtain
[TABLE]
Following an effective technique proposed by Vinter [18], for a fixed integer , we introduce the operators and on (linear with respect to their first variable): for , we set
[TABLE]
and, for all integers ,
[TABLE]
Define also the subsets , for all , and of as follows:
[TABLE]
where is the increasing sequence of (finite) subsets introduced in Step 3 (cf. Lemma 5.2), and
[TABLE]
in which . The set is written
[TABLE]
where is the countable dense subset of ( in our assumptions) provided by Lemma 5.2 and
[TABLE]
Now, we define the multifunctions , for , and on , taking values in the subsets of as follow:
[TABLE]
The multifunctions and , for all , are uniformly bounded. The necessary optimality conditions (a1)′-(a3)′ corresponding to the auxiliary problem (Pi) of Step 2 guarantee that the set is non-empty : indeed there exist measurable functions such that a.e. and so
[TABLE]
Moreover, the linearity of the operator with respect to the first variable and the convexity of the set guarantee the convexity of the set for each . It follows that hypotheses (i)-(iii) of Lemma 4.3 are satisfied. We claim that
[TABLE]
Indeed, take any . From the definition of the limsup in the Kuratowski sense, there exists a subsequence and such that
[TABLE]
We shall show that . Since , there exists a sequence of measurable functions such that for all . From the analysis of Step 3, we have established the existence of a map on which is measurable, verifying conditions (5.20), (5.22), and (5.24) for all . Moreover, the uniform convergence of , Lemma 5.1 and assumption LABEL:A2'_nco_general_case guarantee that, for and for all ,
[TABLE]
converges, as , to
[TABLE]
Therefore, and the claim is confirmed. Consequently, all required hypotheses of Lemma 4.3 are satisfied for where for ,
[TABLE]
which is measurable. Defining, for each , the vector-valued measure , and applying Lemma 4.3, we obtain, along a subsequence (we do not relabel) where is a vector-valued Borel measure on such that , for some Borel measurable function satisfying
[TABLE]
In addition, from the definition of the set (associated with each ), there exists a measurable function such that for all , and \gamma(\omega):=\big{(}\Psi_{k}(p_{K}(.,\omega),\omega)\big{)}_{k=1,\ldots,K} verifying
[TABLE]
In other terms, for each
[TABLE]
The maximality condition (a4)′ of Step 2, after inserting , gives
[TABLE]
Since in (5.28) the integrand function is measurable, and the integral function is measurable, making use of Fubini-Tonelli, we obtain
[TABLE]
Therefore, letting and invoking (5), we have that
[TABLE]
For each , the map can be interpreted as a measurable element of the a.e. equivalence class in the Hilbert space
[TABLE]
endowed with the inner product
[TABLE]
Now consider to be the set of measurable functions of defined on such that for all :
[TABLE]
Note that is nonempty since for all . Moreover, it is a straightforward task to prove that is a closed and convex subset in (owing to the convexity and the closure of the set for all ). Therefore, is weakly closed, as well. Moreover, the sequence is (uniformly) bounded, w.r.t. the norm induced by \big{<}.,.\big{>}_{\mu} because it belongs to the bounded set for all . By subsequence extraction (without relabelling), there exists a weakly convergent subsequence to for some . The weak convergence in the Hilbert space (\mathcal{H},\big{<}.,.\big{>}_{\mu}), employed in inequality (5.29), implies that
[TABLE]
We observe that condition (5.26) yields the following inclusion for all
[TABLE]
where is a set of full measure in . Define now the set , still of full measure in , containing the Lebesgue points for the map defined as
[TABLE]
for all . Take any and . Owing to (5.31), there exists a subsequence such that
[TABLE]
In other words, for a sequence (possibly taking a subsequence of ), we have
[TABLE]
For the Lebesgue point , we can also consider a sequence of intervals , having extrema in a countable dense set of (in the sense of (5.25)) and such that and . Recalling the definition (5.25) of and replacing in (5.30) by on , and by on , using Fubini-Tonelli (since the integrand is measurable) and dividing across by , we obtain
[TABLE]
Since is a Lebesgue point for the map , we deduce
[TABLE]
Therefore, owing to (5.32)-(5), we have
[TABLE]
for any and any . We conclude that
[TABLE]
for any and for all , a set of full measure in . Therefore, now all the assertions stated in Theorem 3.1 are confirmed (included the maximality condition (ii)), which completes the proof. ∎
Proof of Theorem 3.2. A purely atomic measure has necessarily at most a countable support. We can therefore choose in such a manner that . The properties (i) and (iii) follow immediately considering Steps 1, 2 and 3 of Theorem 3.1 proof and the obtained costate arc . On the other hand, the maximality condition (ii) can be deduced by contradiction, avoiding any use of the technical procedure of Step 4 of Theorem 3.1 proof which requires the construction of appropriate multifunctions and the use of selection theorems. We provide here the details of this ‘new step 4’ which allows to obtain (ii).
Consider the function
[TABLE]
Using a standard argument, one can easily show that
[TABLE]
Therefore, setting, for
[TABLE]
we have that is a measurable set. Define
[TABLE]
Then is an increasing sequence of measurable sets. Consider the following measurable set
[TABLE]
and denote by the section of , i.e.
[TABLE]
Then, .
Now assume, by contradiction, that (ii) of Theorem 3.2 is violated. Therefore, meas. Write Since, , there exists such that for all . Therefore, for all , there exists such that . Take such that
[TABLE]
(here is the upper bound for (see (A3)′) and is an upper bound for ), and
[TABLE]
(Recall that is the number provided by Lemma 5.1 (i) and is the decreasing sequence appearing in Step 2 of the proof of Theorem 3.1.)
For all and for all , we have
[TABLE]
Condition (a4)′ established in Step 2 of Theorem 3.1 proof implies that the first term on the right-hand side of (5) satisfies
[TABLE]
Concerning the second term on the right-hand side of (5) we make use of the boundedness of and , and the estimate (5.12): we obtain
[TABLE]
Take large enough such that for all
[TABLE]
Therefore, owing to the choice made in (5.35), we have . Then, from (5), we obtain that
[TABLE]
By integrating over the measurable set , taking into account that and meas, we arrive at
[TABLE]
a contradiction. Therefore, also the maximality condition (ii) of Theorem 3.2 holds true.
∎
Proof of Theorem 3.3. A scrutiny of Theorem 3.1 proof reveals that Steps 1, 2 and 3 are applicable providing a simplified result. Indeed, taking into account hypotheses (C1)-(C2) on and , we obtain a family of costate arcs , for ( is a countable dense subset of ), satisfying the properties listed at the end of the Step 3 of the proof of Theorem 3.1, where (5.20) and (5.22) read now as
[TABLE]
and
[TABLE]
for all . Notice, that the multiplier cannot take the value [math], for otherwise we would obtain a contradiction with the nontriviality condition. Then, normalizing we can take .
We claim now that we can extend in a unique way the family of arcs , for , to a measurable function such that for all we have:
- (i)′′
; 2. (ii)′′
a.e. ; 3. (iii)′′
.
Indeed, take any . If we set . So we continue the analysis considering the case . Then, since is dense in , there exists a sequence converging to . Assumptions LABEL:A2'_nco_general_case and LABEL:A4'_nco_general_case guarantee that a.e. and . From (5.38) we deduce that is uniformly integrally bounded, and (5.39) guarantees that . Then, by a standard compactness argument, taking a subsequence (we do not relabel), there exists such that
[TABLE]
[TABLE]
and
[TABLE]
[TABLE]
(The last two equalities are a consequence of Lemma 5.1 (ii).)
This, being true for any sequence converging to , since the limit arc satisfies the same conditions (5.40)-(5.41), we conclude that we can extend the family of arcs simply taking the limit:
[TABLE]
confirming the claim above. It remains to prove the Weierstrass condition (ii)′. We follow exactly the same analysis of Step 4 of Theorem 3.1 proof, taking now the simplified version of the definition of the set in which we take into account the regularity of functions and , the fact that and we do not have end-point constraints:
[TABLE]
where now, we set
[TABLE]
The uniqueness of solutions to systems appearing in allows to conclude.
∎
Acknowledgements. The authors are thankful to Richard B. Vinter for his suggestion to study necessary conditions for average cost optimal control problems, and to the referees for their many helpful comments.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] J. Ackermann, Robust Control: the Parameter Space Approach , Springer Science & Business Media, 2012.
- 2[2] A. Agrachev, Y. Baryshnikov and A. Sarychev, Ensemble controllability by Lie algebraic methods, ESAIM: Control, Optimisation and Calculus of Variations , 22.4 (2016), 921–938.
- 3[3] R. B. Ash, Measure, Integration, and Functional Analysis , Academic Press, 2014.
- 4[4] J-P. Aubin and H. Frankowska, Set-Valued Analysis , Springer Science & Business Media, 2009.
- 5[5] V. I. Bogachev, Measure Theory , Springer Science & Business Media, 2007.
- 6[6] V. G. Boltyanskii and A. S. Poznyak, The Robust Maximum Principle: Theory and Applications , Birkhauser. New York, 2012.
- 7[7] J-B. Caillau, M. Cerf, A. Sassi, E. Trélat and H. Zidani, Solving chance constrained optimal control problems in aerospace via Kernel Density Estimation, Optimal Control Applications and Methods , 39.5 (2018), 1833–1858.
- 8[8] C. Castaing and M. Valadier, Convex Analysis and Measurable Multifunctions , Springer, 2006.
