By using the forcing function, we proposed a general form of nonmonotone line search technique for unconstrained optimization. The technique includes some well known nonmonotone line search as special cases while independence on the nonmonotone parameter. We establish the global convergence of the method under weak conditions and we report the numerical test with a modified BFGS method to show the effectiveness of the proposed method
This paper is concerned with the open problem whether BFGS method with inexact line search converges...
AbstractIn this paper, a new nonmonotone MBFGS algorithm for unconstrained optimization will be prop...
Abstract. We propose a new inexact line search rule and analyze the global convergence and convergen...
AbstractIn this paper, we propose a new nonmonotone line search technique for unconstrained optimiza...
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...
AbstractIn this paper, we propose a new nonmonotone Armijo type line search and prove that the MBFGS...
AbstractThis paper concerns a nonmonotone line search technique and its application to the trust reg...
AbstractA tolerant derivative–free nonmonotone line-search technique is proposed and analyzed. Sever...
AbstractThis paper concerns a nonmonotone line search technique and its application to the trust reg...
A tolerant derivative-free nonmonotone line-search technique is proposed and analyzed. Several conse...
Abstract In this paper, a modified BFGS algorithm is proposed for unconstrained optimization. The pr...
AbstractIn this paper, we propose a modified BFGS (Broyden–Fletcher–Goldfarb–Shanno) method with non...
A tolerant derivative–free nonmonotone line search technique is proposed and analyzed. Several conse...
AbstractIn this paper, we develop a new nonmonotone line search for general line search method and e...
This paper is concerned with the open problem whether BFGS method with inexact line search converges...
AbstractIn this paper, a new nonmonotone MBFGS algorithm for unconstrained optimization will be prop...
Abstract. We propose a new inexact line search rule and analyze the global convergence and convergen...
AbstractIn this paper, we propose a new nonmonotone line search technique for unconstrained optimiza...
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...
AbstractIn this paper, we propose a new nonmonotone Armijo type line search and prove that the MBFGS...
AbstractThis paper concerns a nonmonotone line search technique and its application to the trust reg...
AbstractA tolerant derivative–free nonmonotone line-search technique is proposed and analyzed. Sever...
AbstractThis paper concerns a nonmonotone line search technique and its application to the trust reg...
A tolerant derivative-free nonmonotone line-search technique is proposed and analyzed. Several conse...
Abstract In this paper, a modified BFGS algorithm is proposed for unconstrained optimization. The pr...
AbstractIn this paper, we propose a modified BFGS (Broyden–Fletcher–Goldfarb–Shanno) method with non...
A tolerant derivative–free nonmonotone line search technique is proposed and analyzed. Several conse...
AbstractIn this paper, we develop a new nonmonotone line search for general line search method and e...
This paper is concerned with the open problem whether BFGS method with inexact line search converges...
AbstractIn this paper, a new nonmonotone MBFGS algorithm for unconstrained optimization will be prop...
Abstract. We propose a new inexact line search rule and analyze the global convergence and convergen...