Stability analysis of stochastic fractional-order competitive neural networks with leakage delay

1.   Introduction

In this paper we establish and prove two new sufficiency theorems for weak and strong minima for an optimal control problem of Lagrange with fixed end-points, nonlinear dynamics, nonlinear isoperimetric inequality and equality constraints and pointwise mixed nonlinear time-state-control inequality and equality restrictions. The proof of the sufficiency theorems is independent of classical methods used to obtain sufficiency in optimal control problems of this type, see for example ^[32], where the insertion of the original optimal control problem in a Banach space is a fundamental component in order to obtain the corresponding sufficiency theory; ^[16], where the construction of a bounded solution of a matrix Riccati equation is crucial in this sufficiency approach; or ^[8,19], where a verification function and a quadratic function satisfying a Hamilton-Jacobi inequality is an indispensable tool in the sufficiency treatments of these theories. Concretely, the sufficiency theorems of this article state that if an admissible process satisfies a first order sufficient condition related with Pontryagin maximum principle, a similar hypothesis of the necessary Legendre-Clebsch condition, the positivity of a quadratic integral on the cone of critical directions, and several conditions of Weierstrass of some functions, where one of them plays a similar role to the Hamiltonian of the problem, then, the previously mentioned admissible process is a strict local minimum. The set of active indices of the corresponding mixed time-state-control inequality constraints must be piecewise constant on the underlying time interval of consideration, the Lagrange multipliers of the inequality constraints must be nonnegative and in fact they have to be zero whenever the associated index of the Lagrange multiplier is inactive. Additionally, the proposed optimal controls need not be continuous on the underlying interval of time but only measurable, see for example ^{[7,8,9,13,14,15,16,17,18,19,21,22,25,26,27,29,32]}, where the continuity of the proposed optimal control is a crucial assumption in some sufficiency optimal control theories having the same degree of generality as the problems studied in this article. In contrast, in Examples 2.3 and 2.4, we show how two purely measurable optimal controls comprised with the proposed optimal processes satisfy all the hypotheses of Theorems 2.1 and 2.2 becoming in this way strict local minima.

Additionally, it is worth mentioning that in these new sufficiency theorems for local minima presented in this paper, all the premises that must be satisfied by an admissible process to become an optimal process, are imposed in the hypotheses established in the theorems, in contrast, with other second order necessary and sufficiency theories which depend upon the verifiability of some preliminary assumptions, see for example ^{[2,3,5,6,11,24]}, where the necessary second order conditions for optimality depend on some previous hypotheses involving the full rankness of a matrix whose nature arises from the linear independence of vectors whose role are the gradients of the active inequality and equality constraints and where further assumptions involving some notions of regularity or normality of a solution are fundamental hypotheses; or ^[28], where the corresponding sufficiency theory for optimality depends upon the existence of a continuous function dominating the norm of one of the partial derivatives of the dynamic of the problem. Another remarkable feature presented in this theory concerns the fact that our sufficiency treatment not only provides sufficient conditions for strict local minima but they allow measuring the deviation between admissible costs and optimal costs. This deviation involves a functional playing the role of the square of a norm of the Banach space $L^1$, see for example ^[1,23], where similar estimations of the growth of the objective functional around the optimal control are established.

On the other hand, it is worth pointing out the existence of some recent optimal control theories which also study optimal control problems with functional inequality or equality restrictions such as the isoperimetric constraints of this paper. Concretely, in ^[20], necessary optimality conditions for a Mayer optimal control problem involving semilinear unbounded evolution inclusions and inequality and equality Lipschitzian restrictions are obtained by constructing a sequence of discrete approximations and proving that the optimal solutions of discrete approximations converge uniformly to a given optimal process for the primary continuous-time problem. In ^[12], necessary and sufficient optimality conditions of Mayer optimal control problems involving differential inclusions and functional inequality constraints are presented and the authors study Mayer optimal control problems with higher order differential inclusions and inequality functional constraints. The necessary conditions for optimality obtained in ^[12], are important generalizations of associated problems for a first order differential inclusions of optimality settings established in ^[4,10,20]. The sufficiency conditions obtained in ^[12] include second order discrete inclusions with inequality end-point constraints. The use of convex and nonsmooth analysis plays a crucial role in this related sufficiency treatment. Moreover, one of the fundamental novelties of the work provided in ^[12] concerns the derivation of sufficient optimality conditions for Mayer optimal control problems having $m$-th order ordinary differential inclusions with $m\ge3$.

The paper is organized as follows. In Section 2, we pose the problem we shall deal with together with some basic definitions, the statement of the main results and two examples illustrating the sufficiency theorems of the article. Section 3 is devoted to state one auxiliary lemma on which the proof of Theorem 2.1, given in the same section, is strongly based. Section 4 is dedicated to state another auxiliary result on which the proof of Theorem 2.2, once again given in the same section, is based.

2.   The problem and the main results for local minima

Suppose we are given an interval $T: = [t_0, t_1]$ in ${{\bf R}}$, two fixed points $\xi_0$, $\xi_1$ in ${{\bf R}^n}$, functions $L$, $L_\gamma$ $(\gamma = 1, \ldots, K)$ mapping ${T \times {{\bf R}^n} \times {{\bf R}^m}}$ to ${{\bf R}}$, two functions $f$ and $\varphi = (\varphi_1, \ldots, \varphi_s)$ mapping ${T \times {{\bf R}^n} \times {{\bf R}^m}}$ to ${{\bf R}^n}$ and ${{\bf R}^s}$ respectively. Let

