Exploiting Sparsity in the Direct Transcription Method for Optimal Control

@article{Betts1999ExploitingSI,
  title={Exploiting Sparsity in the Direct Transcription Method for Optimal Control},
  author={John T. Betts and William P. Huffman},
  journal={Comp. Opt. and Appl.},
  year={1999},
  volume={14},
  pages={179-201}
}
In the direct transcription method an approximation to an optimal control problem is constructed by discretization of the state and control variables. The control problem is thus transcribed into a large scale constrained optimization problem with a finite number of variables. It is necessary to solve the nonlinear programming (NLP) problem produced by the discretization as efficiently as possible, and research has focused on methods for solving the underlying NLP when the relevant Jacobian and… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 22 references

Experience with a sparse nonlinear programming algorithm,” in Large-Scale Optimization with Applications

J. T. Betts
volume 93 of the IMA Volumes in Mathematics and its Application, • 1997

Software for nonlinear optimization,” Mathematics and Engineering Analysis Library Report MEA-LR-83 R1, Boeing Information and Support Services, The Boeing Company, P.O

J. T. Betts, M. J. Carter, W. P. Huffman
Box 3707, • 1997

Sparse optimal control software SOCS,” Mathematics and Engineering Analysis Technical Document MEA-LR-085, Boeing Information and Support Services, The Boeing Company, P.O

J. T. Betts, W. P. Huffman
Box 3707, • 1997
View 1 Excerpt

Projected Sequential Quadratic Programming Methods

SIAM Journal on Optimization • 1996
View 1 Excerpt

W

P. E. Gill
Murray, and M.A. Saunders, “SNOPT: An SQP algorithm for large-scale constrained optimization,” Technical Report SOL 96-0, Department of Operations Research, Stanford University, • 1996

A generalized reduced gradient algorithm for large-scale trajectory optimization problems,” in Optimal Design and Control, Proceedings of the Workshop on Optimal Design and Control, J

K. E. Brenan, W. P. Hallman
Borggaard, J. Burkardt, M. Gunzburger, and J. Peterson (Eds.), volume 19 of Progress in Systems and Control Theory, Birkh ̈ auser: Basel, April • 1994

A sparse nonlinear optimization algorithm,” Journal of Optimization Theory and Applications, vol

J. T. Betts, P. D. Frank
82, no. 3, pp. 519–541, • 1994

Issues in the direct transcription of optimal control problems to sparse nonlinear programs,” in Computational Optimal Control, R

J. T. Betts
Bulirsch and D. Kraft (Eds.), volume 115 of International Series of Numerical Mathematics, Birkh ̈ auser Verlag: Basel, • 1994

Path constrained trajectory optimization using Sparse sequential quadratic programming,” AIAA Journal of Guidance, Control, and Dynamics, vol

J. T. Betts, W. P. Huffman
16, no. 1, pp. 59–68, • 1993

Trajectory optimization using sparse sequential quadratic programming,” in Optimal Control, Roland Bulirsch, Angelo Miele, Josef Stoer, and Klaus H

J. T. Betts
Well (Eds.), volume 111 of International Series of Numerical Mathematics, Birkh ̈ auser Verlag: Basel, • 1993

Similar Papers

Loading similar papers…