An improvement of adaptive cubic regularization method for unconstrained optimization problems

References

• M. Ahookhosh and K. Amini, An efficient nonmonotone trust-region method for unconstrained optimization, Numer. Algorithms 59 (2012), pp. 523–540. doi: 10.1007/s11075-011-9502-5
   Web of Science ®Google Scholar
• M. Ahookhosh, K. Amini, and M.R. Peyghami, A nonmonotone trust-region line search method for large-scale unconstrained optimization, Appl. Math. Model. 36 (2012), pp. 478–487. doi: 10.1016/j.apm.2011.07.021
   Web of Science ®Google Scholar
• N. Andrei, An unconstrained optimization test functions collection, Adv. Model. Optim. 10 (2008), pp. 147–161.
   Google Scholar
• N. Andrei, Test functions for unconstrained optimization, (2004). 8–10, Averescu Avenue, Sector 1, Bucharest, Romania. Academy of Romanian Scientists.
   Google Scholar
• H.Y. Benson and D.F. Shanno, Interior-point methods for nonconvex nonlinear programming cubic regularization, Comput. Optim. Appl. 58 (2014), pp. 323–346. doi: 10.1007/s10589-013-9626-8
   Web of Science ®Google Scholar
• E. Bergou, Y. Diouane, and S. Gratton, On the use of the energy norm in trust-region and adaptive cubic regularization sub-problems, Comput. Optim. Appl. (2017). doi:10.1007/s10589-017-9929-2.
   Web of Science ®Google Scholar
• T. Bianconcini and M. Sciandrone, A cubic regularization algorithm for unconstrained optimization using line search and nonmonotone techniques, Optim. Methods Softw. 31 (2016), pp. 1008–1035. doi: 10.1080/10556788.2016.1155213
   Web of Science ®Google Scholar
• T. Bianconcini, G. Liuzzi, B. Morini, and M. Sciandrone, On the use of iterative methods in cubic regularization for unconstrained optimization, Comput. Optim. Appl. 60 (2015), pp. 35–57. doi: 10.1007/s10589-014-9672-x
   Web of Science ®Google Scholar
• Y. Carmon and John C. Duchi, Gradient descent efficiently finds the cubic-regularized non-convex Newton step, (2017, 27 Jan). Available at arXiv:1612.00547v2 [math. OC].
   Google Scholar
• C. Cartis, N.I.M. Gould, and Ph.L. Toint, Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results, Math. Program. 127 (2011), pp. 245–295. doi: 10.1007/s10107-009-0286-5
   Web of Science ®Google Scholar
• C. Cartis, N.I.M. Gould, and Ph.L. Toint, Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-casefunction- and derivative-evaluation complexity, Math. Program. 130 (2011), pp. 295–319. doi: 10.1007/s10107-009-0337-y
   Web of Science ®Google Scholar
• R.M. Chamberlain, M.J.D. Powell, C. Lemarechal, and H.C. Pedersen, The watchdog technique for forcing convergence in algorithm for constrained optimization, Math. Program. Stud. 16 (1982), pp. 1–17. doi: 10.1007/BFb0120945
   Web of Science ®Google Scholar
• A.R. Conn, N.I.M. Gould, and Ph.L. Toint, Trust-Region Methods, SIAM, Philadelphia, 2000.
   Google Scholar
• A. Cristofari, T. Dehghan Niri, and S. Lucidi, On global minimizers of quadratic functions with cubic regularization, Optim. Lett. (2018). doi:10.1007/s11590-018-1316-0.
   PubMed Web of Science ®Google Scholar
• The CUTEr/st test problem set. Available at http://www.cuter.rl.ac.uk/Problems/mastsif.shtml.
   Google Scholar
• T. Dehghan Niri, M. Heydari, and M.M. Hosseini, A new modified trust region algorithm for solving unconstrained optimization problems, J. Math. Ext. 12 (2018), pp. 115–135.
   Web of Science ®Google Scholar
• T. Dehghan Niri, M. Heydari, and M.M. Hosseini, Correction of trust region method with a new modified Newton method, Int. J. Comput. Math. (2019). doi:10.1080/00207160.2019.1607844.
   PubMed Web of Science ®Google Scholar
• T. Dehghan Niri, M.M. Hosseini, and M. Heydari, An efficient improvement of the newton method for solving nonconvex optimization problems, Comput. Methods Differ. Equ. 7 (2019), pp. 69–85.
   Web of Science ®Google Scholar
• E.D. Dolan and J.J. More, Benchmarking optimization software with performance profiles, Math. Program. 91 (2002), pp. 201–213. doi: 10.1007/s101070100263
   Web of Science ®Google Scholar
• N.I.M. Gould, M. Porcelli, and Ph.L. Toint, Updating the regularization parameter in the adaptive cubic regularization algorithm, Comput. Optim. Appl. 53 (2012), pp. 1–22. doi: 10.1007/s10589-011-9446-7
   Web of Science ®Google Scholar
• A. Griewank, The modification of Newtons method for unconstrained optimization by bounding cubic terms, Tech. Rep. NA, 12 (1981), Department of Applied Mathematics and Theoretical Physics, University of Cambridge, UK, 1981.
   Google Scholar
• L. Grippo, F. Lampariello, and S. Lucidi, A nonmonotone line search technique for Newton's method, SIAM J. Numer. Anal. 23 (1986), pp. 707–716. doi: 10.1137/0723046
   Web of Science ®Google Scholar
• L. Grippo, F. Lampariello, and S. Lucidi, A truncated Newton method with nonmonotone line-search for unconstrained optimization, J. Optim. Theory Appl. 60 (1989), pp. 401–419. doi: 10.1007/BF00940345
   Web of Science ®Google Scholar
• M. Momeni and M.R. Peyghami, A new conjugate gradient algorithm with cubic Barzilai–Borwein step size for unconstrained optimization, Optim. Methods Softw. (2018). doi:10.1080/10556788.2017.1414813.
   Web of Science ®Google Scholar
• J.J. More, B.S. Grabow, and K.E. Hillstrom, Testing unconstrained optimization software, ACM, Trans. Math. Softw. 7 (1981), pp. 17–41. doi: 10.1145/355934.355936
   Web of Science ®Google Scholar
• Yu. Nesterov, Modified Gauss–Newton scheme with worst-case guarantees for global performance, Optim. Methods Softw. 22 (2007), pp. 469–483. doi: 10.1080/08927020600643812
   Web of Science ®Google Scholar
• Yu. Nesterov, Accelerating the cubic regularization of Newton method on convex problems, Math. Program. 112 (2008), pp. 159–181. doi: 10.1007/s10107-006-0089-x
   Web of Science ®Google Scholar
• Yu. Nesterov and B.T. Polyak, Cubic regularization of Newton method and its global performance, Math. Program. 108 (2006), pp. 177–205. doi: 10.1007/s10107-006-0706-8
   Web of Science ®Google Scholar
• J. Nocedal and Y. Yuan, Combining trust region and line search techniques, in Advances in Nonlinear Programming, Y. Yuan, ed., Dordrecht: Kluwer Academic Publishers, 1996, pp. 153–175.
   Google Scholar
• H.C. Zhang and W.W. Hager, A nonmonotone line search technique and its application to unconstrained optimization, SIAM J. Optim. 14 (2004), pp. 1043–1056. doi: 10.1137/S1052623403428208
   Web of Science ®Google Scholar
• Y. Zheng and B. Zheng, A modified adaptive cubic regularization method for large-scale unconstrained optimization problem, (16 Apr 2019). arXiv:1904.07440v1 [math.OC].
   Google Scholar