where $R: = \{1, \ldots, r\}$ and $S: = \{r+1, \ldots, s\}$ $(r = 0, 1, \ldots, s)$. If $r = 0$ then $R = \emptyset$ and we disregard statements involving $\varphi_\alpha$. Similarly, if $r = s$ then $S = \emptyset$ and we disregard statements involving $\varphi_\beta$.

Let $\{\Lambda_n\}$ be a sequence of measurable functions and let $\Lambda$ be a measurable function. We shall say that the sequence of measurable functions $\{\Lambda_n\}$ converges almost uniformly to a function $\Lambda$ on $T$, if given ${\epsilon > 0}$, there exists a measurable set $\Upsilon_\epsilon\subset T$ with $m(\Upsilon_\epsilon) < \epsilon$ such that $\{\Lambda_n\}$ converges uniformly to $\Lambda$ on $T\setminus \Upsilon_\epsilon$. We will also denote uniform convergence by $\Lambda_n \buildrel \hbox{u} \over \longrightarrow \Lambda$, almost uniform convergence by $\Lambda_n \buildrel \hbox{au} \over \longrightarrow \Lambda$, strong convergence in $L^p$ by $\Lambda_n \buildrel L^p \over \longrightarrow \Lambda$ and weak convergence in $L^p$ by $\Lambda_n \buildrel L^p \over \rightharpoonup \Lambda$. From now on we shall not relabel the subsequences of a given sequence since this fact will not alter our results.

It will be assumed throughout the paper that $L$, $L_\gamma$ $(\gamma = 1, \ldots, K)$, $f$ and $\varphi$ have first and second derivatives with respect to $x$ and $u$. Also, if we denote by $b(t, x, u)$ either $L(t, x, u)$, $L_\gamma(t, x, u)$ $(\gamma = 1, \ldots, K)$, $f(t, x, u)$, $\varphi(t, x, u)$ or any of their partial derivatives of order less or equal than two with respect to $x$ and $u$, we shall assume that if ${{\cal B}}$ is any bounded subset of ${T \times {{\bf R}^n} \times {{\bf R}^m}}$, then $|b({{\cal B}})|$ is a bounded subset of ${{\bf R}}$. Additionally, we shall assume that if $\{(\Phi_q, \Psi_q)\}$ is any sequence in ${AC}(T; {{\bf R}^n})\times L^\infty(T; {{\bf R}^m})$ such that for some $\Upsilon\subset T$ measurable and some $(\Phi_0, \Psi_0)\in{AC}(T; {{\bf R}^n})\times L^\infty(T; {{\bf R}^m})$, $(\Phi_q, \Psi_q) \buildrel L^\infty \over \longrightarrow (\Phi_0, \Psi_0)$ on $\Upsilon$, then for all $q\in{{\bf N}}$, $b(\cdot, \Phi_q(\cdot), \Psi_q(\cdot))$ is measurable on $\Upsilon$ and

Note that all conditions given above are satisfied if the functions $L$, $L_\gamma$ $(\gamma = 1, \ldots, K)$, $f$ and $\varphi$ and their first and second derivatives with respect to $x$ and $u$ are continuous on ${T \times {{\bf R}^n} \times {{\bf R}^m}}$.

The fixed end-point optimal control problem we shall deal with, denoted by (P), is that of minimizing the functional

over all couples $(x, u)$ with $x\colon T\to{{\bf R}^n}$ absolutely continuous and $u\colon T\to{{\bf R}^m}$ essentially bounded, satisfying the constraints

Denote by ${{\cal X}}$ the space of all absolutely continuous functions mapping $T$ to ${{\bf R}^n}$ and by ${{\cal U}}_c: = L^\infty(T; {{\bf R}}^c)$ $(c\in{{\bf N}})$. Elements of ${{\cal X}}\times {{\cal U}}_m$ will be called processes and a process $(x, u)$ is admissible if it satisfies the constraints. A process $(x, u)$ solves (P) if it is admissible and $I(x, u)\le I(y, v)$ for all admissible processes $(y, v)$. An admissible process $(x, u)$ is called a strong minimum of (P) if it is a minimum of $I$ with respect to the norm

that is, if for any ${\epsilon > 0}$, $I(x, u)\le I(y, v)$ for all admissible processes $(y, v)$ satisfying $\|y-x\| < \epsilon$. An admissible process $(x, u)$ is called a weak minimum of (P) if it is a minimum of $I$ with respect to the norm

that is, if for any ${\epsilon > 0}$, $I(x, u)\le I(y, v)$ for all admissible processes $(y, v)$ satisfying $\|(y, v)-(x, u)\| < \epsilon$. It is a strict minimum if $I(x, u) = I(y, v)$ only in case $(x, u) = (y, v)$. Note that the crucial difference between strong and weak minima is that in the former, if $I$ affords a strong minimum at $(x_0, u_0)$, then, if $(x, u)$ is admissible and it is sufficiently close to $(x_0, u_0)$, in the sense that the quantity $\|x-x_0\|_\infty$ is sufficiently small, then $I(x, u)\ge I(x_0, u_0)$, meanwhile for the latter, if $(x, u)$ is admissible and it is sufficiently close to $(x_0, u_0)$, in the sense that the quantities $\|x-x_0\|_\infty$, $\|u-u_0\|_\infty$ are sufficiently small, then $I(x, u)\ge I(x_0, u_0)$.

