AbstractMost “quasi-Newton” methods in common use for function minimisation use a quadratic model to approximate the underlying objective function at the current estimate of the minimum. In this paper we describe new minimisation algorithms derived by replacing the quadratic model with a polynomial type model involving a free parameter which is determined implicitly by means of information about the objective function. We show how this information may be efficiently utilised in an optimisation method of quasi-Newton type. Numerical tests were carried out to demonstrate the performance of the new algorithms in comparison to the standard BFGS method
AbstractA bound on the possible deterioration in the condition number of the inverse Hessian approxi...
The focus for quasi-Newton methods is the quasi-Newton equation. A new quasi-Newton equation is deri...
Quadratic approximations to the objective function provide a way of estimating first and second deri...
AbstractThe secant equation, which underlies all standard ‘quasi-Newton’ minimisation methods, arise...
AbstractBy the use of a nonlinear model for the gradient of the objective function along a chosen di...
AbstractQuasi-Newton methods update, at each iteration, the existing Hessian approximation (or its i...
AbstractIn previous work, the authors (1993, 1994) developed the concept of multi-step quasi-Newton ...
In this paper, we investigate quasi-Newton methods for solving unconstrained optimization problems. ...
Four decades after their invention, quasi-Newton methods are still state of the art in unconstrained...
Four decades after their invention, quasi- Newton methods are still state of the art in unconstraine...
This thesis is concerned with analyzing and improving the performance of quasi-Newton methods for f...
AbstractQuasi-Newton methods for unconstrained minimization generate a sequence of matrices that can...
Arevised algorithm is given for unconstrained optimization using quasi-Newton methods. The method is...
Four decades after their invention, quasi-Newton methods are still state of the art in unconstrained...
Many methods for solving minimization problems are variants of Newton method, which requires the spe...
AbstractA bound on the possible deterioration in the condition number of the inverse Hessian approxi...
The focus for quasi-Newton methods is the quasi-Newton equation. A new quasi-Newton equation is deri...
Quadratic approximations to the objective function provide a way of estimating first and second deri...
AbstractThe secant equation, which underlies all standard ‘quasi-Newton’ minimisation methods, arise...
AbstractBy the use of a nonlinear model for the gradient of the objective function along a chosen di...
AbstractQuasi-Newton methods update, at each iteration, the existing Hessian approximation (or its i...
AbstractIn previous work, the authors (1993, 1994) developed the concept of multi-step quasi-Newton ...
In this paper, we investigate quasi-Newton methods for solving unconstrained optimization problems. ...
Four decades after their invention, quasi-Newton methods are still state of the art in unconstrained...
Four decades after their invention, quasi- Newton methods are still state of the art in unconstraine...
This thesis is concerned with analyzing and improving the performance of quasi-Newton methods for f...
AbstractQuasi-Newton methods for unconstrained minimization generate a sequence of matrices that can...
Arevised algorithm is given for unconstrained optimization using quasi-Newton methods. The method is...
Four decades after their invention, quasi-Newton methods are still state of the art in unconstrained...
Many methods for solving minimization problems are variants of Newton method, which requires the spe...
AbstractA bound on the possible deterioration in the condition number of the inverse Hessian approxi...
The focus for quasi-Newton methods is the quasi-Newton equation. A new quasi-Newton equation is deri...
Quadratic approximations to the objective function provide a way of estimating first and second deri...