Abstract
This paper considers the problem of minimizing a functionalI which depends on the statex(t), the controlu(t), and the parameter π. Here,I is a scalar,x ann-vector,u anm-vector, and π ap-vector. At the initial point, the state is prescribed. At the final point, the state and the parameter are required to satisfyq scalar relations. Along the interval of integration, the state, the control, and the parameter are required to satisfyn scalar differential equations.
Four types of gradient-restoration algorithms are considered, and their relative efficiency (in terms of number of iterations for convergence) is evaluated. The algorithms being considered are as follows: sequential gradient-restoration algorithm, complete restoration (SGRA-CR), sequential gradient-restoration algorithm, incomplete restoration (SGRA-IR), combined gradient-restoration algorithm, no restoration (CGRA-NR), and combined gradient-restoration algorithm, incomplete restoration (CGRA-IR).
Evaluation of these algorithms is accomplished through six numerical examples. The results indicate that (i) the inclusion of a restoration phase is necessary for rapid convergence and (ii) while SGRA-CR is the most desirable algorithm if feasibility of the suboptimal solutions is required, rapidity of convergence to the optimal solution can be increased if one employs algorithms with incomplete restoration, in particular, CGRA-IR.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Miele, A., Pritchard, R. E., andDamoulakis, J. N.,Sequential Gradient-Restoration Algorithm for Optimal Control Problems, Journal of Optimization Theory and Applications, Vol. 5, No. 4, 1970.
Miele, A.,Combined Gradient-Restoration Algorithm for Optimal Control Problems, Rice University, Aero-Astronautics Report No. 91, 1971.
Miele, A.,Gradient Methods in Optimal Control Theory, Rice University, Aero-Astronautics Report No. 98, 1971.
Bliss, G. A.,Lectures on the Calculus of Variations, The University of Chicago Press, Chicago, 1946.
Hestenes, M. R.,Calculus of Variations and Optimal Control Theory, John Wiley and Sons, New York, 1966.
Pontryagin, L. S., Boltyanskii, V. G., Gamkrelidze, R. V., andMishchenko, E. F.,The Mathematical Theory of Optimal Processes, John Wiley and Sons (Interscience Publishers), New York, 1962.
Miele, A., Editor,Theory of Optimum Aerodynamic Shapes, Academic Press, New York, 1965.
Miele, A.,Method of Particular Solution for Linear, Two-Point Boundary-Value Problems, Journal of Optimization Theory and Applications, Vol. 2, No. 4, 1968.
Ralston, A.,Numerical Integration Methods for the Solution of Ordinary Differential Equations, Mathematical Methods for Digital Computers, Vol. 1, Edited by A. Ralston and H. S. Wilf, John Wiley and Sons, New York, 1960.
Miele, A.,Iyer, R. R., andWell, K. H.,Modified Quasilinearization and Optimal Initial Choice of the Multipliers, Part 2, Optimal Control Problems, Journal of Optimization Theory and Applications, Vol. 6, No. 5, 1970.
Miele, A., Tietze, J. L., andLevy, A. V.,Comparison of Several Gradient Algorithms for Mathematical Programming Problems, Rice University, Aero-Astronautics Report No, 94, 1972.
Additional Bibliography
Bryson, A. E., Jr., andDenham, W. F.,A Steepest-Ascent Method for Solving Optimum Programming Problems, Journal of Applied Mechanics, Vol. 84, No. 2, 1962.
Kelley, H. J.,Gradient Theory of Optimal Flight Paths, ARS Journal, Vol. 30, No. 10, 1960.
Author information
Authors and Affiliations
Additional information
This research was supported by the Office of Scientific Research, Office of Aerospace Research, United States Air Force, Grant No. AF-AFOSR-72-2185.
Rights and permissions
About this article
Cite this article
Miele, A., Tietze, J.L. & Levy, A.V. Summary and comparison of gradient-restoration algorithms for optimal control problems. J Optim Theory Appl 10, 381–403 (1972). https://doi.org/10.1007/BF00935401
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00935401