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

From MaRDI portal
Created claim: Wikidata QID (P12): Q58649535, #quickstatements; #temporary_batch_1711196317277
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Convergence Conditions for Ascent Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Conditions for Ascent Methods. II: Some Corrections / 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: A three-parameter family of nonlinear conjugate gradient methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5479892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New conjugacy conditions and related nonlinear conjugate gradient methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Properties of Algorithms for Nonlinear Optimization / 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: Global convergence properties of nonlinear conjugate gradient methods with modified secant condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: New quasi-Newton equation and related methods for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties and numerical performance of quasi-Newton methods with modified quasi-Newton equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: CUTE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / 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

Latest revision as of 04:38, 2 July 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
    0 references