摘要

In this paper, a modified non-monotone BFGS (MNBFGS) method for non-convex unconstrained optimization is proposed. Under some mild conditions, the global convergence of the given method is established, when the objective function is non-convex. Preliminary numerical comparisons, which show the proposed method is competitive, are also reported.

全文