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
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...
Numerical Methods for Unconstrained Optimization and Nonlinear Equations
Preface 1. Introduction. Problems to be considered Characteristics of 'real-world' problems Finite-precision arithmetic and measurement of error Exercises 2. Nonlinear Problems ...
Trust Region Methods
Preface 1. Introduction Part I. Preliminaries: 2. Basic Concepts 3. Basic Analysis and Optimality Conditions 4. Basic Linear Algebra 5. Krylov Subspace Methods Part II. Trust-Re...
Iterative Solution of Nonlinear Equations in Several Variables
Preface to the Classics Edition Preface Acknowledgments Glossary of Symbols Introduction Part I. Background Material. 1. Sample Problems 2. Linear Algebra 3. Analysis Part II. N...
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...
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
Cite This
Identifiers
- DOI
- 10.1093/comjnl/13.2.185