Numerical methods for optimal control problems with ODE or integral equations

15Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

An overview of numerical methods for solving optimal control problems described by ODE and integral equations is presented. We consider direct and indirect methods. The finer indirect methods use necessary optimality conditions. Direct methods transform the control problem after discretization to an optimization problem. The nonlinear optimization problem can be solved by means of SQP-methods or gradient methods. Known variants of this method are GESOP and DIRCOL. Then a wave-method is mentioned, in which the state variables are varied at first. The direct methods apply the maximum principle, often it is possible to eliminate the control with the help of the necessary condition. The control problem is transformed to a boundary value problem for the state and the adjoint variable, which is solved by multiple shooting. The iterative procedures of Krylow/Chernousko and Sakawa, respectively, are based on the maximum principle, too. It is referred to the gradient methods described in the monograph of Pytlak and to prox-methods. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Schmidt, W. H. (2006). Numerical methods for optimal control problems with ODE or integral equations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3743 LNCS, pp. 255–262). Springer Verlag. https://doi.org/10.1007/11666806_28

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free