A conjugate direction implementation of the BFGS algorithm with automatic scaling
I. D. Coope · ANZIAM Journal · 1989
Abstract A new implementation of the BFGS algorithm for unconstrained optimisation is reported which utilises a conjugate factorisation of the approximating Hessian matrix. The implementation is especially useful when gradient information is estimated by finite difference formulae and it is well suited to machines which are able to exploit parallel processing.