A new globalization technique for nonlinear conjugate gradient methods for nonconvex minimization (Q555476): Difference between revisions

From MaRDI portal
Normalize DOI.
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1016/J.AMC.2011.05.032 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1016/J.AMC.2011.05.032 / rank
 
Normal rank

Latest revision as of 21:27, 9 December 2024

scientific article
Language Label Description Also known as
English
A new globalization technique for nonlinear conjugate gradient methods for nonconvex minimization
scientific article

    Statements

    A new globalization technique for nonlinear conjugate gradient methods for nonconvex minimization (English)
    0 references
    0 references
    0 references
    22 July 2011
    0 references
    The authors analyze a new multiplier selection in the context of nonlinear conjugate gradient methods for non-convex minimization. For this purpose, they propose a so-called truncated descent (TD) approach to limit the multiplier used to modify the steepest descent direction in a certain sense. This new multiplier is then combined with the Polak-Ribiere-Polyak (PRP) and the Liu-Storey (LS) method to get a TDPRP and a TDLS method. For the TDPRP approach convergence is shown in the strongly convex but also in the non-convex case. Numerical results for some of the CUTEr test problems are shown. This includes a comparison of the TDPRP and the TDLS method with the CG-DESCENT algorithm.
    0 references
    nonlinear conjugate gradient method
    0 references
    step modification
    0 references
    global convergence
    0 references
    steepest descent
    0 references
    Polak-Ribiere-Polyak method
    0 references
    Liu-Storey method
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers