Saman BABAIE KAFAKI, Saeed REZAEE

A randomized adaptive trust region line search method

Hybridizing the trust region, line search and simulated annealing methods, wedevelop a heuristic algorithm for solving unconstrained optimization problems.We make some numerical experiments on a set of CUTEr test problems toinvestigate efficiency of the suggested algorithm. The results show that thealgorithm is practically promising.

PDF

___

[1] Sun, W., & Yuan, Y.X. (2006). Optimization Theory and Methods: Nonlinear Programming. Springer, New York.
[2] Babaie–Kafaki, S., & Rezaee, S. (2018). Two accelerated nonmonotone adaptive trust region line search methods. Numerical Algorithms, 78(3), 911–928.
[3] Rezaee, S., & Babaie–Kafaki, S. (2019). An adaptive nonmonotone trust region algorithm. Optimization Methods and Software, 34(2), 264–277.[4] Yuan, Y.X. (2015). Recent advances in trust region algorithms. Mathematical Programming, 151(1, Ser. B), 249–281.
[5] Shi, Z.J., & Guo, J.H. (2008). A new trust region method for unconstrained optimization. Journal of Computational and Applied Mathematics, 213(1), 509–520.
[6] Wan, W., Huang, S., & Zheng, X.D. (2012). New cautious BFGS algorithm based on modified Armijo–type line search. Journal of Inequalities and Applications, 2012(1), 1–10.
[7] Yang, X.S. (2014). Nature–Inspired Optimization Algorithms. Elsevier, London.
[8] Bertsimas, D., & Tsitsiklis, J.N. (1997). Introduction to Linear Optimization. Athena Scientific, Massachusetts.
[9] Henderson, D., Jacobson, S.H., & Johnson, A.W. (2003). The theory and practice of simulated annealing. In: F.W. Glover and G.A. Kochenberger, eds. Handbook of Metaheuristics, volume 57 of International Series in Operations Research and Management Science. Kluwer Academic Publishers, Boston, MA, 287–319.
[10] Reeves, C.R. (1996). Modern heuristic techniques. In: V.J. Rayward–Smith, ed. Modern Heuristic Search Methods. John Wiley and Sons, Chichester, 1–24.
[11] Babaie–Kafaki, S., Ghanbari, R., & Mahdavi–Amiri, N. (2012). An efficient and practically robust hybrid metaheuristic algorithm for solving fuzzy bus terminal location problems. Asia–Pacific Journal of Operational Research, 29(2), 1–25.
[12] Aards, E. and Korst, J., & van Laarhoren, P. (1997). Simulated annealing. In: E.H.L. Aarts and J.K. Lenstra, eds. Local Search in Combinatorial Optimization. John Wiley and Sons, Chichester, 91–121.
[13] Hajek, B. (1988). Cooling schedules for optimal annealing. Mathematics of Operations Research, 13(2), 311–329.
[14] Andrei, N. (2006). An acceleration of gradient descent algorithm with backtracking for unconstrained optimization. Numerical Algorithms, 42(1), 63–73.
[15] Gould, N.I.M., Orban, D., & Toint, Ph.L. (2006). CUTEr: a constrained and unconstrained testing environment, revisited. ACM Transactions on Mathematical Software, 29(4), 373–394.
[16] Dolan, E.D., & Mor´e, J.J. (2002). Benchmarking optimization software with performance profiles. Mathematical Programming, 91(2, Ser. A), 201–213.
[17] Hager, W.W., & Zhang, H. (2002). Algorithm 851: CG−Descent, a conjugate gradient method with guaranteed descent. ACM Transactions on Mathematical Software, 32(1), 113–137.