Newton's Method for Linear Optimal Control Problems*
暂无分享,去创建一个
[1] D. Bertsekas,et al. Combined Primal–Dual and Penalty Methods for Convex Programming , 1976 .
[2] D. Bertsekas. ON PENALTY AND MULTIPLIER METHODS FOR CONSTRAINED MINIMIZATION , 1976 .
[3] Dimitri P. Bertsekas,et al. Necessary and sufficient conditions for a penalty method to be exact , 1975, Math. Program..
[4] D. Bertsekas. Multiplier methods: A survey , 1975, Autom..
[5] Alan S. Manne,et al. Nested decomposition for dynamic models , 1974, Math. Program..
[6] R. Rockafellar. The multiplier method of Hestenes and Powell applied to convex programming , 1973 .
[7] R. Tyrrell Rockafellar,et al. A dual approach to solving nonlinear programming problems by unconstrained optimization , 1973, Math. Program..
[8] C. R. Glassey. Nested Decomposition and Multi-Stage Linear Programs , 1973 .
[9] D. Bertsekas,et al. A new penalty function method for constrained minimization , 1972, CDC 1972.
[10] Sanjoy K. Mitter,et al. Successive approximation methods for the solution of optimal control problems , 1966, Autom..