New Variable Metric algorithms for Uncnostrained optimization

Abstract

In unconstrained optimization, the original quasi-Newton condition where is the difference of the gradients at the least two iterations. In this paper, we propose VM-algorithms based on a new Quasi–Newton equation where defined in eq. (24).Experimental results indicate that the new proposed algorithms was more efficient than the standard BFGS & DFP algorithms.