期刊
MATHEMATICAL PROGRAMMING
卷 152, 期 1-2, 页码 491-520出版社
SPRINGER HEIDELBERG
DOI: 10.1007/s10107-014-0794-9
关键词
Global convergence; Worst-case complexity; Trust-region methods; Regularization methods; Unconstrained Optimization; Composite nonsmooth optimization; Multiobjective optimization
类别
资金
- CAPES, Brazil [PGCI 12347/12-4]
- CNPq, Brazil
- NSFC, China [11331012]
A nonlinear stepsize control framework for unconstrained optimization was recently proposed by Toint (Optim Methods Softw 28:82-95, 2013), providing a unified setting in which the global convergence can be proved for trust-region algorithms and regularization schemes. The original analysis assumes that the Hessians of the models are uniformly bounded. In this paper, the global convergence of the nonlinear stepsize control algorithm is proved under the assumption that the norm of the Hessians can grow by a constant amount at each iteration. The worst-case complexity is also investigated. The results obtained for unconstrained smooth optimization are extended to some algorithms for composite nonsmooth optimization and unconstrained multiobjective optimization as well.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据