Abstract
This paper proposes a new frame-based pattern search algorithm for unconstrained optimization. The implementation of filter leads the sequence of function values at iterates { x ( k ) } nonmonotonically decreasing and thus motivates us to consider nonmonotone technique. Furthermore, the use of these two techniques can improve the efficiency of general pattern search algorithms. The numerical results show that the new algorithm is practical and efficient.
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.