The following definitions will be useful in order to continue with the development of this theory.

${\bullet}$ For any $(x, u)\in {{\cal X}}\times {{\cal U}}_m$ we shall use the notation $({{\tilde x}}(t))$ to represent $(t, x(t), u(t))$. Similarly $({{\tilde x}}_0(t))$ represents $(t, x_0(t), u_0(t))$. Throughout the paper the notation "$\ast$" will denote transpose.

${\bullet}$ Given $K$ real numbers $\lambda_1, \ldots, \lambda_K$, consider the functional $I_0\colon{{\cal X}}\times{{\cal U}}_m\to{{\bf R}}$ defined by

where $L_0\colon{T \times {{\bf R}^n} \times {{\bf R}^m}}\to{{\bf R}}$ is given by

$\bullet$ For all $(t, x, u, \rho, \mu) \in T \times {{\bf R}^n} \times {{\bf R}^m} \times {{\bf R}^n}\times {{\bf R}^s}$, set

Given $\rho \in {{\cal X}}$ and $\mu\in {{\cal U}}_s$ define, for all $(t, x, u) \in {T \times {{\bf R}^n} \times {{\bf R}^m}}$,

and let

$\bullet$ Consider the first variations of $J_0$ and $I_\gamma$ $(\gamma = 1, \ldots, K)$ with respect to $(x, u) \in {{\cal X}}\times{{\cal U}}_m$ over $(y, v)\in {{\cal X}}\times L^2(T; {{\bf R}^m})$ which are given, respectively, by

The second variation of $J_0$ with respect to $(x, u) \in {{\cal X}}\times{{\cal U}}_m$ over $(y, v)\in {{\cal X}} \times L^2(T; {{\bf R}^m})$ is given by

where, for all $(t, y, v) \in {T \times {{\bf R}^n} \times {{\bf R}^m}}$,

$\bullet$ Denote by $E_0$ the Weierstrass excess function of $F_0$, given by

Similarly, the Weierstrass excess function of $L_\gamma$ $(\gamma = 1, \ldots, K)$ corresponds to

$\bullet$ For all $(x, u) \in {{\cal X}}\times L^1(T; {{\bf R}^m})$ let

where

where $V(\pi): = (1 + |\pi|^2)^{1/2} - 1$ with $\pi: = (\pi_1, \ldots, \pi_n)^\ast\in{{\bf R}^n}$ or $\pi: = (\pi_1, \ldots, \pi_m)^\ast\in{{\bf R}^m}$.

Finally, for all $(t, x, u)\in{T \times {{\bf R}^n} \times {{\bf R}^m}}$, denote by

the set of active indices of $(t, x, u)$ with respect to the mixed inequality constraints. For all $(x, u)\in{{\cal X}}\times{{\cal U}}_m$, denote by

the set of active indices of $(x, u)$ with respect to the isoperimetric inequality constraints. Given $(x, u)\in{{\cal X}}\times{{\cal U}}_m$, let ${{\cal Y}}(x, u)$ be the set of all $(y, v)\in {{\cal X}}\times L^2(T; {{\bf R}^m})$ satisfying

The set ${{\cal Y}}(x, u)$ is called the cone of critical directions along $(x, u)$.

Now we are in a position to state the main results of the article, two sufficiency results for strict local minima of problem (P). Given an admissible process $(x_0, u_0)$ where the proposed optimal controls $u_0$ need not be continuous but only measurable, the hypotheses include, two conditions related with Pontryagin maximum principle, a similar assumption of the necessary Legendre-Clebsch condition, the positivity of the second variation on the cone of critical directions and some conditions involving the Weierstrass functions delimiting problem (P). It is worth observing that the sufficiency theorems not only give sufficient conditions for strict local minima but also provides some information concerning the deviation between optimal and feasible costs. In the measure of this deviation are involved the functionals $D_i$ $(i = 1, 2)$ which play the role of the square of the norm of the Banach space $L^1$.

The following theorem provides sufficient conditions for a strict strong minimum of problem (P).

Theorem 2.1 Let $(x_0, u_0)$ be an admissible process. Assume that ${{\cal I}}_a({{\tilde x}}_0(\cdot))$ is piecewise constant on $T$, suppose that there exist $\rho\in {{\cal X}}$, $\mu\in {{\cal U}}_s$ with $\mu_\alpha(t)\ge0$ and $\mu_\alpha(t)\varphi_\alpha({{\tilde x}}_0(t)) = 0$ $(\alpha\in R, t\in T)$, two positive numbers $\delta, \epsilon$, and multipliers $\lambda_1, \ldots, \lambda_K$ with $\lambda_i \ge 0$ and $\lambda_i I_i(x_0, u_0) = 0$ $(i = 1, \ldots, k)$ such that

and the following holds:

(ⅰ) $H_{uu}({{\tilde x}}_0(t), \rho(t), \mu(t)) \le 0$ $({{a.e. \; in}\ T})$.

