Abstract
An optimal control problem is considered, for systems defined by nonlinear ordinary differential equations, with control and pointwise state constraints. Since the problem may have no classical solutions, it is also formulated in the relaxed form. Various necessary/sufficient conditions for optimality are first given for both formulations. In order to solve these problems numerically, we then propose a discrete penalized gradient projection method generating classical controls, and a discrete penalised conditional descent method generating relaxed controls. In both methods, the discretization procedure is progressively refining in order to achieve efficiency with reduced computational cost. Results are given concerning the behaviour in the limit of these methods. Finally, numerical examples are provided.
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
Azhmyakov, V., Schmidt, W.: Approximations of Relaxed Optimal Control Problems. J. of Optimization Theory and Applications 130(1), 61–77 (2006)
Chryssoverghi, I., Bacopoulos, A.: Discrete approximation of relaxed optimal control problems. J. of Optimization Theory and Applications 65(3), 395–407 (1990)
Chryssoverghi, I., Coletsos, J., Kokkinis, B.: Approximate relaxed descent method for optimal control problems. Control and Cybernetics 30(4), 385–404 (2001)
Chryssoverghi, I.: Discrete gradient projection method with general Runge-Kutta schemes and control parameterizations for optimal control problems. Control and Cybernetics 34, 425–451 (2005)
Chryssoverghi, I., Coletsos, J., Kokkinis, B.: Discretization methods for nonconvex optimal control problems with state constraints. Numer. Funct. Anal. Optim. 26, 321–348 (2005)
Chryssoverghi, I., Coletsos, J., Kokkinis, B.: Discretization methods for optimal control problems with state constraints. J. of Computional and Applied Mathematics 191, 1–31 (2006)
Chryssoverghi, I.: Discretization methods for semilinear parabolic optimal control problems. Intern. J. of Numerical Analysis and Modeling 3, 437–458 (2006)
Roubíček, 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. Control Optim., 674–682 (1977)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chryssoverghi, I., Coletsos, J., Kokkinis, B. (2012). Classical and Relaxed Progressively Refining Discretization-Optimization Methods for Optimal Control Problems Defined by Ordinary Differential Equations. In: Lirkov, I., Margenov, S., Waśniewski, J. (eds) Large-Scale Scientific Computing. LSSC 2011. Lecture Notes in Computer Science, vol 7116. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29843-1_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-29843-1_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29842-4
Online ISBN: 978-3-642-29843-1
eBook Packages: Computer ScienceComputer Science (R0)