On the regularization of the classical optimality conditions in convex optimal control problems

M. I. Sumin

Trudy Instituta matematiki i mehaniki, Trudy Instituta Matematiki i Mekhaniki UrO RAN, Tome 26 (2020) no. 2, pp. 252-269

Résumé

We consider a regularization of the classical optimality conditions (COCs) in a convex optimal control problem for a linear system of ordinary differential equations with a pointwise state equality constraint and a finite number of functional constraints in the form of equalities and inequalities. The set of admissible controls of the problem is traditionally embedded in the space of square integrable functions. However, the objective functional is not, generally speaking, strongly convex. The proof of regularized COCs is based on the use of two regularization parameters. One of them is “responsible” for the regularization of the dual problem, while the other is contained in a strongly convex regularizing addition to the objective functional of the original problem. The main purpose of the regularized Lagrange principle and Pontryagin maximum principle is the stable generation of minimizing approximate solutions in the sense of J. Warga. The regularized COCs: (1) are formulated as theorems on the existence of minimizing approximate solutions in the original problem with the simultaneous constructive presentation of their specific representatives; (2) are expressed in terms of regular classical Lagrange and Hamilton–Pontryagin functions; (3) are sequential generalizations of their classical counterparts and retain their general structure; (4) “overcome” the properties of ill-posedness of COCs and are regularizing algorithms for optimization problems.

Détail

Keywords: convex optimal control, convex programming, minimizing sequence, regularizing algorithm, Lagrange principle, Pontryagin maximum principle, dual regularization.