Abstract. Techniques for obtaining safely positive definite Hessian approximations with self-scaling and modified quasi-Newton updates are combined to obtain ‘better ’ curvature approximations in line search methods for unconstrained optimization. It is shown that this class of methods, like the BFGS method has global and superlinear convergence for convex functions. Numerical experiments with this class, using the well-known quasi-Newton BFGS, DFP and a modified SR1 updates, are presented to illustrate advantages of the new techniques. These experiments show that the performance of several combined methods are substantially better than that of the standard BFGS method. Similar improvements are also obtained if the simple sufficient functio...
We begin by developing a line search method for unconstrained optimization which can be regarded as ...
Self-scaling updates have been proposed by Luenberger, Oren, and Spedicato for use in quasi-Newton m...
The BFGS method is one of the most effective quasi-Newton algorithms for minimization-optimization p...
The self-scaling quasi-Newton method solves an unconstrained optimization problem by scaling the He...
This paper develops a modified quasi-Newton method for structured unconstrained optimization with pa...
In this paper, we investigate quasi-Newton methods for solving unconstrained optimization problems. ...
Many methods for solving minimization problems are variants of Newton method, which requires the spe...
Quasi-Newton methods are among the most practical and efficient iterative methods for solving uncons...
The BFGS method is one of the most efficient quasi-Newton methods for solving small- and medium-size...
Multi-step methods derived in [1–3] have proven to be serious contenders in practice by outperformin...
In this thesis, we are mainly concerned with finding the numerical solution of nonlinear unconstrain...
Quasi-Newton methods are among the most practical and efficient iterative methods for solving uncons...
Over the past twelve years, multi-step quasi-Newton methods for the unconstrained optimization of a ...
This thesis is concerned with analyzing and improving the performance of quasi-Newton methods for f...
We begin by developing a line search method for unconstrained optimization which can be regarded as ...
We begin by developing a line search method for unconstrained optimization which can be regarded as ...
Self-scaling updates have been proposed by Luenberger, Oren, and Spedicato for use in quasi-Newton m...
The BFGS method is one of the most effective quasi-Newton algorithms for minimization-optimization p...
The self-scaling quasi-Newton method solves an unconstrained optimization problem by scaling the He...
This paper develops a modified quasi-Newton method for structured unconstrained optimization with pa...
In this paper, we investigate quasi-Newton methods for solving unconstrained optimization problems. ...
Many methods for solving minimization problems are variants of Newton method, which requires the spe...
Quasi-Newton methods are among the most practical and efficient iterative methods for solving uncons...
The BFGS method is one of the most efficient quasi-Newton methods for solving small- and medium-size...
Multi-step methods derived in [1–3] have proven to be serious contenders in practice by outperformin...
In this thesis, we are mainly concerned with finding the numerical solution of nonlinear unconstrain...
Quasi-Newton methods are among the most practical and efficient iterative methods for solving uncons...
Over the past twelve years, multi-step quasi-Newton methods for the unconstrained optimization of a ...
This thesis is concerned with analyzing and improving the performance of quasi-Newton methods for f...
We begin by developing a line search method for unconstrained optimization which can be regarded as ...
We begin by developing a line search method for unconstrained optimization which can be regarded as ...
Self-scaling updates have been proposed by Luenberger, Oren, and Spedicato for use in quasi-Newton m...
The BFGS method is one of the most effective quasi-Newton algorithms for minimization-optimization p...