AbstractA bound on the possible deterioration in the condition number of the inverse Hessian approximation is derived for updating formulae of BFGS-type. We construct a nonlinear model for the gradient of the objective function along a chosen ray in the variable-space. The model has a “free” parameter which is determined by minimising the condition number bound. Numerical tests indicate that using such a device on the first iteration can lead to an improvement in the performance of several algorithms of quasi-Newton type
AbstractThis paper presents a modified quasi-Newton method for structured unconstrained optimization...
Abstract: "We propose a quasi-Newton algorithm for solving optimization problems with nonlinear equa...
There are several benefits of taking the Hessian of the objective function into account when designi...
AbstractA bound on the possible deterioration in the condition number of the inverse Hessian approxi...
Quasi-Newton methods” are amongst the mainly useful and competent iterative process for solving unre...
Many methods for solving minimization problems are variants of Newton method, which requires the spe...
Two recently proposed algorithms for the problem of minimization subject to nonlinear equality const...
Quasi-Newton methods are among the most practical and efficient iterative methods for solving uncons...
This paper develops a modified quasi-Newton method for structured unconstrained optimization with pa...
AbstractQuasi-Newton methods for unconstrained minimization generate a sequence of matrices that can...
AbstractThe secant equation, which underlies all standard ‘quasi-Newton’ minimisation methods, arise...
This thesis is concerned with analyzing and improving the performance of quasi-Newton methods for f...
Quasi-Newton methods are among the most practical and efficient iterative methods for solving uncons...
In this paper we study new preconditioners for the Nonlinear Conjugate Gradient (NCG) method in larg...
Quasi-Newton algorithms for unconstrained nonlinear minimization generate a sequence of matrices tha...
AbstractThis paper presents a modified quasi-Newton method for structured unconstrained optimization...
Abstract: "We propose a quasi-Newton algorithm for solving optimization problems with nonlinear equa...
There are several benefits of taking the Hessian of the objective function into account when designi...
AbstractA bound on the possible deterioration in the condition number of the inverse Hessian approxi...
Quasi-Newton methods” are amongst the mainly useful and competent iterative process for solving unre...
Many methods for solving minimization problems are variants of Newton method, which requires the spe...
Two recently proposed algorithms for the problem of minimization subject to nonlinear equality const...
Quasi-Newton methods are among the most practical and efficient iterative methods for solving uncons...
This paper develops a modified quasi-Newton method for structured unconstrained optimization with pa...
AbstractQuasi-Newton methods for unconstrained minimization generate a sequence of matrices that can...
AbstractThe secant equation, which underlies all standard ‘quasi-Newton’ minimisation methods, arise...
This thesis is concerned with analyzing and improving the performance of quasi-Newton methods for f...
Quasi-Newton methods are among the most practical and efficient iterative methods for solving uncons...
In this paper we study new preconditioners for the Nonlinear Conjugate Gradient (NCG) method in larg...
Quasi-Newton algorithms for unconstrained nonlinear minimization generate a sequence of matrices tha...
AbstractThis paper presents a modified quasi-Newton method for structured unconstrained optimization...
Abstract: "We propose a quasi-Newton algorithm for solving optimization problems with nonlinear equa...
There are several benefits of taking the Hessian of the objective function into account when designi...