Projets par an
Résumé
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.
langue originale | Anglais |
---|---|
Pages (de - à) | 531-547 |
Nombre de pages | 17 |
journal | Journal of Optimization Theory and Applications. |
Volume | 23 |
Numéro de publication | 4 |
Les DOIs | |
Etat de la publication | Publié - 1 déc. 1977 |
Empreinte digitale Examiner les sujets de recherche de « On the accelerating property of an algorithm for function minimization without calculating derivatives ». Ensemble, ils forment une empreinte digitale unique.
Projets
- 1 Actif
-
ADALGOPT: ADALGOPT - Algorithmes avancés en optimisation non-linéaire
1/01/87 → …
Projet: Axe de recherche