关于ND算法的几点讨论

本文对《基于二阶导数的优化算法》一文中提出的ND算法的收敛性等问题进行了讨论。从理论上证明了：当步长充分小时，ND算法较梯度法收敛速度快。计算机计算结果也证实了ND算法有较快的收敛速度。

Few Discussion with ND Algorithm

In this paper, convergence of ND algorithm that is presented in A Study on the optimization Algorithm with the lntroduction of Second Derivative is discussed. It is proved that the convergence rate of ND algorithm is faster than that of the gradient method when the staged is small enough. the results in computer show it.