PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Tytuł artykułu

Approximate gradient projection method with general Runge-Kutta schemes and piecewise polynomial controls for optimal control problems

Treść / Zawartość
Identyfikatory
Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
This paper addresses the numerical solution of optimal control problems for systems described by ordinary differential equations with control constraints. The state equation is discretized by a general explicit Runge-Kutta scheme and the controls are approximated by functions that are piecewise polynomial, but not necessarily continuous. We then propose an approximate gradient projection method that constructs sequences of discrete controls and progressively refines the discretization. Instead of using the exact discrete cost derivative, which usually requires tedious calculations, we use here an approximate derivative of the cost functional denned by discretizing the continuous adjoint equation by the same Runge-Kutta scheme backward and the integral involved by a Newton-Cotes integration rule, both involving maximal order intermediate approximations. The main result is that strong accumulation points in L2, if they exist, of sequences generated by this method satisfy the weak necessary conditions for optimality for the continuous problem. In the unconstrained case and under additional assumptions, we prove strong convergence in L2 and derive an a posteriori error estimate. Finally, numerical examples are given.
Rocznik
Strony
425--451
Opis fizyczny
Bibliogr. 14 poz., wykr.
Twórcy
  • Department of Mathematics, School of Applied Mathematics and Physics National Technical University Zografou Campus 157 80 Athens, Greece
Bibliografia
  • Chryssoverghi, I., Coletsos, J. and Kokkinis, B. (1999) Discrete relaxed method for semilinear parabolic optimal control problems. Control and Cybernetics 28 (2), 157–176.
  • Chryssoverghi, I., Coletsos, J. and Kokkinis, B. (2001) Approximate relaxed descent method for optimal control problems. Control and Cybernetics 30 (4), 385–404.
  • Dontchev, A.L., Hager, W.W., Poore, A.B. and Yang, B. (1995) Optimality, stability, and convergence in nonlinear control. Applied Mathematics and Optimization 31 (3), 297–326.
  • Dontchev, A.L. (1996) An a priori estimate for discrete approximations in nonlinear optimal control. SIAM J. Control Optimization 34 (4), 1315–1328.
  • Dontchev, A.L., Hager, W.W. and Veliov, V.M. (2000) Second-order Runge-Kutta approximations in control constrained optimal control. SIAM J. Numerical Analysis 38 (1), 202–226.
  • Dunn, J.C. (1996) On L2 sufficient conditions and the gradient projection method for optimal control problems. SIAM J. Control Optimization 34 (4), 1270–1290.
  • Enright, W.H., Jackson, K.R., Norsett, S.P. and Thomsen, P.G. (1986) Interpolants for Runge-Kutta formulas. ACM TOMS 12, 193–218.
  • Hairer, E., Norsett, S.P. and Wanner, G. (1993) Solving Ordinary Differential Equations I. Springer, Berlin.
  • Malanowski, K., Buskens, C. and Maurer, H. (1998) Convergence of approximations to nonlinear optimal control problems, Mathematical Programming with Data Perturbations. Lecture Notes Pure Appl. Math., Dekker, New York, 195, 253–284.
  • Papakostas, S.N., and Tsitouras, CH. (1997) Highly continuous interpolants for one-step ODE solvers and their application to Runge-Kutta methods. SIAM J. Numer. Anal. 34, 22–47.
  • Polak, E.(1997) Optimization: Algorithms and Consistent Approximations. Springer, Berlin.
  • Schwartz A. and Polak, E., (1996) Consistent approximations for optimal control problems based on Runge-Kutta integration. SIAM J. Control and Optimization 34 (4), 1235–1269.
  • Thomee, V. (1997) Galerkin Finite Element Methods for Parabolic Problems. Springer, Berlin.
  • Veliov, V.M. (1997) On the time-discretization of control systems. SIAM J. Control and Optimization 35 (5), 1470–1486.
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-BAT5-0007-0097
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.