Abstract
We consider an optimal control problem described by ordinary differential equations, with control and state constraints. The state equation is first discretized by a general explicit Runge-Kutta scheme and the controls are approximated by piecewise polynomial functions. We then propose approximate gradient and gradient projection methods, and their penalized versions, that construct sequences of discrete controls and progressively refine the discretization during the iterations. Instead of using the exact discrete cost derivative, which usually requires tedious calculations of composite functions, we use here an approximate derivative of the cost defined by discretizing the continuous adjoint equation by the same, but nonmatching, Runge-Kutta scheme backward and the integral involved by a Newton-Cotes integration rule. We show that strong accumulation points in L 2 of sequences constructed by these methods satisfy the weak necessary conditions for optimality for the continuous problem. Finally, numerical examples are given.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chryssoverghi, I., Coletsos, J., Kokkinis, B.: Approximate relaxed descent method for optimal control problems. Control Cybernet 30, 385–404 (2001)
Chryssoverghi, I., Coletsos, J., Kokkinis, B.: Approximate gradient projection method with Runge-Kutta schemes for optimal control problems. Comput. Optim. Appl. 29, 91–115 (2004)
Dontchev, A.L.: An a priori estimate for discrete approximations in nonlinear optimal control. SIAM J. Control Optimization 34, 1315–1328 (1996)
Dontchev, A.L., Hager, W.W., Veliov, V.M.: Second-order Runge-Kutta approximations in control constrained optimal control. SIAM J. Numer. Anal. 38, 202–226 (2000)
Dunn, J.C.: On L2 sufficient conditions and the gradient projection method for optimal control problems. SIAM J. Control Optim. 34, 1270–1290 (1996)
Enright, W.H., Jackson, K.R., Norsett, S.P., Thomsen, P.G.: Interpolants for Runge-Kutta formulas. ACM TOMS 12, 193–218 (1986)
Malanowski, K., Buskens, C., Maurer, H.: Convergence of approximations to nonlinear optimal control problems. In: Mathematical Programming with Data Perturbations. Lecture Notes Pure Applied Mathematics, vol. 195, pp. 253–284. Dekker, New York (1998)
Papakostas, S.N., Tsitouras, C.: Highly continuous interpolants for one-step ODE solvers and their application to Runge-Kutta methods. SIAM J. Numer. Anal. 34, 22–47 (1997)
Polak, E.: Optimization Algorithms and Consistent Approximations. Springer, Berlin (1997)
Schwartz, A., Polak, E.: Consistent approximations for optimal control problems based on Runge-Kutta integration. SIAM J. Control Optim. 34, 1235–1269 (1996)
Veliov, V.M.: On the time-discretization of control systems. SIAM J. Control Optim. 35, 1470–1486 (1997)
Warga, J.: Optimal control of Differential and Functional Equations. Academic Press, New York (1972)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chryssoverghi, I. (2006). Approximate Gradient/Penalty Methods with General Discretization Schemes for Optimal Control Problems. In: Lirkov, I., Margenov, S., Waśniewski, J. (eds) Large-Scale Scientific Computing. LSSC 2005. Lecture Notes in Computer Science, vol 3743. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11666806_21
Download citation
DOI: https://doi.org/10.1007/11666806_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31994-8
Online ISBN: 978-3-540-31995-5
eBook Packages: Computer ScienceComputer Science (R0)