J Han, G Liu - Computational Optimization and Applications, 1997 - Springer
In this paper, a new nonmonotone BFGS algorithmfor unconstrained optimization is introduced. Under mild conditions, the global convergence of this new algorithm on convex …
DH Li, M Fukushima - Journal of Computational and Applied Mathematics, 2001 - Elsevier
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 …
L Liu, S Yao, Z Wei - Journal of Computational and Applied Mathematics, 2008 - Elsevier
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 …
G Wu, H Liang - Computer Modeling New Technologies, 2014 - cmnt.lv
In this paper, a new modified BFGS method for unconstrained optimization problems is presented. The algorithm preserves the convergence properties of the famous BFGS …
L Zhang - Optimization Methods and Software, 2005 - Taylor & Francis
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 …
Y Xiao, H Sun, Z Wang - Journal of computational and applied mathematics, 2009 - Elsevier
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 …