| In this paper,we present a calss of the generlized quasi-Newton methods for unconstrained optimization, and study the global convergence properties of the methods when applied to a general objective function. We assume that line search satisfies the general form of stepsize selection rules which summarizes many known stepsize selection rules as its special caese, and that the parameter Φk in the matrices update formulae by the methods may be a negative value. |