(ⅱ) ${J^{\prime\prime}}_0((x_0, u_0);(y, v)) > 0$ for all $(y, v)\not = (0, 0)$, $(y, v) \in {{\cal Y}}(x_0, u_0)$.

(ⅲ) If $(x, u)$ is admissible with $\|x-x_0\| < \epsilon$, then

a. $E_0(t, x(t), u_0(t), u(t)) \ge 0$ $({{a.e. \; in}\ T})$.

b. ${\int_{t_0}^{t_1}} E_0(t, x(t), u_0(t), u(t))dt \ge \delta \max\{ {\int_{t_0}^{t_1}} V({{\dot x}}(t)-{{\dot x}}_0(t))dt, {\int_{t_0}^{t_1}} V(u(t)-u_0(t))dt \}$.

c. ${\int_{t_0}^{t_1}} E_0(t, x(t), u_0(t), u(t)) dt \ge \delta|{\int_{t_0}^{t_1}} E_\gamma(t, x(t), u_0(t), u(t))dt|$ $(\gamma = 1, \ldots, K)$.

In this case, there exist $\theta_1, \theta_2 > 0$ such that if $(x, u)$ is admissible with $\|x-x_0\| < \theta_1$,

In particular, $(x_0, u_0)$ is a strict strong minimum of $\rm(P)$.

The theorem below gives sufficient conditions for weak minima of problem (P).

Theorem 2.2 Let $(x_0, u_0)$ be an admissible process. Assume that ${{\cal I}}_a({{\tilde x}}_0(\cdot))$ is piecewise constant on $T$, suppose that there exist $\rho\in {{\cal X}}$, $\mu\in {{\cal U}}_s$ with $\mu_\alpha(t)\ge0$ and $\mu_\alpha(t)\varphi_\alpha({{\tilde x}}_0(t)) = 0$ $(\alpha\in R, t\in T)$, two positive numbers $\delta, \epsilon$, and multipliers $\lambda_1, \ldots, \lambda_K$ with $\lambda_i \ge 0$ and $\lambda_i I_i(x_0, u_0) = 0$ $(i = 1, \ldots, k)$ such that

and the following holds:

(ⅰ) $H_{uu}({{\tilde x}}_0(t), \rho(t), \mu(t)) \le 0$ $({{a.e.\; in}\ T})$.

(ⅱ) ${J^{\prime\prime}}_0((x_0, u_0);(y, v)) > 0$ for all $(y, v)\not = (0, 0)$, $(y, v) \in {{\cal Y}}(x_0, u_0)$.

(ⅲ) If $(x, u)$ is admissible with $\|(x, u)-(x_0, u_0)\| < \epsilon$, then

${\bf a^\prime.}$ ${\int_{t_0}^{t_1}} E_0(t, x(t), u_0(t), u(t))dt \ge \delta{\int_{t_0}^{t_1}} V(u(t)-u_0(t))dt$.

${\bf b^\prime.}$ ${\int_{t_0}^{t_1}} E_0(t, x(t), u_0(t), u(t)) dt \ge \delta|{\int_{t_0}^{t_1}} E_\gamma(t, x(t), u_0(t), u(t))dt|$ $(\gamma = 1, \ldots, K)$.

In this case, there exist $\theta_1, \theta_2 > 0$ such that if $(x, u)$ is admissible with $\|(x, u)-(x_0, u_0)\| < \theta_1$,

In particular, $(x_0, u_0)$ is a strict weak minimum of $\rm(P)$.

Examples 2.3 and 2.4 illustrate Theorems 2.1 and 2.2 respectively. It is worth mentioning that the sufficiency theory of ^[28] cannot be applied in both examples. Indeed, if $f$ denotes the dynamic of the problems, as one readily verifies, in both examples, we have that

and hence, it does not exist a continuous function $\psi\colon[0, 1]\times{{\bf R}}\to{{\bf R}}$ such that

Example 2.3 Let $u_{02}\colon [0, 1]\to{{\bf R}}$ be any measurable function whose codomain belongs to the set $\{-1, 1\}.$

Consider problem (P) of minimizing

over all couples $(x, u)$ with $x\colon[0, 1]\to{{\bf R}}$ absolutely continuous and $u\colon[0, 1]\to{{\bf R}}^2$ essentially bounded satisfying the constraints

where

For this case, $T = [0, 1]$, $n = 1$, $m = 2$, $r = 2$, $s = 3$, $k = K = 1$, $\xi_0 = \xi_1 = 0$,

Clearly, $L$, $L_1$, $f$ and $\varphi = (\varphi_1, \varphi_2, \varphi_3)$ satisfy the hypotheses imposed in the statement of the problem.

Also, as one readily verifies, the process $(x_0, u_0) = (x_0, u_{01}, u_{02})\equiv(0, 0, u_{02})$ is admissible.

Moreover,

Therefore, if we set $\rho\equiv0$, $\mu_1\equiv1$, $\mu_2 = \mu_3\equiv0$ and $\lambda_1 = 0$, we have

and hence the first order sufficient conditions involving the Hamiltonian of problem (P) are verified. Moreover, if we set $R: = \{1, 2\}$, observe that

Additionally, ${{\cal I}}_a({{\tilde x}}_0(\cdot))\equiv\{1\}$ is constant on $T$. Also, it is readily seen that for all $t\in T$,

