Concise Complexity Analyses for Trust-Region Methods
Optimization and Control
2018-02-23 v1
Abstract
Concise complexity analyses are presented for simple trust region algorithms for solving unconstrained optimization problems. In contrast to a traditional trust region algorithm, the algorithms considered in this paper require certain control over the choice of trust region radius after any successful iteration. The analyses highlight the essential algorithm components required to obtain certain complexity bounds. In addition, a new update strategy for the trust region radius is proposed that offers a second-order complexity bound.
Cite
@article{arxiv.1802.07843,
title = {Concise Complexity Analyses for Trust-Region Methods},
author = {Frank E. Curtis and Zachary Lubberts and Daniel P. Robinson},
journal= {arXiv preprint arXiv:1802.07843},
year = {2018}
}
Comments
10 pages