Convergence of the Polak-Ribiére-Polyak conjugate gradient method (Q869834): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Changed an Item
Property / describes a project that uses
 
Property / describes a project that uses: minpack / rank
 
Normal rank

Revision as of 16:37, 28 February 2024

scientific article
Language Label Description Also known as
English
Convergence of the Polak-Ribiére-Polyak conjugate gradient method
scientific article

    Statements

    Convergence of the Polak-Ribiére-Polyak conjugate gradient method (English)
    0 references
    0 references
    0 references
    9 March 2007
    0 references
    In this paper, an new kind of Armijo-type line search has been proposed for guaranteeing the global convergence of the Polak-Ribiére-Polyak conjugate gradient method for unconstrained minimizing functions that have Lipschitz continouous partial derivatives. The global convergence and linear convergence rate were analyzed under some mild conditions. Numerical results show that the proposed method with the new Armijo-type line search is more efficient than other similar methods in practical computation.
    0 references
    unconstrained optimization
    0 references
    Polak-Ribiére-Polyak conjugate gradient method
    0 references
    Armijo line search
    0 references
    global convergence
    0 references
    Wolfe line search
    0 references

    Identifiers