and so condition (ⅰ) of Theorem 2.1 is satisfied. Observe that, for all $t\in T$,

Thus, ${{\cal Y}}(x_0, u_0)$ is given by all $(y, v)\in{{\cal X}}\times L^2(T; {{\bf R}}^2)$ satisfying

Moreover, note that, for all $(t, x, u)\in T\times{{\bf R}}\times{{\bf R}}^2$,

and so, for all $t\in T$,

Consequently, we have

for all $(y, v)\not = (0, 0)$, $(y, v)\in{{\cal Y}}(x_0, u_0)$. Hence, condition (ⅱ) of Theorem 2.1 is verified.

Additionally, observe that for all $(x, u)$ admissible and all $t\in T$,

and then, condition (ⅲ)(a) of Theorem 2.1 is satisfied for any ${\epsilon > 0}$. Now, if $(x, u)$ is admissible, then

and so, if $(x, u)$ is admissible,

Also, if $(x, u)$ is admissible, then

Therefore, if $(x, u)$ is admissible, then

and hence, condition (ⅲ)(b) of Theorem 2.1 is verified for any ${\epsilon > 0}$ and $\delta = 1$. Finally, if $(x, u)$ is admissible, note that

implying that condition (ⅲ)(c) of Theorem 2.1 holds for any ${\epsilon > 0}$ and $\delta = 1$. By Theorem 2.1, $(x_0, u_0)$ is a strict strong minimum of (P).

Example 2.4 Consider problem (P) of minimizing

over all couples $(x, u)$ with $x\colon[0, 1]\to{{\bf R}}$ absolutely continuous and $u\colon[0, 1]\to{{\bf R}}^2$ essentially bounded satisfying the constraints

where

For this case, $T = [0, 1]$, $n = 1$, $m = 2$, $r = 1$, $s = 2$, $k = K = 1$, $\xi_0 = \xi_1 = 0$,

Clearly, $L$, $L_1$, $f$ and $\varphi = (\varphi_1, \varphi_2)$ satisfy the hypotheses imposed in the statement of the problem.

Let $u_{02}\colon T\to{{\bf R}}$ be any measurable function whose codomain belongs to the set $\{-1, 1\}.$

Clearly, the process $(x_0, u_0) = (x_0, u_{01}, u_{02})\equiv(0, 0, u_{02})$ is admissible.

Moreover,

Therefore, if we set $\rho\equiv0$, $\mu_1\equiv1$, $\mu_2\equiv0$ and $\lambda_1 = 0$, we have

and hence the first order sufficient conditions involving the Hamiltonian of problem (P) are verified. Additionally, observe that

Also, ${{\cal I}}_a({{\tilde x}}_0(\cdot))\equiv\{1\}$ is constant on $T$. Moreover, it is readily seen that for all $t\in T$,

and so condition (ⅰ) of Theorem 2.2 is satisfied. Observe that, for all $t\in T$,

Thus, ${{\cal Y}}(x_0, u_0)$ is given by all $(y, v)\in{{\cal X}}\times L^2(T; {{\bf R}}^2)$ satisfying

Also, note that, for all $(t, x, u)\in T\times{{\bf R}}\times{{\bf R}}^2$,

and so, for all $t\in T$,

Consequently, we have

for all $(y, v)\not = (0, 0)$, $(y, v)\in{{\cal Y}}(x_0, u_0)$. Hence, condition (ⅱ) of Theorem 2.2 is verified.

Additionally, observe that for any $\epsilon\in(0, 1)$, all $(x, u)$ admissible satisfying $\|(x, u)-(x_0, u_0)\| < \epsilon$ and all $t\in T$,

Therefore, for any $\epsilon\in(0, 1)$ and all $(x, u)$ admissible satisfying $\|(x, u)-(x_0, u_0)\| < \epsilon$,

and hence condition (ⅲ)(a$^\prime$) of Theorem 2.2 is satisfied for any $\epsilon\in(0, 1)$ and $\delta = 1$.

Finally, if $(x, u)$ is admissible, note that

implying that condition (ⅲ)(b$^\prime$) of Theorem 2.2 holds for any ${\epsilon > 0}$ and $\delta = 1$. By Theorem 2.2, $(x_0, u_0)$ is a strict weak minimum of (P).

3.   Proof of Theorem 2.1

In this section we shall prove Theorem 2.1. We first state an auxiliary result whose proof is given in Lemmas 2–4 of ^[31].

In the following lemma we shall assume that we are given $z_0: = (x_0, u_0)\in {{\cal X}}\times L^1(T; {{\bf R}^m})$ and a subsequence $\{z_q: = (x_q, u_q)\}$ in ${{\cal X}}\times L^1(T; {{\bf R}^m})$ such that

For all $q\in{{\bf N}}$, set

For all $q\in{{\bf N}}$, define

where

As we mentioned in the introduction, we do not relabel the subsequences of a given sequence since as one readily verifies this fact will not alter our results.

Lemma 3.1

$\quad {\rm\bf a.}$ For some $v_0\in L^2(T; {{\bf R}^m})$ and some subsequence of $\{z_q\}$, $v_q \buildrel L^1 \over \rightharpoonup v_0$ on $T$. Even more, $u_q \buildrel \hbox{au} \over \longrightarrow u_0$ on $T$.

