Computational experience with quadratically convergent minimisation methods

1970 The Computer Journal 342 citations

Abstract

A recently reported minimisation method allows great flexibility in choosing successive steps without losing the property of quadratic convergence, but special precautions are necessary to ensure ultimate convergence from an arbitrary point for general functions. The paper makes an analysis of the required conditions, which give rise to several possible algorithms, and results of these of a number of problems are presented and discussed.

Keywords

Minimisation (clinical trials)Quadratic growthQuadratic equationMathematical optimizationComputer scienceConvergence (economics)Property (philosophy)MathematicsFlexibility (engineering)Quadratic programmingApplied mathematicsAlgorithmStatistics

Affiliated Institutions

Related Publications

Variable metric methods of minimisation

Two basic approaches to the generation of conjugate directions are considered for the problem of unconstrained minimisation of quadratic functions. The first approach results in...

1969 The Computer Journal 143 citations

A new approach to variable metric algorithms

An approach to variable metric algorithms has been investigated in which the linear search sub-problem no longer becomes necessary. The property of quadratic termination has bee...

1970 The Computer Journal 3951 citations

Publication Info

Year
1970
Type
article
Volume
13
Issue
2
Pages
185-194
Citations
342
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

342
OpenAlex

Cite This

B. A. Murtagh (1970). Computational experience with quadratically convergent minimisation methods. The Computer Journal , 13 (2) , 185-194. https://doi.org/10.1093/comjnl/13.2.185

Identifiers

DOI
10.1093/comjnl/13.2.185