In this paper, we define an unconstrained optimization algorithm employing only first-order derivatives, in which a nonmonotone stabilization technique is used in conjunction with a quasidiscrete Newton method for the computation of the search direction. Global and superlinear convergence is proved, and numerical results are reported. © 1990 Plenum Publishing Corporation
A tolerant derivative-free nonmonotone line-search technique is proposed and analyzed. Several conse...
Quasi-Newton methods are a class of numerical methods for solving the problem of unconstrained optim...
We are concerned with defining new globalization criteria for solution methods of nonlinear equation...
In this paper, we investigate quasi-Newton methods for solving unconstrained optimization problems. ...
Abstract In this paper, non-monotone line search procedure is studied, which is combined with the no...
This paper deals with the solution of smooth unconstrained minimization problems by Newton-type meth...
We begin by developing a line search method for unconstrained optimization which can be regarded as ...
A direct search quasi-Newton algorithm is presented for local minimization of Lipschitz continuous b...
Arevised algorithm is given for unconstrained optimization using quasi-Newton methods. The method is...
Many methods for solving minimization problems are variants of Newton method, which requires the spe...
In this paper we define globally convergent algorithms for the solution of large dimensional unconst...
A nonmonotone strategy for solving nonlinear systems of equations is introduced. The idea consists o...
In this thesis, we are mainly concerned with finding the numerical solution of nonlinear unconstrain...
Previous work on so-called "fixed-point" multi-step quasi-Newton methods for unconstrained...
In this work, a new stabilization scheme for the Gauss-Newton method is defined, where the minimum n...
A tolerant derivative-free nonmonotone line-search technique is proposed and analyzed. Several conse...
Quasi-Newton methods are a class of numerical methods for solving the problem of unconstrained optim...
We are concerned with defining new globalization criteria for solution methods of nonlinear equation...
In this paper, we investigate quasi-Newton methods for solving unconstrained optimization problems. ...
Abstract In this paper, non-monotone line search procedure is studied, which is combined with the no...
This paper deals with the solution of smooth unconstrained minimization problems by Newton-type meth...
We begin by developing a line search method for unconstrained optimization which can be regarded as ...
A direct search quasi-Newton algorithm is presented for local minimization of Lipschitz continuous b...
Arevised algorithm is given for unconstrained optimization using quasi-Newton methods. The method is...
Many methods for solving minimization problems are variants of Newton method, which requires the spe...
In this paper we define globally convergent algorithms for the solution of large dimensional unconst...
A nonmonotone strategy for solving nonlinear systems of equations is introduced. The idea consists o...
In this thesis, we are mainly concerned with finding the numerical solution of nonlinear unconstrain...
Previous work on so-called "fixed-point" multi-step quasi-Newton methods for unconstrained...
In this work, a new stabilization scheme for the Gauss-Newton method is defined, where the minimum n...
A tolerant derivative-free nonmonotone line-search technique is proposed and analyzed. Several conse...
Quasi-Newton methods are a class of numerical methods for solving the problem of unconstrained optim...
We are concerned with defining new globalization criteria for solution methods of nonlinear equation...