$\quad {\rm\bf b.}$ There exist $\zeta_0\in L^2(T; {{\bf R}^n})$, $\bar y_0\in{{\bf R}^n}$, and some subsequence of $\{z_q\}$, such that ${{\dot y}}_q \buildrel L^1 \over \rightharpoonup \zeta_0$ on $T$. Moreover, if $y_0(t): = \bar y_0+\int_{t_0}^t\zeta_0(\tau)d\tau$ $(t\in T)$, then $y_q \buildrel \hbox{u} \over \longrightarrow y_0$ on $T$.

$\quad {\rm\bf c.}$ Let $\Upsilon\subset T$ be measurable and suppose that $W_q \buildrel \hbox{u} \over \longrightarrow 1$ on $\Upsilon$. Let $R_q, R_0\in L^\infty(\Upsilon; {{\bf R}}^{m\times m})$, assume that $R_q \buildrel \hbox{u} \over \longrightarrow R_0$ on $\Upsilon$, $R_0(t)\ge0$ $(t\in \Upsilon)$, and let $v_0$ be the function considered in condition (a) of Lemma 3.1. Then,

Proof. The proof of Theorem 2.1 will be made by contraposition, that is, we shall assume that for all $\theta_1, \theta_2 > 0$, there exists an admissible process $(x, u)$ such that

Also, we are going to assume that all the hypotheses of Theorem 2.1 are satisfied with the exception of hypothesis (ⅱ) and we will obtain the negation of condition (ⅱ) of Theorem 2.1. First of all, note that since

if $(x, u)$ is admissible, then $I(x, u)\ge J_0(x, u)$. Also, since

then $I(x_0, u_0) = J_0(x_0, u_0)$. Thus, (1) implies that for all $\theta_1, \theta_2 > 0$, there exists $(x, u)$ admissible with $\|x-x_0\| < \theta_1$ and

Let $z_0: = (x_0, u_0)$. Note that, for all admissible processes $z = (x, u)$,

where

and the functions $M_0$ and $N_0$ are given by

We have,

where

Now, as in ^[28], choose $\nu > 0$ such that for all $z = (x, u)$ admissible with $\|x-x_0\| < 1$,

Now, by (2), for all $q\in{{\bf N}}$ there exists $z_q: = (x_q, u_q)$ admissible such that

The last inequality of (5) implies that $z_q\not = z_0$ and so for all $q\in{{\bf N}}$,

Since

it follows that ${J^\prime}_0(z_0;(y, v)) = 0$ for all $(y, v)\in{{\cal X}}\times L^2(T; {{\bf R}^m})$. With this in mind, by (3), condition (ⅲ)(b) of Theorem 2.1, (4) and (5),

By (5), for all $q\in{{\bf N}}$,

and hence

For all $q\in{{\bf N}}$, define

By condition (a) of Lemma 3.1, there exist $v_0\in L^2(T; {{\bf R}^m})$ and a subsequence of $\{z_q\}$ such that $v_q \buildrel L^1 \over \rightharpoonup v_0$ on $T$. By condition (b) of Lemma 3.1, there exist $\zeta_0\in L^2(T; {{\bf R}^n})$, $\bar y_0\in{{\bf R}^n}$ and a subsequence of $\{z_q\}$ such that, if for all $t\in T$, $y_0(t): = \bar y_0+\int_{t_0}^t\zeta_0(\tau)d\tau$, then $y_q \buildrel \hbox{u} \over \longrightarrow y_0$ on $T$.

We claim that

ⅰ. ${J^{\prime\prime}}_0(z_0;(y_0, v_0))\le0$, $(y_0, v_0)\not = (0, 0)$.

ⅱ. ${{\dot y}}_0(t) = f_x({{\tilde x}}_0(t))y_0(t)+f_u({{\tilde x}}_0(t))v_0(t)$ $({\hbox{a.e. in}\ T})$, $y_0(t_i) = 0$ $(i = 0, 1)$.

ⅲ. ${I^\prime}_i(z_0;(y_0, v_0))\le0$ $(i\in i_a(z_0))$, ${I^\prime}_j(z_0;(y_0, v_0)) = 0$ $(j = k+1, \ldots, K)$.

ⅳ. $\varphi_{\alpha x}({{\tilde x}}_0(t))y_0(t)+\varphi_{\alpha u}({{\tilde x}}_0(t))v_0(t)\le0$ $({\hbox{a.e. in}\ T}, \, \alpha\in{{\cal I}}_a({{\tilde x}}_0(t)))$.

ⅴ. $\varphi_{\beta x}({{\tilde x}}_0(t))y_0(t)+\varphi_{\beta u}({{\tilde x}}_0(t))v_0(t) = 0$ $({\hbox{a.e. in}\ T}, \, \beta\in S)$.

Indeed, the equalities $y_0(t_i) = 0$ $(i = 0, 1)$ follow from the definition of $y_q$, the admissibility of $z_q$ and the fact that $y_q \buildrel \hbox{u} \over \longrightarrow y_0$ on $T$.

For all $q\in{{\bf N}}$, we have

By condition (b) of Lemma 3.1,

both on $T$ and, since $v_q \buildrel L^1 \over \rightharpoonup v_0$ on $T$,

We have,

