Nonmonotone adaptive trust region method

被引:21
|
作者
Shi, Zhenjun [1 ]
Wang, Shengquan [2 ]
机构
[1] Cent State Univ, Dept Math & Comp Sci, Wilberforce, OH 45384 USA
[2] Univ Michigan, Dept Comp & Informat Sci, Dearborn, MI 48128 USA
关键词
Unconstrained optimization; Adaptive trust region method; Global convergence; Convergence rate; INEXACT LINE SEARCH; UNCONSTRAINED OPTIMIZATION; CONVERGENCE; ALGORITHM; RADIUS; MINIMIZATION;
D O I
10.1016/j.ejor.2010.09.007
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper, we propose a nonmonotone adaptive trust region method for unconstrained optimization problems. This method can produce an adaptive trust region radius automatically at each iteration and allow the functional value of iterates to increase within finite iterations and finally decrease after such finite iterations. This nonmonotone approach and adaptive trust region radius can reduce the number of solving trust region subproblems when reaching the same precision. The global convergence and convergence rate of this method are analyzed under some mild conditions. Numerical results show that the proposed method is effective in practical computation. (C) 2010 Elsevier B.V. All rights reserved.
引用
收藏
页码:28 / 36
页数:9
相关论文
共 50 条