Projets par an
Résumé
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.
langue originale | Anglais |
---|---|
Pages (de - à) | 511-529 |
Nombre de pages | 19 |
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 uniform nonsingularity of matrices of search directions and the rate of convergence in minimization algorithms ». 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