An efficient algorithm for solving optimal control problems with linear terminal constraints
- 1 April 1976
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 21 (2) , 275-277
- https://doi.org/10.1109/tac.1976.1101176
Abstract
The optimization of nonlinear systems subject to linear terminal state variable constraints is considered. A technique for solving this class of problems is proposed that involves a piecewise polynomial parameterization of the system variables. The optimal control problem is thereby reduced to a linearly constrained parameter optimization problem which can be solved efficiently using the quadratically convergent Gold-farb-Lapidus algorithm. Illustrative numerical examples are presented.Keywords
This publication has 6 references indexed in Scilit:
- A numerical study of augmented penalty function algorithms for terminally constrained optimal control problemsJournal of Optimization Theory and Applications, 1974
- Computation of constrained optimal controls using parameterization techniquesIEEE Transactions on Automatic Control, 1974
- Summary and comparison of gradient-restoration algorithms for optimal control problemsJournal of Optimization Theory and Applications, 1972
- A generalized gradient method for optimal control problems with inequality constraints and singular arcsIEEE Transactions on Automatic Control, 1972
- On a New Computing Technique in Optimal ControlSIAM Journal on Control, 1968
- Conjugate Gradient Method for Nonlinear Programming Problems with Linear ConstraintsIndustrial & Engineering Chemistry Fundamentals, 1968