An Historical Survey of Computational Methods in Optimal Control
Author:
- E. PolakEPE. Polak
- 1 April 1973
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Review
- Vol. 15 (2) , 553-584
Abstract
The last twenty years have seen a great flourishing in optimal control theory. In this paper, we shall highlight some of the salient theoretical developments in the specific area of algorithms. The first algorithms for optimal control were aimed at unconstrained problems and were derived by using first and second variation methods of the calculus of variations. These methods have subsequently been recognized as gradient, Newton–Raphson, or Gauss–Newton methods in function space. A much more recent addition to the arsenal of unconstrained optimal control algorithms are several variations of conjugate gradient methods. At first, constrained optimal control problems could only be solved by exterior penalty function methods. Later algorithms specifically designed for constrained problems have appeared. Among these we find methods for solving the unconstrained linear quadratic regulator problem as well as certain constrained minimum time and minimum energy problems. Differential-dynamic programming was developed from dynamic programming considerations. The conditional gradient method, the gradient projection method and a couple of feasible directions methods were obtained as extensions or adaptations of related algorithms for finite-dimensional problems. Finally, the so-called $\varepsilon $-methods combine the Ritz method with penalty function techniques. Some of the recent work has dealt with discretization effects. This has led to the concept of well-posedness of a problem and to adaptive integration techniques.Keywords
This publication has 94 references indexed in Scilit:
- Les méthodes de «descente» dans la théorie de l'optimisationRevue française d'informatique et de recherche opérationnelle, 1968
- A convergent gradient procedure in prehilbert spacesPacific Journal of Mathematics, 1966
- Minimization of functions having Lipschitz continuous first partial derivativesPacific Journal of Mathematics, 1966
- On Steepest DescentJournal of the Society for Industrial and Applied Mathematics Series A Control, 1965
- Cauchy's method of minimizationNumerische Mathematik, 1962
- A Steepest-Ascent Method for Solving Optimum Programming ProblemsJournal of Applied Mechanics, 1962
- Über den optimalen Temperaturverlauf im ReaktionsrohrChemie Ingenieur Technik, 1960
- The Optimization of TrajectoriesJournal of the Society for Industrial and Applied Mathematics, 1959
- Gradient methods of maximizationPacific Journal of Mathematics, 1955
- The method of steepest descent for non-linear minimization problemsQuarterly of Applied Mathematics, 1944