Convergence Rates of Quasi-Newton Algorithms for Some Non-Smooth Optimization Problems
SIAM journal on control and optimization(1985)
摘要
In this paper we consider a class of nonsmooth optimization problems and investigate an algorithm which makes use of approximations of the derivative. We study a growth condition on the objective and various conditions on the step-sizes and the Quasi-Newton operators to obtain linear, superlinear and quadratic rates of convergence. These results are applied to a class of Broyden updates and two inexact step-size rules.
更多查看译文
关键词
nonsmooth optimization,quasi-Newton methods,superlinear convergence rate.
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要