Projects per year
A convergent minimization algorithm made up of repetitive line searches is considered in ℝ. It is shown that the uniform nonsingularity of the matrices consisting of n successive normalized search directions guarantees a speed of convergence which is at least n-step Q-linear. Consequences are given for multistep methods, including Powell's 1964 procedure for function minimization without calculating derivatives as well as Zangwill's modifications of this procedure. © 1977 Plenum Publishing Corporation.
FingerprintDive into the research topics of 'On the uniform nonsingularity of matrices of search directions and the rate of convergence in minimization algorithms'. Together they form a unique fingerprint.
- 1 Active
1/01/87 → …
Project: Research Axis