A nonmonotone modified BFGS algorithm for nonconvex unconstrained optimization problems

Abstract

In this paper, a modified BFGS algorithm is proposed to solve unconstrained optimization problems. First, based on a modified secant condition, an update formula is recommended to approximate Hessian matrix. Then thanks to the remarkable nonmonotone line search properties, an appropriate nonmonotone idea is employed. Under some mild conditions, the global convergence properties of the algorithm are established without convexity assumption on the objective function. Preliminary numerical experiments are also reported which indicate the promising behavior of the new algorithm.

Modified limited-memory Broyden-Fletcher-Goldfarb-Shanno algorithm for unconstrained optimization problem

“…where 𝛽 is a positive constant, see [19], [20]. Then we have reformed the self-scaling BFGS update formula based on (10) as follows:…”