Abstract
Four new scaled three-term memoryless VM methods for solving nonlinear unconstrained problems are presented. The basic idea is to deal with Al-Bayati's (1991) and Biggs's (1983) self-scaling VMupdates in the frame of new scaled CG-methods. Birgin-Martinez (2001) and Abbo (2007) positive parameters are used to scale these spectral CG-methods. The new search directions are reset to the standard Steepest Descent (SD) direction when Powell's (1977) restarting criterion holds. Andrei's (2010) acceleration scheme of the step-size parameter has been employed in the new proposed methods to improve the efficiency of such methods. Under common assumptions; the new methods are proved to be globally convergent. Computational results for a set consisting of 100 unconstrained optimization test problems show that the new methods substantially outperforms the scaled memoryless BFGS method.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Open Problems in Computer Science and Mathematics
Disclaimer: 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.