Another improved Wei-Yao-Liu nonlinear conjugate gradient method with sufficient descent property (Q433285): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Methods of conjugate gradients for solving linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Function minimization by conjugate gradients / 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: Efficient generalized conjugate gradient algorithms. I: Theory / 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: Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergence of the Fletcher-Reeves algorithm with inexact linesearch / 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: The convergence properties of some new conjugate gradient methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: The proof of the sufficient descent condition of the Wei-Yao-Liu conjugate gradient method under the strong Wolfe-Powell line search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note about WYL's conjugate gradient method and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved Wei-Yao-Liu nonlinear conjugate gradient method for optimization computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: CUTE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Line search algorithms with guaranteed sufficient decrease / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5479892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5866751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dai-Yuan conjugate gradient algorithm with sufficient descent and conjugacy conditions for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4103338 / rank
 
Normal rank

Latest revision as of 11:52, 5 July 2024

scientific article
Language Label Description Also known as
English
Another improved Wei-Yao-Liu nonlinear conjugate gradient method with sufficient descent property
scientific article

    Statements

    Another improved Wei-Yao-Liu nonlinear conjugate gradient method with sufficient descent property (English)
    0 references
    0 references
    0 references
    13 July 2012
    0 references
    Many of the variants of the original conjugate gradient methods have been widely studied, including the known results of the Hestenes-Stiefel method, the Polak-Ribière-Polyak (PRP) method, a variant of the PRP (VPRP) method, and the NPRP method. The authors present a modification to the NPRP method such that the method possesses the sufficient descent property for any line search and also the global convergence with the standard Wolfe line search or Armijo line search. The result is extended to the Hestenes-Stiefel method. Some numerical experiments are shown to show that the NPRP method performs better than the VPRP method.
    0 references
    0 references
    unconstrained optimization
    0 references
    conjugate gradient method
    0 references
    sufficient descent property
    0 references
    global convergence
    0 references
    Hestenes-Stiefel method
    0 references
    Polak-Ribière-Polyak method
    0 references
    Wolfe line search
    0 references
    Armijo line search
    0 references
    numerical experiments
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references