非凸非精确线搜索时Broyden算法的收敛性(英文)

The convergence of Broyden algorithms without convexity and exact line search

讨论在非凸非精确线搜索时,Broyden算法的的收敛性,证明当Broyden算法得到的点列收敛时,该点列一定趋向于稳定点。

In this paper we discuss the convergence of the Broyden algorithms without convexity and exact line search assumptions. We prove that if the algorithm produces a convergence point sequence, then the limit point of the sequence is a critical point of the objective function. Q-integral graphs.