Indeed, by condition (a) of Lemma 3.1, we are able to choose $\Upsilon\subset T$ measurable such that $u_q \buildrel \hbox{u} \over \longrightarrow u_0$ on $\Upsilon$. Since $z_q$ is admissible, then recalling the definition of $W_q$ given in the beginning of this section, as one readily verifies, $W_q \buildrel \hbox{u} \over \longrightarrow 1$ on $\Upsilon$. Moreover, for all $t\in \Upsilon$ and $q\in{{\bf N}}$,

where

Clearly,

By condition (ⅰ) of Theorem 2.1, $R_0(t)\ge 0$ $(t\in \Upsilon)$. Additionally, by condition (ⅲ)(a) of Theorem 2.1, for all $q\in{{\bf N}}$,

and so, by condition (c) of Lemma 3.1,

As $\Upsilon$ can be chosen to differ from $T$ by a set of an arbitrarily small measure and the function

belongs to $L^1(T; {{\bf R}})$, this inequality holds when $\Upsilon = T$ and this establishes (7). By (3) and (5)–(7),

If $(y_0, v_0) = (0, 0)$, then

and so, by condition (ⅲ)(b) of Theorem 2.1,

which contradicts the positivity of $\delta$.

For all $q\in{{\bf N}}$, we have

where

Since

$y_q \buildrel \hbox{u} \over \longrightarrow y_0$ and $v_q \buildrel L^1 \over \rightharpoonup v_0$ all on $\Upsilon$, it follows that ${{\dot y}}_q \buildrel L^1 \over \rightharpoonup A_0y_0+B_0y_0$ on $\Upsilon$. By condition (b) of Lemma 3.1, ${{\dot y}}_q \buildrel L^1 \over \rightharpoonup \zeta_0 = {{\dot y}}_0$ on $\Upsilon$. Therefore,

As $\Upsilon$ can be chosen to differ from $T$ by a set of an arbitrarily small measure, then there cannot exist a subset of $T$ of positive measure in which the functions $y_0$ and $v_0$ do not satisfy the differential equation ${{\dot y}}_0(t) = A_0(t)y_0(t)+B_0(t)v_0(t)$. Consequently,

and (ⅰ) and (ⅱ) of our claim are proved.

Finally, in order to obtain (ⅲ)–(ⅴ) of our claim it is enough to copy the proofs of ^[28] from Eqs (8)–(15).

4.   Proof of Theorem 2.2

In this section we shall prove Theorem 2.2. We first state an auxiliary result which is an immediate consequence of Lemmas 3.1 and 3.2 of ^[30].

In the following lemma we shall assume that we are given $u_0\in L^1(T; {{\bf R}^m})$ and a sequence $\{u_q\}$ in $L^1(T; {{\bf R}^m})$ such that

For all $q\in{{\bf N}}$ define

Lemma 4.1

${\rm\bf a.}$ For some $v_{02}\in L^2(T; {{\bf R}^m})$ and a subsequence of $\{u_q\}$, $v_{2q} \buildrel L^1 \over \rightharpoonup v_{02}$ on $T$.

${\rm\bf b.}$ Let $A_q\in L^\infty(T; {{\bf R}}^{n\times n})$ and $B_q\in L^\infty(T; {{\bf R}}^{n\times m})$ be matrix functions for which there exist constants $m_0, m_1 > 0$ such that $\|A_q\|_\infty\le m_0$, $\|B_q\|_\infty\le m_1$ $(q\in{{\bf N}})$, and for all $q\in{{\bf N}}$ denote by $Y_q$ the solution of the initial value problem

Then there exist $\sigma_0\in L^2(T; {{\bf R}^n})$ and a subsequence of $\{z_q\}$, such that ${{\dot Y}}_q \buildrel L^1 \over \rightharpoonup \sigma_0$ on $T$, and hence if $Y_0(t): = \int_{t_0}^t\sigma_0(\tau)d\tau$ $(t\in T)$, then $Y_q \buildrel \hbox{u} \over \longrightarrow Y_0$ on $T$.

Proof. As we made with the proof of Theorem 2.1, the proof of Theorem 2.2 will be made by contraposition, that is, we shall assume that for all $\theta_1, \theta_2 > 0$, there exists an admissible process $(x, u)$ such that

Once again, as we made with the proof of Theorem 2.1, (8) implies that for all $\theta_1, \theta_2 > 0$, there exists $(x, u)$ admissible with

Let $z_0: = (x_0, u_0)$. As in the proof of Theorem 2.1, for all admissible processes $z = (x, u)$,

where ${{\cal E}}_0$ and $K_0$ are given as in the proof of Theorem 2.1.

Now, by (9), for all $q\in{{\bf N}}$ there exists $z_q: = (x_q, u_q)$ admissible such that

Since $z_q$ is admissible, the last inequality of (10) implies that $u_q\not = u_0$ and so

By the first relation of (10), we have

For all $q\in{{\bf N}}$, define $v_{2q}$ as in Lemma 4.1 and

By condition (a) of Lemma 4.1, there exist $v_{02}\in L^2(T; {{\bf R}^m})$ and a subsequence of $\{z_q\}$ such that $v_{2q} \buildrel L^1 \over \rightharpoonup v_{02}$ on $T$. As in the proof of Theorem 2.1, for all $q\in{{\bf N}}$,

