摘要
论述了一个有效的用于无约束最优化方法的线性搜索方法，该方法是Ｆｌｅｔｃｈｅｒ线性搜索方法的一个修正，它具有减少梯度值计算次数，确定适当步长以提高优化方法有效性的特点。
An efficient line search scheme for unconstrained minimigation is presented which is a modification of fletcher's line search lagorithm and with which fewer gradient evaluations are used to find a suitatle step length. Substantial gains in efficiency of an optimigation methods can be obtained by employing this line search scheme.
