.png){kind=icon}
返回
Nonmonotone trust region method for solving optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2003.07.008.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper a trust region (TR) method with nonmonotone technique for optimization is proposed. We construct a new ratio of actual descent and predicted descent which is a simple and natural generalization of the modified Armijo line search rule. The paper exposes the relationship between the trust region method and line search approach. Since this method possesses the robust properties of trust region subproblem, it is globally convergent although we employ the nonmonotone sequence of function values instead of the monotone sequence. In addition, the proof of convergence is obviously simpler than one of Newton-type method with nonmonotone line search. Finally, applications of the nonmonotone TR algorithm to some optimization problems are discussed. (C) 2003 Elsevier Inc. All rights reserved.
Keyword:
trust region method
nonlinear programming
quasi-Newton method
nonmonotone optimization method
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
暂无机构信息
引用论文
.png){kind=icon}
查看更多内容