Projects per year
Abstract
This paper studies the speed of convergence of a general algorithm for function minimization without calculating derivatives. This algorithm contains Powell's 1964 algorithm as well as Zangwill's second modification of this procedure. The main results are Theorems 3.1 and 4.1 which show that, if the algorithm behaves well, then asymptotically almost conjugate directions are built; therefore, the algorithm has an every-iteration superlinear speed of convergence. The paper hinges on ideas of McCormick and Ritter and Powell.
Original language | English |
---|---|
Pages (from-to) | 531-547 |
Number of pages | 17 |
Journal | Journal of Optimization Theory and Applications. |
Volume | 23 |
Issue number | 4 |
DOIs | |
Publication status | Published - 1 Dec 1977 |
Fingerprint
Dive into the research topics of 'On the accelerating property of an algorithm for function minimization without calculating derivatives'. Together they form a unique fingerprint.Projects
- 1 Active