AbstractBy the use of a nonlinear model for the gradient of the objective function along a chosen direction, we show how information available via values of the objective function may be efficiently utilised in an optimisation method of “quasi-Newton” type. Numerical experiments indicate that computational gains are possible by such means
AbstractQuasi-Newton methods update, at each iteration, the existing Hessian approximation (or its i...
New algorithms for solving unconstrained optimization problems are presented based on the idea of co...
In this thesis, we are mainly concerned with finding the numerical solution of nonlinear unconstrain...
AbstractBy the use of a nonlinear model for the gradient of the objective function along a chosen di...
AbstractMost “quasi-Newton” methods in common use for function minimisation use a quadratic model to...
AbstractWe develop a framework employing scaling functions for the construction of multistep quasi-N...
AbstractThe secant equation, which underlies all standard ‘quasi-Newton’ minimisation methods, arise...
AbstractQuasi-Newton methods for unconstrained minimization generate a sequence of matrices that can...
AbstractA bound on the possible deterioration in the condition number of the inverse Hessian approxi...
Arevised algorithm is given for unconstrained optimization using quasi-Newton methods. The method is...
This paper develops a modified quasi-Newton method for structured unconstrained optimization with pa...
AbstractA new search method is presented for unconstrained optimization. The method requires the eva...
This thesis begins with the history of operations research and introduces two of its major branches,...
AbstractWe develop a framework employing scaling functions for the construction of multistep quasi-N...
AbstractIn previous work, the authors (1993, 1994) developed the concept of multi-step quasi-Newton ...
AbstractQuasi-Newton methods update, at each iteration, the existing Hessian approximation (or its i...
New algorithms for solving unconstrained optimization problems are presented based on the idea of co...
In this thesis, we are mainly concerned with finding the numerical solution of nonlinear unconstrain...
AbstractBy the use of a nonlinear model for the gradient of the objective function along a chosen di...
AbstractMost “quasi-Newton” methods in common use for function minimisation use a quadratic model to...
AbstractWe develop a framework employing scaling functions for the construction of multistep quasi-N...
AbstractThe secant equation, which underlies all standard ‘quasi-Newton’ minimisation methods, arise...
AbstractQuasi-Newton methods for unconstrained minimization generate a sequence of matrices that can...
AbstractA bound on the possible deterioration in the condition number of the inverse Hessian approxi...
Arevised algorithm is given for unconstrained optimization using quasi-Newton methods. The method is...
This paper develops a modified quasi-Newton method for structured unconstrained optimization with pa...
AbstractA new search method is presented for unconstrained optimization. The method requires the eva...
This thesis begins with the history of operations research and introduces two of its major branches,...
AbstractWe develop a framework employing scaling functions for the construction of multistep quasi-N...
AbstractIn previous work, the authors (1993, 1994) developed the concept of multi-step quasi-Newton ...
AbstractQuasi-Newton methods update, at each iteration, the existing Hessian approximation (or its i...
New algorithms for solving unconstrained optimization problems are presented based on the idea of co...
In this thesis, we are mainly concerned with finding the numerical solution of nonlinear unconstrain...