Abstract
Making a rank-one modification on the classical BFGS (Broyden–Fletcher–Goldfarb–Shanno) updating formula, we develop a class of augmented BFGS methods. The suggested formula can be considered as a hybridization of the basic BFGS updating formula for Hessian with an additional rank-one term embedded to guarantee a general modified secant equation. By using the well-known Sherman–Morrison formula, the inverse of a memoryless version of the given updating formula is computed to be applied for solving large-scale problems. Convergence analysis is concisely carried out as well. At last, the practical merits of the method are investigated by numerical tests on a set of CUTEr problems as well as the well-known compressed sensing problem. Results show the computational efficiency of the given method.
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.
