Add to ORKGAbstract. This paper is concerned with the open problem of whether the BFGS method with inexact line search converges globally when applied to nonconvex unconstrained optimization problems. We propose a cautious BFGS update and prove that the method with either a Wolfe-type or an Armijo-type line search converges globally if the function to be minimized has Lipschitz continuous gradients
Abstract. We propose a new inexact line search rule and analyze the global convergence and convergen...
AbstractGlobal convergence results are established for unconstrained optimization algorithms that ut...
AbstractIn this paper, we propose a new nonmonotone line search technique for unconstrained optimiza...
This paper is concerned with the open problem whether BFGS method with inexact line search converges...
AbstractIn this paper, we propose a modified BFGS (Broyden–Fletcher–Goldfarb–Shanno) method with non...
Abstract. We investigate the BFGS algorithm with an inexact line search when applied to non-smooth f...
AbstractIn this paper, we propose a modification of the BFGS method for unconstrained optimization. ...
In this article, a class of nonconvex unconstrained optimization problems is considered. As the Armi...
Abstract In this paper, a modified BFGS algorithm is proposed for unconstrained optimization. The pr...
The self-scaling quasi-Newton method solves an unconstrained optimization problem by scaling the He...
Among the quasi-Newton algorithms, the BFGS method is often discussed by related scholars. However, ...
The BFGS method is one of the most efficient quasi-Newton methods for solving small- and medium-size...
AbstractIn this paper, we propose a new nonmonotone Armijo type line search and prove that the MBFGS...
By using the forcing function, we proposed a general form of nonmonotone line search technique for ...
This paper investigates the potential behavior, both good and bad, of the well-known BFGS algorithm ...
Abstract. We propose a new inexact line search rule and analyze the global convergence and convergen...
AbstractGlobal convergence results are established for unconstrained optimization algorithms that ut...
AbstractIn this paper, we propose a new nonmonotone line search technique for unconstrained optimiza...
This paper is concerned with the open problem whether BFGS method with inexact line search converges...
AbstractIn this paper, we propose a modified BFGS (Broyden–Fletcher–Goldfarb–Shanno) method with non...
Abstract. We investigate the BFGS algorithm with an inexact line search when applied to non-smooth f...
AbstractIn this paper, we propose a modification of the BFGS method for unconstrained optimization. ...
In this article, a class of nonconvex unconstrained optimization problems is considered. As the Armi...
Abstract In this paper, a modified BFGS algorithm is proposed for unconstrained optimization. The pr...
The self-scaling quasi-Newton method solves an unconstrained optimization problem by scaling the He...
Among the quasi-Newton algorithms, the BFGS method is often discussed by related scholars. However, ...
The BFGS method is one of the most efficient quasi-Newton methods for solving small- and medium-size...
AbstractIn this paper, we propose a new nonmonotone Armijo type line search and prove that the MBFGS...
By using the forcing function, we proposed a general form of nonmonotone line search technique for ...
This paper investigates the potential behavior, both good and bad, of the well-known BFGS algorithm ...
Abstract. We propose a new inexact line search rule and analyze the global convergence and convergen...
AbstractGlobal convergence results are established for unconstrained optimization algorithms that ut...
AbstractIn this paper, we propose a new nonmonotone line search technique for unconstrained optimiza...