Estimates of reachable set and sufficient optimality condition for discrete control problems
The Bulletin of Irkutsk State University. Series Mathematics, Tome 19 (2017), pp. 178-183 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

The paper follows the "canonical optimality theory’’ (in the terminology due to A. A. Milyutin) for discrete-time optimal control problems. In respect of optimality conditions, the feature of this approach is to employ sets of strongly monotone functions being solutions of the respective Hamilton–Jacobi inequality. This idea serves to improve the efficiency of the derived optimality conditions, extends the area of their application, and increases their "stability’’ with respect to certain peculiarities of a problem (e.g., the lack of the uniqueness of the normed collection of Lagrange multipliers etc.) In the paper, we consider an optimal control problem for a nonlinear discrete-time dynamic system with a nonlinear cost function under pointwise state and mixed-endpoint constraints. For this system, we obtain external estimates of the reachable set. Based on these estimates, we derive a sufficient optimality condition for the respective optimal control problems under no convexity assumptions on the input data. The results operate with a new class of feedback-parametric strongly monotone functions depending on initial, intermediate or terminal positions. The use of such functions brings an extra flexibility to the formulated sufficient optimality condition compared to the standard approach. The derived conditions admit a natural modification for problems of local (strong) minimum. One can expect that these results can be used for further strengthening of the discrete-time minimum principle up to a sufficient optimality condition, that would not require the convexity of the systems’ godograph. The work essentially relies on related results of Professor V. I. Gurman.
Keywords: strongly monotone functions, estimates of reachable sets, sufficient optimality conditions, optimal control, discrete dynamical systems.
@article{IIGUM_2017_19_a13,
     author = {S. P. Sorokin},
     title = {Estimates of reachable set and sufficient optimality condition for discrete control problems},
     journal = {The Bulletin of Irkutsk State University. Series Mathematics},
     pages = {178--183},
     year = {2017},
     volume = {19},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IIGUM_2017_19_a13/}
}
TY  - JOUR
AU  - S. P. Sorokin
TI  - Estimates of reachable set and sufficient optimality condition for discrete control problems
JO  - The Bulletin of Irkutsk State University. Series Mathematics
PY  - 2017
SP  - 178
EP  - 183
VL  - 19
UR  - http://geodesic.mathdoc.fr/item/IIGUM_2017_19_a13/
LA  - ru
ID  - IIGUM_2017_19_a13
ER  - 
%0 Journal Article
%A S. P. Sorokin
%T Estimates of reachable set and sufficient optimality condition for discrete control problems
%J The Bulletin of Irkutsk State University. Series Mathematics
%D 2017
%P 178-183
%V 19
%U http://geodesic.mathdoc.fr/item/IIGUM_2017_19_a13/
%G ru
%F IIGUM_2017_19_a13
S. P. Sorokin. Estimates of reachable set and sufficient optimality condition for discrete control problems. The Bulletin of Irkutsk State University. Series Mathematics, Tome 19 (2017), pp. 178-183. http://geodesic.mathdoc.fr/item/IIGUM_2017_19_a13/

[1] Gurman V. I., The Extension Principle in Control Problems, Nauka, M., 1997 (in Russian)

[2] Dykhta V. A., Sorokin S. P., “Hamilton–Jacobi inequalities and the optimality conditions in the problems of control with common end constraints”, Automation and Remote Control, 72:9 (2011), 1808–1821 | DOI | MR | Zbl

[3] N. N. Krasovskii, A. I. Subbotin, Game-theoretical control problems, Springer, N. Y., 1988 | MR | Zbl

[4] V. F. Krotov, Global Methods in Optimal Control Theory, Marcel Dekker, N. Y., 1996, 384 pp. | MR | Zbl

[5] F. H. Clarke, Yu. S. Ledyaev, R. J. Stern, P. R. Wolenski, Nonsmooth Analysis and Control Theory, Grad. Texts in Math., 178, Springer-Verlag, N.Y., 1998, 276 pp. | MR | Zbl