摘要
无约束函数极小的记忆梯度法在每次迭代需要作一次二维搜索。本文建立了一个无二维搜索的记忆梯度法,把二维搜索转化成两个线搜索.从而减化了计算工作量。
Memory gradient method for unconstained function minimization at each iteration reguires a two-dimensional searchs.This paper suggests a memory gradient method without two-dimensional searchs,and the transformation from the two-dimensional searchs into a two line searchs. Thus the computation efforts are reduced.
出处
《贵州大学学报（自然科学版）》
1990年第2期14-24,共11页
Journal of Guizhou University:Natural Sciences
关键词
无约束极小
记忆梯度法
二维搜索
unconstrined minimization
steepest descent method
memory gradint method
memory gradient method without two-dimensional searchs
