Back to Search
Start Over
Evaluating Gradients in Optimal Control: Continuous Adjoints versus Automatic Differentiation.
- Source :
- Journal of Optimization Theory & Applications; Jul2004, Vol. 122 Issue 1, p63-86, 24p
- Publication Year :
- 2004
-
Abstract
- This paper deals with the numerical solution of optimal control problems for ODEs. The methods considered here rely on some standard optimization code to solve a discretized version of the control problem under consideration. We aim to make available to the optimization software not only the discrete objective functional, but also its gradient. The objective gradient can be computed either from forward (sensitivity) information or backward (adjoint) information. The purpose of this paper is to discuss various ways of adjoint computation. It will be shown both theoretically and numerically that methods based on the continuous adjoint equation require a careful choice of both the integrator and gradient assembly formulas in order to obtain a gradient consistent with the discretized control problem. Particular attention is given to automatic differentiation techniques which generate automatically a suitable integrator. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00223239
- Volume :
- 122
- Issue :
- 1
- Database :
- Complementary Index
- Journal :
- Journal of Optimization Theory & Applications
- Publication Type :
- Academic Journal
- Accession number :
- 14882054
- Full Text :
- https://doi.org/10.1023/B:JOTA.0000041731.71309.f1