An efficient step size for BFGS

MaRDI QIDQ3185314zbMATH OpenFDO

Authors Azfi Zaidi Mohammad Sofi, Mustafa Mamat, Ismail Mohd, Yosza Dasril

Publication date 26 October 2009

zbMATH Keywords

BFGSdifferebtiableexact line searchstep sizesuperlinearly convergence

Mathematics Subject Classification ID

Methods of quasi-Newton type (90C53)

Recommendations

• A modified nonmonotone BFGS algorithm for unconstrained optimization
• An adaptive sizing BFGS method for unconstrained optimization
• An adaptive scaled BFGS method for unconstrained optimization
• Global convergence results of BFGS methods with a new nonmonotone step size rule
• A Modified BFGS Algorithm for Unconstrained Optimization

Cited in

(1)

• Partial BFGS Update and Efficient Step-Length Calculation for Three-Layer Neural Networks

This page was built for publication: An efficient step size for BFGS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3185314)