Abstract
We consider a constrained optimal control problem, which we formulate in classical and in relaxed form. In order to approximate this problem numerically, we apply various discretization schemes on either of these two forms and study the behavior in the limit of discrete optimality and necessary conditions for optimality. We then propose discrete mixed gradient penalty methods that use classical or relaxed discrete controls and progressively refine the discretization, thus reducing computing time and memory. In addition, when the discrete adjoint state is not defined or difficult to calculate, we propose discrete methods that use approximate adjoints and derivatives. The result is that in relaxed methods accumulation points of generated sequences satisfy continuous strong relaxed optimality conditions, while in classical methods they satisfy weak optimality conditions.
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., Bacopoulos, A.: Discrete approximation of relaxed optimal control problems. Journal of Optimization Theory and Applications, 65, 3 (1990) 395–407.
Chryssoverghi, I., Bacopoulos, A.: Approximation of relaxed nonlinear parabolic optimal control problems. JOTA, 77, 1 (1993) 31–50.
Chryssoverghi, I., Bacopoulos, A., Kokkinis, B., Coletsos, J.: Mixed Frank-Wolfe penalty method with applications to nonconvex optimal control problems. JOTA, 94, 2 (1997) 311–334.
Chryssoverghi, I., Bacopoulos, A., Coletsos, J., Kokkinis, B.: Discrete approximation of nonconvex hyperbolic optimal control problems with state constraints. Control & Cybernetics, 27, 1 (1998) 29–50.
Chryssoverghi, I., Coletsos, J., Kokkinis, B.: Discrete relaxed method for semilinear parabolic optimal control problems. Control & Cybernetics, 28, 2 (1999) 157–176.
Chryssoverghi, I., Coletsos, J., Kokkinis, B.: Approximate relaxed descent method for optimal control problems. Control & Cybernetics, 30, 4 (2001) 385–404.
Dontchev, A.L., Hager, W. Veliov, V.: Second-order Runge-Kutta approximations in control constrained optimal control. SIAM J. Numer. Anal., 38 (2000) 202–226.
Polak, E.: Optimization: Algorithms and Consistent Approximations. Springer, Berlin (1997)
RoubÃcek, T.: A convergent computational method for constrained optimal relaxed control problems. JOTA, 69 (1991) 589–603.
RoubÃcek, T.: Relaxation in Optimization Theory and Variational Calculus. Walter de Gruyter, Berlin (1997)
Warga, J.: Optimal Control of Differential and Functional Equations. Academic Press, New York (1972)
Warga, J.: Steepest descent with relaxed controls. SIAM J. on Control, 15, 4 (1977) 674–689.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chryssoverghi, I. (2003). Discrete Methods for Optimal Control Problems. In: Dimov, I., Lirkov, I., Margenov, S., Zlatev, Z. (eds) Numerical Methods and Applications. NMA 2002. Lecture Notes in Computer Science, vol 2542. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36487-0_22
Download citation
DOI: https://doi.org/10.1007/3-540-36487-0_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00608-4
Online ISBN: 978-3-540-36487-0
eBook Packages: Springer Book Archive