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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Minimization of functions having Lipschitz continuous first partial derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: A spectral conjugate gradient method for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rate of Convergence of Several Conjugate Gradient Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: New properties of a nonlinear conjugate gradient method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the asymptotic behaviour of some new gradient methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Function minimization by conjugate gradients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence conditions, line search algorithms and trust region implementations for the Polak–Ribière conjugate gradient method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A globally convergent version of the Polak-Ribière conjugate gradient method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Convergence Properties of Conjugate Gradient Methods for Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Steepest Descent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of conjugate gradients for solving linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Polak-Ribière algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Unconstrained Optimization Software / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4016506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5563083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The conjugate gradient method in extremal problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergence of conjugate gradient methods without line search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic cost flow and the conjugate gradient method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjugate Gradient Methods with Inexact Searches / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of a New Conjugate Gradient Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4928358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of descent method without line search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Step-size estimation for unconstrained optimization methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Conditions for Ascent Methods / rank
 
Normal rank

Revision as of 14:43, 25 June 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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers