At last the global convergence is obtained. 最后給出全局收斂性分析。
Under mild conditions, we show that the algorithm is globally convergent. 在較弱的條件下，我們證明了算法的全局收斂性。
Global convergence and local superlinear convergence rate of the proposed algorithm are established on some reasonable conditions. 在合理的假設條件下，證明了算法的整體收斂性與局部超線(xiàn)性收斂速率。
The nonmonotone line search algorithm for nonsmooth optimization given by Pang is extended to this case, and we prove that the algorithm is globally convergent. 五，研究了非光滑極大極小無(wú)約束最優(yōu)化問(wèn)題，給出了一個(gè)線(xiàn)性搜索算法，并證明其整體收斂性。
