期刊
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS
卷 98, 期 2, 页码 271-287出版社
TAYLOR & FRANCIS LTD
DOI: 10.1080/00207160.2020.1738406
关键词
Unconstrained optimization; cubic regularization; ARC algorithm; nonmonotone line search; global convergence
The paper introduces two nonmonotone versions of adaptive cubic regularized (ARC) method, which are a combination of the ARC algorithm with nonmonotone line search methods. The global convergence analysis for these iterative algorithms is established, and numerical examples demonstrate the efficiency and robustness of the proposed methods.
In this paper, we present two nonmonotone versions of adaptive cubic regularized (ARC) method for unconstrained optimization problems. The proposed methods are a combination of the ARC algorithm with the nonmonotone line search methods introduced by Zhang and Hager [A nonmonotone line search technique and its application to unconstrained optimization, SIAM J. Optim. 14 (2004), pp. 1043-1056] and Ahookhosh et al. [A nonmonotone trust-region line search method for large-scale unconstrained optimization, Appl. Math. Model. 36 (2012), pp. 478-487]. The global convergence analysis for these iterative algorithms is established under suitable conditions. Several numerical examples are given to illustrate the efficiency and robustness of the newly suggested methods. The obtained results show the satisfactory performance of the proposed algorithms when compared to the basic ARC algorithm.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据