In this paper a nonmonotone steplength selection rule for Newton’s method is proposed, which can be viewed as a generalization of Armijo’s rule. Numerical results are reported which indicate that the proposed technique may allow a considerable saving both in the number of line searches and in the number of function evaluations
AbstractIn this paper we propose a nonmonotone trust region method. Unlike traditional nonmonotone t...
In this paper we develop a general convergence theory for nonmonotone line searches in optimization ...
AbstractThis paper concerns a nonmonotone line search technique and its application to the trust reg...
In this paper, an unconstrained minimization algorithm is defined in which a nonmonotone line search...
Abstract. In this paper, an unconstrained minimization algorithm is defined in which a nonmonotone l...
Newton's method plays a central role in the development of numerical techniques for optimizatio...
In this paper we define globally convergent algorithms for the solution of large dimensional unconst...
Newton's method plays a central role in the development of numerical techniques for optimization. In...
AbstractIn this paper, we develop a new nonmonotone line search for general line search method and e...
Over the past twelve years, multi-step quasi-Newton methods for the unconstrained optimization of a ...
AbstractIn this paper, we propose a new nonmonotone line search technique for unconstrained optimiza...
We investigate real asymmetric linear systems arising in the search direction generation in a nonsmo...
In this work, a new stabilization scheme for the Gauss-Newton method is defined, where the minimum n...
AbstractQuasi-Newton method is a well-known effective method for solving optimization problems. Sinc...
AbstractIn this work we explore the relation of the problem of satisfying a sufficient decrease crit...
AbstractIn this paper we propose a nonmonotone trust region method. Unlike traditional nonmonotone t...
In this paper we develop a general convergence theory for nonmonotone line searches in optimization ...
AbstractThis paper concerns a nonmonotone line search technique and its application to the trust reg...
In this paper, an unconstrained minimization algorithm is defined in which a nonmonotone line search...
Abstract. In this paper, an unconstrained minimization algorithm is defined in which a nonmonotone l...
Newton's method plays a central role in the development of numerical techniques for optimizatio...
In this paper we define globally convergent algorithms for the solution of large dimensional unconst...
Newton's method plays a central role in the development of numerical techniques for optimization. In...
AbstractIn this paper, we develop a new nonmonotone line search for general line search method and e...
Over the past twelve years, multi-step quasi-Newton methods for the unconstrained optimization of a ...
AbstractIn this paper, we propose a new nonmonotone line search technique for unconstrained optimiza...
We investigate real asymmetric linear systems arising in the search direction generation in a nonsmo...
In this work, a new stabilization scheme for the Gauss-Newton method is defined, where the minimum n...
AbstractQuasi-Newton method is a well-known effective method for solving optimization problems. Sinc...
AbstractIn this work we explore the relation of the problem of satisfying a sufficient decrease crit...
AbstractIn this paper we propose a nonmonotone trust region method. Unlike traditional nonmonotone t...
In this paper we develop a general convergence theory for nonmonotone line searches in optimization ...
AbstractThis paper concerns a nonmonotone line search technique and its application to the trust reg...
DOI
Add to ORKG