Abstract: | Rank-one positive definite Quasi-Newton algorithms for unconstrained minimization of the type described by Kleinmichel and Spedicato are numerically evaluated versus the BFS algorithm. Results show that, while on certain functions some rank-one methods perform better, overall the BFS still comes first, its superiority being more evident for larger dimensional problems. |