In this paper, a new inexact line search rule is presented, which is a modified version of the
classical Armijo line search rule. With lower cost of computation, a larger descent magnitude …

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

In this article, a class of nonconvex unconstrained optimization problems is considered. As
the Armijo line search is less costing in finding a steplength, a new Armijo-type line search …

To the unconstrained programme of non-convex function, this article give a modified BFGS
algorithm. The idea of the algorithm is to modify the approximate Hessian matrix for …

The standard BFGS method plays an important role among the quasi-Newton algorithms for
constrained/un-constrained optimization problems. However, Dai (2003) constructed a …

The BFGS method, which has great numerical stability, is one of the quasi-Newton line
search methods. However, the global convergence of the BFGS method with a Wolfe line …

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, we consider an unconstrained optimization problem and propose a new family
of modified BFGS methods to solve it. As it is known, classic BFGS method is not always …

The BFGS method is one of the most effective quasi-Newton algorithms for optimization
problems. However, its global convergence for general functions is still open. In this paper …

BFGS is one of the Hessian update formula in the well known Quasi-Newton method. In this
paper, we introduced a parametric hybrid search direction for BFGS algorithm using the …