Relation between the memory gradient method and the Fletcher-Reeves method
暂无分享,去创建一个
The minimization of a function of unconstrained variables is considered using the memory gradient method. It is shown that, for the particular case of a quadratic function, the memory gradient algorithm and the Fletcher-Reeves algorithm are identical.
[1] C. M. Reeves,et al. Function minimization by conjugate gradients , 1964, Comput. J..
[2] Joel Wood Cantrell. Method of independent multipliers for minimizing unconstrained functions , 1969 .
[3] A. Miele,et al. Study on a memory gradient method for the minimization of functions , 1969 .