scispace - formally typeset
Open AccessJournal ArticleDOI

Conditioning of Quasi-Newton Methods for Function Minimization

David F. Shanno
- 01 Jul 1970 - 
- Vol. 24, Iss: 111, pp 647-656
Reads0
Chats0
TLDR
In this paper, a class of approximating matrices as a function of a scalar parameter is presented, where the problem of optimal conditioning of these matrices under an appropriate norm is investigated and a set of computational results verifies the superiority of the new methods arising from conditioning considerations to known methods.
Abstract
Quasi-Newton methods accelerate the steepest-descent technique for function minimization by using computational history to generate a sequence of approximations to the inverse of the Hessian matrix. This paper presents a class of approximating matrices as a function of a scalar parameter. The problem of optimal conditioning of these matrices under an appropriate norm as a function of the scalar parameter is investigated. A set of computational results verifies the superiority of the new methods arising from conditioning considerations to known methods.

read more

Content maybe subject to copyright    Report

Citations
More filters
Book ChapterDOI

An Overview of Unconstrained Optimization

TL;DR: Various conjugate gradient methods for large unstructured systems are given, but it is argued that limited memory methods are considerably more effective without a great increase in storage or time.
Journal ArticleDOI

Fast and accurate determination of the relative binding affinities of small compounds to HIV-1 protease using non-equilibrium work.

TL;DR: The fast pulling ligand (FPL) out of binding cavity using non‐equilibrium molecular dynamics simulations was demonstrated to be a rapid, accurate and low CPU demand method for the determination of the relative binding affinities of a large number of HIV‐1 protease (PR) inhibitors.
Journal ArticleDOI

Methods for geometry optimization of large molecules. I. An O(N2) algorithm for solving systems of linear equations for the transformation of coordinates and forces

TL;DR: The most recent methods in quantum chemical geometry optimization use the computed energy and its first derivatives with an approximate second derivative matrix to solve systems of linear equations.
Journal ArticleDOI

Predicting crystal structures and physical properties of novel superhard p-BN under pressure via first-principles investigation

TL;DR: In this paper, the first principles calculations were carried out to investigate the electronic structure, elastic, hardness, and thermodynamics properties of novel superhard p-BN under pressure, and the calculated lattice parameters are in good agreement with previous theoretical results.
Journal ArticleDOI

Hydrogen adsorption on MoS2-surfaces: a DFT study on preferential sites and the effect of sulfur and hydrogen coverage

TL;DR: This work links the energetics of hydrogen adsorption on 2H-MoS2 to both static and dynamic geometrical features and quantifies the observed trends as a function of H-coverage, thus illustrating the complex structure/activity relationships of the MoS2 catalyst.
References
More filters
Journal ArticleDOI

A Rapidly Convergent Descent Method for Minimization

TL;DR: A number of theorems are proved to show that it always converges and that it converges rapidly, and this method has been used to solve a system of one hundred non-linear simultaneous equations.
Journal ArticleDOI

A family of variable-metric methods derived by variational means

TL;DR: In this paper, a rank-two variable-metric method was derived using Greenstadt's variational approach, which preserves the positive-definiteness of the approximating matrix.
Journal ArticleDOI

A Class of Methods for Solving Nonlinear Simultaneous Equations

TL;DR: In this article, the authors discuss certain modifications to Newton's method designed to reduce the number of function evaluations required during the iterative solution process of an iterative problem solving problem, such that the most efficient process will be that which requires the smallest number of functions evaluations.
Journal ArticleDOI

Quasi-Newton methods and their application to function minimisation

TL;DR: The Newton-Raphson method as mentioned in this paper is one of the most commonly used methods for solving nonlinear problems, where the corrections are computed as linear combinations of the residuals.
Journal ArticleDOI

A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained Problems

TL;DR: Transitions whereby inequality constraints of certain forms can be eliminated from the formulation of an optimization problem are described, and examples of their use compared with other methods for handling such constraints are described.