On the uniform nonsingularity of matrices of search directions and the rate of convergence in minimization algorithms
- 1 December 1977
- journal article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 23 (4) , 511-529
- https://doi.org/10.1007/bf00933294
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- On the accelerating property of an algorithm for function minimization without calculating derivativesJournal of Optimization Theory and Applications, 1977
- On the order of convergence of certain Quasi-Newton-methodsNumerische Mathematik, 1974
- Minimizing a function without calculating derivativesThe Computer Journal, 1967
- Contributions to the theory of the method of steepest descentArchive for Rational Mechanics and Analysis, 1967
- Convergence of Multipoint Iterative MethodsJournal of the ACM, 1964
- An efficient method for finding the minimum of a function of several variables without calculating derivativesThe Computer Journal, 1964