Necessary optimality condition for the minimal time crisis relaxing transverse condition via regularization

We derive necessary optimality conditions for the time of crisis problem under a more general hypothesis than the usual one encountered in the hybrid setting, which requires that any optimal solution should cross the boundary of the constraint set transversely. Doing so, we apply the Pontryagin Maximum Principle to a sequence of regular optimal control problems whose integral cost approximates the time of crisis. Optimality conditions are derived by passing to the limit in the Hamiltonian system (without the use of the hybrid maximum principle). This convergence result essentially relies on the boundedness of the sequence of adjoint vectors in L∞. Our main contribution is to relate this property to the boundedness in L1 of a suitable sequence which allows to avoid the use of the transverse hypothesis on optimal paths. An example with non-transverse trajectories for which necessary conditions are derived highlights the use of this new condition.

Optimality Conditions, Qualifications and Approximation Method for a Class of Non-Lipschitz Mathematical Programs with Switching Constraints

In this paper, we consider a class of mathematical programs with switching constraints (MPSCs) where the objective involves a non-Lipschitz term. Due to the non-Lipschitz continuity of the objective function, the existing constraint qualifications for local Lipschitz MPSCs are invalid to ensure that necessary conditions hold at the local minimizer. Therefore, we propose some MPSC-tailored qualifications which are related to the constraints and the non-Lipschitz term to ensure that local minimizers satisfy the necessary optimality conditions. Moreover, we study the weak, Mordukhovich, Bouligand, strongly (W-, M-, B-, S-) stationay, analyze what qualifications making local minimizers satisfy the (M-, B-, S-) stationay, and discuss the relationship between the given MPSC-tailored qualifications. Finally, an approximation method for solving the non-Lipschitz MPSCs is given, and we show that the accumulation point of the sequence generated by the approximation method satisfies S-stationary under the second-order necessary condition and MPSC Mangasarian-Fromovitz (MF) qualification.

Parameter identification for nonlocal phase field models for tumor growth via optimal control and asymptotic analysis

In this paper, we introduce the problem of parameter identification for a coupled nonlocal Cahn–Hilliard-reaction-diffusion PDE system stemming from a recently introduced tumor growth model. The inverse problem of identifying relevant parameters is studied here by relying on techniques from optimal control theory of PDE systems. The parameters to be identified play the role of controls, and a suitable cost functional of tracking-type is introduced to account for the discrepancy between some a priori knowledge of the parameters and the controls themselves. The analysis is carried out for several classes of models, each one depending on a specific relaxation (of parabolic or viscous type) performed on the original system. First-order necessary optimality conditions are obtained on the fully relaxed system, in both the two- and three-dimensional cases. Then, the optimal control problem on the non-relaxed models is tackled by means of asymptotic arguments, by showing convergence of the respective adjoint systems and the minimization problems as each one of the relaxing coefficients vanishes. This allows obtaining the desired necessary optimality conditions, hence to solve the parameter identification problem, for the original PDE system in case of physically relevant double-well potentials.

Directional Necessary Optimality Conditions for Bilevel Programs

The bilevel program is an optimization problem in which the constraint involves solutions to a parametric optimization problem. It is well known that the value function reformulation provides an equivalent single-level optimization problem, but it results in a nonsmooth optimization problem that never satisfies the usual constraint qualification, such as the Mangasarian–Fromovitz constraint qualification (MFCQ). In this paper, we show that even the first order sufficient condition for metric subregularity (which is, in general, weaker than MFCQ) fails at each feasible point of the bilevel program. We introduce the concept of a directional calmness condition and show that, under the directional calmness condition, the directional necessary optimality condition holds. Although the directional optimality condition is, in general, sharper than the nondirectional one, the directional calmness condition is, in general, weaker than the classical calmness condition and, hence, is more likely to hold. We perform the directional sensitivity analysis of the value function and propose the directional quasi-normality as a sufficient condition for the directional calmness. An example is given to show that the directional quasi-normality condition may hold for the bilevel program.

Optimal Control Problems Involving Combined Fractional Operators with General Analytic Kernels

Fractional optimal control problems via a wide class of fractional operators with a general analytic kernel are introduced. Necessary optimality conditions of Pontryagin type for the considered problem are obtained after proving a Gronwall type inequality as well as results on continuity and differentiability of perturbed trajectories. Moreover, a Mangasarian type sufficient global optimality condition for the general analytic kernel fractional optimal control problem is proved. An illustrative example is discussed.

Optimality conditions for nonsmooth multiobjective bilevel optimization using tangential subdifferentials

In combining the value function approach and tangential subdifferentials, we establish necessary optimality conditions of a nonsmooth multiobjective bilevel programming problem under a suitable constraint qualification. The upper level objectives and constraint functions are neither assumed to be necessarily locally Lipschitz nor convex.