An improvement of adaptive cubic regularization method for unconstrained optimization problems. Issue 2 (1st February 2021)

• Record Type: Journal Article
• Authors: Dehghan Niri, T.; Heydari, M.; Hosseini, M. M.
• Is Part Of: International journal of computer mathematics. Volume 98:Issue 2(2021)
• Page Start: 271
• Page End: 287
• Publication Date: 2021-02-01
• Subjects: Unconstrained optimization -- cubic regularization -- ARC algorithm -- nonmonotone line search -- global convergence; 49M37 -- 65K05 -- 90C30; Computers -- Periodicals; Numerical analysis -- Periodicals; Automation -- Periodicals; 004.0151
• DOI: 10.1080/00207160.2020.1738406
• Languages: English
• ISSNs: 0020-7160

Abstract

Abstract : 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.