A rank-one fitting algorithm for unconstrained optimization problems

Abstract: This paper proposes a rank-one modified fitting algorithm. The main feature of the approach is that the update formula for the deflection matrix in an iteration is deduced from a quadratic fitting function, not from the traditional quasi-Newton equation. Under some mild assumptions, the algorithm is globally and linearly convergent. [Copyright &y& Elsevier]