摘要
本文在目标函数是一致凸且采用Wolfe线搜索的条件下，给出无约束最优化问题的DFP算法的全局收敛性的几个充分性条件，并与[1]中的条件进行了比较．
In this paper, for unconstrained optimization problems with uniformly convex objective functions, several sufficient conditions are given for the global convergence of DFP algorithm with Wolf e inexact line search, and compared with [1].
出处
《应用数学学报》
CSCD
北大核心
1998年第2期179-186,共8页
Acta Mathematicae Applicatae Sinica
