scholarly journals A modified filter nonmonotone adaptive retrospective trust region method

PLoS ONE ◽  
2021 ◽  
Vol 16 (6) ◽  
pp. e0253016
Author(s):  
Xianfeng Ding ◽  
Quan Qu ◽  
Xinyi Wang

In this paper, aiming at the unconstrained optimization problem, a new nonmonotone adaptive retrospective trust region line search method is presented, which takes advantages of multidimensional filter technique to increase the acceptance probability of the trial step. The new nonmonotone trust region ratio is presented, which based on the convex combination of nonmonotone trust region ratio and retrospective ratio. The global convergence and the superlinear convergence of the algorithm are shown in the right circumstances. Comparative numerical experiments show the better effective and robustness.

Author(s):  
Saman Babaie-Kafaki ◽  
Saeed Rezaee

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


2017 ◽  
Vol 57 (1-2) ◽  
pp. 421-436 ◽  
Author(s):  
Saeed Rezaee ◽  
Saman Babaie-Kafaki

2017 ◽  
Vol 78 (3) ◽  
pp. 911-928 ◽  
Author(s):  
Saman Babaie–Kafaki ◽  
Saeed Rezaee

2015 ◽  
Vol 2015 ◽  
pp. 1-8
Author(s):  
Yunlong Lu ◽  
Weiwei Yang ◽  
Wenyu Li ◽  
Xiaowei Jiang ◽  
Yueting Yang

A new trust region method is presented, which combines nonmonotone line search technique, a self-adaptive update rule for the trust region radius, and the weighting technique for the ratio between the actual reduction and the predicted reduction. Under reasonable assumptions, the global convergence of the method is established for unconstrained nonconvex optimization. Numerical results show that the new method is efficient and robust for solving unconstrained optimization problems.


Sign in / Sign up

Export Citation Format

Share Document