摘要
本文对无约束函数极小化的超记忆下降法在每次迭代需要实现一个多维搜索问题转化为只实现若干个线搜索问题。从而大大减少计算工作量。
This paper shows that supermemory descent methods for unconstrained function minimization required to perform a tnultidimensional search problems at each iteration to be changedinto only solving a series of iine searches probems. Hence greatly reduce the computational labor.
出处
《贵州大学学报（自然科学版）》
1991年第3期167-173,共7页
Journal of Guizhou University:Natural Sciences
关键词
无约束极小化
下降法
线搜索
Unconstrained function minimization, Descent methods, Quadratically conrergent algorithms, Supermernory descent methods.
