科研之友
微信
新浪微博
Facebook
分享链接
摘要
This paper presents a new nonmonotone filter line search technique in association with the MBFGS method for solving unconstrained minimization. The filter method, which is traditionally used for constrained nonlinear programming (NLP), is extended to solve unconstrained NLP by converting the latter to an equality constrained minimization. The nonmonotone idea is employed to the filter method so that the restoration phrase, a common feature of most filter methods, is not needed. The global convergence and fast local convergence rate of the proposed algorithm are established under some reasonable conditions. The results of numerical experiments indicate that the proposed method is efficient.