We have the existence of $m_0, m_1 > 0$ such that $\|A_q\|_\infty\le m_0$ and $\|B_q\|_\infty\le m_1$ $(q\in{{\bf N}})$. By condition (b) of Lemma 4.1, there exist $\sigma_0\in L^2(T; {{\bf R}^n})$ and a subsequence of $\{z_q\}$ such that, if $Y_0(t): = \int_{t_0}^t \sigma_0(\tau)d\tau$ $(t\in T)$, then $Y_q \buildrel \hbox{u} \over \longrightarrow Y_0$ on $T$. We claim that

ⅰ. ${J^{\prime\prime}}_0(z_0;(Y_0, v_{02}))\le0$, $(Y_0, v_{02})\not = (0, 0)$.

ⅱ. $\dot Y_0(t) = f_x({{\tilde x}}_0(t))Y_0(t)+f_u({{\tilde x}}_0(t))v_{02}(t)$ $({\hbox{a.e. in}\ T})$, $Y_0(t_i) = 0$ $(i = 0, 1)$.

ⅲ. ${I^\prime}_i(z_0;(Y_0, v_{02}))\le0$ $(i\in i_a(z_0))$, ${I^\prime}_j(z_0;(Y_0, v_{02})) = 0$ $(j = k+1, \ldots, K)$.

ⅳ. $\varphi_{\alpha x}({{\tilde x}}_0(t))Y_0(t)+\varphi_{\alpha u}({{\tilde x}}_0(t))v_{02}(t)\le0$ $({\hbox{a.e. in}\ T}, \, \alpha\in{{\cal I}}_a({{\tilde x}}_0(t)))$.

ⅴ. $\varphi_{\beta x}({{\tilde x}}_0(t))Y_0(t)+\varphi_{\beta u}({{\tilde x}}_0(t))v_{02}(t) = 0$ $({\hbox{a.e. in}\ T}, \, \beta\in S)$.

Indeed, for all $q\in{{\bf N}}$, we have

Also, we have

both on $T$ and, since $v_{2q} \buildrel L^1 \over \rightharpoonup v_{02}$ on $T$,

Now, for all $t\in T$ and $q\in{{\bf N}}$,

where

Clearly,

Since $\|z_q-z_0\|\to0$ as $q\to\infty$, it follows that $W_{2q} \buildrel L^\infty \over \longrightarrow 1$ on $T$ and, by condition (ⅰ) of Theorem 2.2, $R_0(t)\ge 0$ $({\hbox{a.e. in}\ T})$. Consequently,

On the other hand, since

we have that ${J^\prime}_0(z_0;(y, v)) = 0$ for all $(y, v)\in {{\cal X}}\times L^2(T; {{\bf R}^m})$. With this in mind, (10)–(12),

If $(Y_0, v_{02}) = (0, 0)$, then

and so, by condition (ⅲ)$(\hbox{a}^\prime)$ of Theorem 2.2,

which contradicts the positivity of $\delta$ and this proves (ⅰ) of our claim.

Now, we also claim that

Indeed, the equalities $Y_0(t_i) = 0$ $(i = 0, 1)$ follow from the definition of $Y_q$, the admissibility of $z_q$ and the fact that $Y_q \buildrel \hbox{u} \over \longrightarrow Y_0$ on $T$. Also, observe that since $Y_q \buildrel \hbox{u} \over \longrightarrow Y_0$,

and $v_{2q} \buildrel L^1 \over \rightharpoonup v_{02}$ all on $T$, then $\dot Y_q \buildrel L^1 \over \rightharpoonup A_0Y_0+B_0v_{02}$ on $T$. By condition (b) of Lemma 4.1, $\dot Y_q \buildrel L^1 \over \rightharpoonup \sigma_0 = \dot Y_0$ on $T$, which accordingly implies that

and our claim is proved.

Finally, in order to prove (ⅲ)–(ⅴ) of our claim it is enough to copy the proofs given in ^[28] from Eqs (8)–(15) by replacing $y_0$ by $Y_0$, $v_0$ by $v_{02}$ and $\Upsilon$ by $T$.

5.   Conclusions

In this article, we have provided sufficiency theorems for weak and strong minima in an optimal control problem of Lagrange with fixed end-points, nonlinear dynamics, inequality and equality isoperimetric restrictions and inequality and equality mixed time-state-control constraints. The sufficiency treatment studied in this paper does not need that the proposed optimal controls be continuous but only purely measurable. The sufficiency results not only provide local minima but they also measure the deviation between optimal and admissible costs by means of a functional playing a similar role of the square of the classical norm of the Banach space $L^1$. Additionally, all the crucial sufficiency hypotheses are included in the theorems, in contrast, with other necessary and sufficiency theories which strongly depend upon some preliminary assumptions not embedded in the corresponding theorems of optimality. Finally, our sufficiency technique is self-contained because it is independent of some classical sufficient approaches involving Hamilton-Jacobi inequalities, matrix-valued Riccati equations, generalizations of Jacobi's theory appealing to extended notions of conjugate points or insertions of the original problem in some abstract Banach spaces.

Acknowledgments

The author is thankful to Dirección General de Asuntos del Personal Académico, Universidad Nacional Autónoma de México, for the support provided by the project PAPIIT-IN102220. Moreover, the author thanks the two anonymous referees for the encouraging suggestions made in their reviews.

Conflict of interest

The author declares no conflict of interest.