A nonmonotone adaptive trust region technique with a forgetting factor

References

• M. Ahookhoosh, K. Amini, and M. Peyghami, A nonmonotone trust region line search method for large scale unconstrained optimization, Appl. Math. Model. 36(1) (2012), pp. 478–487.
   Web of Science ®Google Scholar
• M. Ahookhosh, K. Amini, M. Kimiaei, and M.R. Peyghami, A limited memory trust region method with adaptive radius for large scale unconstrained optimization, Bull. Iranian Math. Soc. 42(4) (2016), pp. 819–837.
   Web of Science ®Google Scholar
• S. Babaie–Kafaki and S. Rezaee, Two accelerated nonmonotone adaptive trust region line search methods, Numer. Algorithms 78(3) (2018), pp. 911–928.
   Web of Science ®Google Scholar
• S. Babaie–Kafaki and Z. Aminifard, Two-parameter scaled memoryless BFGS methods with a nonmonotone choice for the initial step length, Numer. Algorithms 82(4) (2019), pp. 1345–1357.
   Web of Science ®Google Scholar
• Z. Cui and B. Wu, A new modified nonmonotone adaptive trust region method for unconstrained optimization, Comput. Optim. Appl. 53(3) (2012), pp. 795–806.
   Web of Science ®Google Scholar
• F. Ding and T. Chen, Performance bounds of forgetting factor least-squares algorithms for time-varying systems with finite measurement data, IEEE Trans. Circuits Syst. I: Reg. Papers. 52(3) (2005), pp. 555–566.
   Web of Science ®Google Scholar
• F. Ding, L. Xu, and Q. Zhu, Performance analysis of the generalised projection identification for time-varying systems, IET Control Theory Appl. 10(18) (2016), pp. 2506–2514.
   Web of Science ®Google Scholar
• E.D. Dolan and J.J. Moré, Benchmarking optimization software with performance profiles, Math. Programming 91(2) (2002), pp. 201–213.
   Web of Science ®Google Scholar
• J.Y. Fan and Y.X. Yuan, A new trust region algorithm with trust region radius converging to zero, in Li di, D. (Ed.), Proceedings of the 5th International Conference on Optimization: Techniques and Applications, Hong Kong, 2001, pp. 786–794.
   Google Scholar
• N.I.M. Gould, D. Orban, and Ph.L. Toint, CUTEr: A constrained and unconstrained testing environment, revisited, ACM Trans. Math. Softw. 29(4) (2003), pp. 373–394.
   Web of Science ®Google Scholar
• L. Grippo, F. Lampariello, and S. Lucidi, A nonmonotone line search technique for Newton's method, SIAM J. Numer. Anal. 23(4) (1986), pp. 707–716.
   Web of Science ®Google Scholar
• W.W. Hager and H. Zhang, Algorithm 851: CG −Descent, a conjugate gradient method with guaranteed descent, ACM Trans. Math. Softw. 32(1) (2006), pp. 113–137.
   Web of Science ®Google Scholar
• R.M. Johnstone, C.R. Johnson Jr., R.R. Bitmead, and B.D. Anderson, Exponential convergence of recursive least-squares with exponential forgetting factor, Syst. Control Lett. 2(2) (1982), pp. 77–82.
   Web of Science ®Google Scholar
• S.H. Leung and C.F. So, Gradient-based variable forgetting factor RLS algorithm in time-varying environments, IEEE Trans. Signal Process. 53(8) (2005), pp. 3141–3150.
   Web of Science ®Google Scholar
• J. Nocedal and S.J. Wright, Numerical Optimization, Springer, New York, 2006.
   Google Scholar
• M.R. Peyghami and D. Ataee Tarzanagh, A relaxed nonmonotone adaptive trust region method for solving unconstrained optimization problems, Comput. Optim. Appl. 61(2) (2015), pp. 321–341.
   Web of Science ®Google Scholar
• C. Paleologu, J. Benesty, and S. Ciochina, A robust variable forgetting factor recursive least-squares algorithm for system identification, IEEE Signal Process. Lett. 15 (2008), pp. 597–600.
   Web of Science ®Google Scholar
• S. Rezaee and S. Babaie–Kafaki, An adaptive nonmonotone trust region algorithm, Optim. Methods Softw. 34(2) (2019), pp. 264–277.
   Web of Science ®Google Scholar
• Z. Saeidian and M.R. Peyghami, An adaptive nonmonotone trust region method for unconstraint optimization problems based on a simple subproblem, Iran. J. Numer. Anal. Optim. 2 (2015), pp. 95–117.
   Google Scholar
• Z. Sang and Q. Sun, A self-adaptive trust region method with line search based on a simple subproblem model, J. Comput. Appl. Math. 232(2) (2009), pp. 514–522.
   Web of Science ®Google Scholar
• A. Sartenaer, Automatic determination of an initial trust region in nonlinear programming, SIAM J. Sci. Comput. 18(6) (1997), pp. 1788–1803.
   Web of Science ®Google Scholar
• Z. Sheng, Y. Gonglin, and C. Zengru, A new adaptive trust region algorithm for optimization problems, Acta Math. Sci. 38(2) (2018), pp. 479–496.
   Web of Science ®Google Scholar
• Z.J. Shi and J.H. Guo, A new trust region method for unconstrained optimization, J. Comput. Appl. Math. 213(2) (2008), pp. 509–520.
   Web of Science ®Google Scholar
• W. Sun, Nonmonotone trust region method for solving optimization problems, Appl. Math. Comput. 156(1) (2004), pp. 159–174.
   Web of Science ®Google Scholar
• W. Sun and Y.X. Yuan, Optimization Theory and Methods: Nonlinear Programming, Springer, New York, 2006.
   Google Scholar
• Ph.L. Toint, An assessment of nonmonotone line search techniques for unconstrained optimization, SIAM J. Sci. Comput. 17(3) (1996), pp. 725–739.
   Web of Science ®Google Scholar
• Ph.L. Toint, Nonmonotone trust region algorithms for nonlinear optimization subject to convex constraints, SIAM J. Sci. Comput. 17(3) (1996), pp. 725–739.
   Web of Science ®Google Scholar
• Z. Wei, G. Li, and L. Qi, New quasi-Newton methods for unconstrained optimization problems, Appl. Math. Comput. 175(2) (2006), pp. 1156–1188.
   Web of Science ®Google Scholar
• X.S. Zhang, J.L. Zhang, and L.Z. Liao, An adaptive trust region method and its convergence, Sci. China Ser. A. Math. 45(5) (2002), pp. 620–631.
   Google Scholar