×

Global control improvement algorithms. (English. Russian original) Zbl 1230.49025

Autom. Remote Control 72, No. 6, 1282-1290 (2011); translation from Avtom. Telemekh. 2011, No. 6, 151-159 (2011).
Summary: In the general vein of V.F. Krotov’s theory, we formulate an approach to nonlocal improvement based on sufficient optimality and improvement conditions. We propose constructive approaches to specifying the resolving function that realizes Krotov’s approach for arbitrary systems via linear partial differential equations and their discrete counterparts, namely linear recurrent relations. Examples are given.

MSC:

49M05 Numerical methods based on necessary conditions
49K20 Optimality conditions for problems involving partial differential equations
Full Text: DOI

References:

[1] Krotov, V.F. and Fel’dman I.N., An Iterative Method for Solving Optimal Control Problems, Izv. Akad. Nauk SSSR, Tekhn. Kibern., 1983, no. 2, pp. 160–168.
[2] Krotov, V.F., Global Methods in Optimal Control Theory, New York: Marcel Dekker, 1996. · Zbl 1075.49500
[3] Krotov, V.F., On Control Optimization in Quantum Systems, Dokl. Ross. Akad. Nauk, 2008, vol. 423, no. 3, pp. 316–319. · Zbl 1199.93027
[4] Krotov, V.F., Control of the Quantum Systems and Some Ideas of the Optimal Control Theory, Autom. Remote Control, 2009, vol. 70, no. 3, pp. 357–365. · Zbl 1163.49041 · doi:10.1134/S0005117909030035
[5] Krotov, V.F. and Gurman, V.I., Metody i zadachi optimal’nogo upravleniya (Methods and Problems of Optimal Control), Moscow: Nauka, 1973. · Zbl 0271.49003
[6] Gurman, V.I., Printsip rasshireniya v zadachakh upravleniya (Extension Principle in Control Problems), Moscow: Nauka, 1997. · Zbl 0905.49001
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.