On the Goldstein-Levitin-Polyak gradient projection method
暂无分享,去创建一个
[1] A. Goldstein. Convex programming in Hilbert space , 1964 .
[2] Sanjoy K. Mitter,et al. Successive approximation methods for the solution of optimal control problems , 1966, Autom..
[3] L. Armijo. Minimization of functions having Lipschitz continuous first partial derivatives. , 1966 .
[4] Boris Polyak,et al. Constrained minimization methods , 1966 .
[5] Allen A. Goldstein,et al. Constructive Real Analysis , 1967 .
[6] J. Daniel. On the approximate minimization of functionals , 1969 .
[7] G. McCormick. The Variable Reduction Method for Nonlinear Programming , 1970 .
[8] Leon S. Lasdon,et al. Optimization Theory of Large Systems , 1970 .
[9] E. M. L. Beale,et al. Nonlinear Programming: A Unified Approach. , 1970 .
[10] James M. Ortega,et al. Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.
[11] E. Polak,et al. Computational methods in optimization : a unified approach , 1972 .
[12] G. McCormick,et al. The Gradient Projection Method under Mild Differentiability Conditions , 1972 .
[13] M. Ciletti,et al. The computation and theory of optimal control , 1972 .
[14] Kantorovich Estimates for Some Convex Programs , 1973 .
[15] E. Polak. Introduction to linear and nonlinear programming , 1973 .
[16] Edward J. Davison,et al. Clipping-off gradient algorithms to compute optimal controls with constrained magnitude , 1974 .