On the accelerating property of an algorithm for function minimization without calculating derivatives

    Résultats de recherche: Contribution à un journal/une revueArticleRevue par des pairs

    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 originaleAnglais
    Pages (de - à)531-547
    Nombre de pages17
    journalJournal of Optimization Theory and Applications.
    Volume23
    Numéro de publication4
    Les DOIs
    Etat de la publicationPublié - 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.

    Contient cette citation