In this paper, a modified BFGS algorithm is proposed for unconstrained optimization. The
proposed algorithm has the following properties:(i) a nonmonotone line search technique is …

In this paper, a new nonmonotone BFGS algorithmfor unconstrained optimization is
introduced. Under mild conditions, the global convergence of this new algorithm on convex …

Convergence analysis of a modified BFGS method on convex minimizations Page 1
Comput Optim Appl (2010) 47: 237–255 DOI 10.1007/s10589-008-9219-0 Convergence …

In this paper, we propose a modification of the BFGS method for unconstrained optimization.
A remarkable feature of the proposed method is that it possesses a global convergence …

In this paper, a new nonmonotone MBFGS algorithm for unconstrained optimization will be
proposed. Under some suitable assumptions, the global and superlinear convergence of the …

In this paper, a new modified BFGS method for unconstrained optimization problems is
presented. The algorithm preserves the convergence properties of the famous BFGS …

In this paper, by using a so-called fixed steplength strategy, we propose a BFGS method
without use of line searches for unconstrained optimization. Under mild conditions, we show …

In this paper, we propose a modified BFGS (Broyden–Fletcher–Goldfarb–Shanno) method
with nonmonotone line search for unconstrained optimization. Under some mild conditions …

The traditional BFGS algorithm has been proved very efficient. It is convergent for convex
nonlinear optimization problems. However, for non-convex nonlinear optimization problems …

In this paper, the solution of unconstrained optimization problems has been suggested by
using scaling of BFGS-SD method. This method is globally convergent with inexact line …