A truncated descent HS conjugate gradient method and its global convergence (Q1036485): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W2089160292 / rank
 
Normal rank

Revision as of 00:13, 20 March 2024

scientific article
Language Label Description Also known as
English
A truncated descent HS conjugate gradient method and its global convergence
scientific article

    Statements

    A truncated descent HS conjugate gradient method and its global convergence (English)
    0 references
    0 references
    0 references
    0 references
    13 November 2009
    0 references
    Summary: Recently, \textit{L. Zhang} [Nonlinear conjugate gradient methods for optimization problems, PhD thesis, Hunan University, Changsha, China (2006)] proposed a three-term modified HS (TTHS) method for unconstrained optimization problems. An attractive property of the TTHS method is that the direction generated by the method is always a descent. This property is independent of the line search used. In order to obtain the global convergence of the TTHS method, Zhang proposed a truncated TTHS method. A drawback is that the numerical performance of the truncated TTHS method is not ideal. In this paper, we prove that the TTHS method with standard Armijo line search is globally convergent for uniformly convex problems. Moreover, we propose a new truncated TTHS method. Under suitable conditions, global convergence is obtained for the proposed method. Extensive numerical experiment show that the proposed method is very efficient for the test problems from the CUTE Library.
    0 references
    0 references
    0 references
    0 references
    0 references
    Armijo line search
    0 references
    uniformly convex problems
    0 references
    0 references
    0 references
    0 references