A Nonmonotone trust region method with adaptive radius for unconstrained optimization problems

被引:61
作者
Ahookhosh, Masoud [1 ]
Amini, Keyvan [1 ]
机构
[1] Razi Univ, Dept Sci, Kermanshah, Iran
关键词
Unconstrained optimization; Trust region method; Nonmonotone technique; Global convergence; Superlinear convergence; Quadratic convergence; CONVERGENCE; ALGORITHMS;
D O I
10.1016/j.camwa.2010.04.034
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In this paper, we incorporate a nonmonotone technique with the new proposed adaptive trust region radius (Shi and Guo, 2008) [4] in order to propose a new nonmonotone trust region method with an adaptive radius for unconstrained optimization. Both the nonmonotone techniques and adaptive trust region radius strategies can improve the trust region methods in the sense of global convergence. The global convergence to first and second order critical points together with local superlinear and quadratic convergence of the new method under some suitable conditions. Numerical results show that the new method is very efficient and robustness for unconstrained optimization problems. (C) 2010 Elsevier Ltd. All rights reserved.
引用
收藏
页码:411 / 422
页数:12
相关论文
共 19 条
[11]  
Powell M.J.D., 1975, Nonlinear Programming, V2, P1, DOI 10.1016/B978-0-12-372180-8.50042-1
[12]   ON THE GLOBAL CONVERGENCE OF TRUST REGION ALGORITHMS FOR UNCONSTRAINED MINIMIZATION [J].
POWELL, MJD .
MATHEMATICAL PROGRAMMING, 1984, 29 (03) :297-303
[13]   Automatic determination of an initial trust region in nonlinear programming [J].
Sartenaer, A .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 1997, 18 (06) :1788-1803
[14]  
Schultz G.A., 1985, SIAM J NUMER ANAL, V22, P47
[15]   A new trust region method for unconstrained optimization [J].
Shi, Zhen-Jun ;
Guo, Jin-Hua .
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2008, 213 (02) :509-520
[16]   Nonmonotone trust region method for solving optimization problems [J].
Sun, WY .
APPLIED MATHEMATICS AND COMPUTATION, 2004, 156 (01) :159-174
[18]   Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints [J].
Toint, PL .
MATHEMATICAL PROGRAMMING, 1997, 77 (01) :69-94
[19]  
Zhang XS, 2002, SCI CHINA SER A, V45, P620