您要查找的是不是：
- Global Convergence of a New Conjugate Gradient Method with Generalized Wolfe Line Search 广义Wolfe线搜索下一类新共轭梯度法的全局收敛性
- Global Convergence of Conjugate Gradient Method with General Wolfe Line Search 广义Wolfe线搜索下共轭梯度法的全局收敛性
- generalized Wolfe line search 广义Wolfe线搜索
- In chapter 2, we propose a new inexact line search and demonstrated its feasibility. We get promotion Zoutendijk condition. And then we made a comparison of the traditional Wolfe line search. 在第二章中我们提出了新的非精确线搜索，并证明了它的可行性，得到了推广的Zoutendijk条件，随后还和传统的Wolfe线搜索做了比较。
- In this paper, the Wolfe line search is used to replace the Armijo line search in the BFGS-SQP algorithm, through the same analysis as Chen, the algorithm even has global and q-super-linear convergence. 本文采用Wolfe线性搜索原则来替代该BFGS-SQP算法的Armijo原则，经过类似的分析，同样得到了BFGS-SGP算法的全局收敛性及超线性收敛性。
- Wolfe line search Wolfe线搜索
- strong Wolfe line search 强Wolfe线性搜索
- Wolfe line search conditions Wolfe线搜索
- weak Wolf line search 弱Wolfe线搜索
- Wolf line search Wolfe线搜索
- British forces under General Wolfe defeated the French forces led by General Montcalm at the Plains of Abraham here in 1759. 1759年，在这里的亚伯拉罕平原上，由伍尔夫将军率领的英国军队击败了由蒙卡尔姆将军率领的法国军队。
- CONVERGENCE OF THE FLETCHER-REEVES METHOD UNDER A GENERALIZED WOLFE SEARCH 广义Wolfe线搜索下Fletcher-Reeves方法的收敛性
- In chapter 3, we will mainly consider the Fletcher-Reeves algorithm under the new line search. 在第三章中我们将主要考虑新线搜索下的FR算法。
- Zhou J. L. and Tits A.L, Nonmotone line search for minimax problems, JOTA 76:3 (1993), 455-476. 周方俊等,一类新的非单调曲线搜索算法,运筹与决策;1(1992),340-345(成都科大出版社)
- However, the PRP method even with the exact line search is not globally convergent on nonconvex functions. 然而，对一般非凸函数，PRP方法即使采用精确线搜索也不能保证全局收敛。
- Under relatively weak conditions, we proved that this modified method converges globally with nonmonotone line search. 在较弱的条件下，证明了此类非单调修正HS算法具有全局收敛性。
- The convergence properties of NCG methods with three inexact line searche. 讨论在三种非精确线搜索下,NCG法的收敛性质。
- In this chapter, under suitable conditions we prove that the modified DFP method is globally convergent with weak Wolfe-Powell line search . 本章在适当的条件下，证明上述修正DFP方法在弱Wolfe-Powell线搜索下是全局收敛的。
- The method not only avoids resolving the subproblem repeatedly but also reduces the numbers of computing function values in the line search algorithm. 既避免了重复求解信赖域子问题，又减少了线搜索方法计算函数值的次数。
- John's a lone wolf; never mucks in with the others. 约翰是一位单干的家伙，从不与别的人搞在一起。
