Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
