This paper discusses the use of quasi-Newton method algorithm employed in solving unconstrained optimization problems. The method is aimed at circumventing the computational rigours undergone using the Newton's method. The Quasi-Newton method algorithm was tested on some benced mark problems with the results compared with the Conjugate Gradient Method. The results gotten using the Quasi-Newton Method compared favourably with results of existing CGM algorithm.
展开▼
