A new general form of conjugate gradient methods with guaranteed descent and strong global convergence properties (Q415335): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q318779
Import241208061232 (talk | contribs)
Normalize DOI.
 
(8 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11075-011-9515-0 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: L-BFGS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CUTE / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CUTEr / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CG_DESCENT / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11075-011-9515-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1979559025 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CUTE / 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: A class of globally convergent conjugate gradient methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226179 / 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: A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 851 / 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: On the limited memory BFGS method for large scale optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5563083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3313210 / 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: On the convergence property of the DFP algorithm / rank
 
Normal rank
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: Q4103338 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11075-011-9515-0 / rank
 
Normal rank

Latest revision as of 16:50, 9 December 2024

scientific article
Language Label Description Also known as
English
A new general form of conjugate gradient methods with guaranteed descent and strong global convergence properties
scientific article

    Statements

    A new general form of conjugate gradient methods with guaranteed descent and strong global convergence properties (English)
    0 references
    0 references
    0 references
    8 May 2012
    0 references
    The authors present a new general form of conjugate gradient methods and give a sufficient condition for the global convergence of the proposed method under weak conditions on the objective function. They also establish a variety of convergence results on other conjugate gradient methods, which include the Polak-Ribière-Polyak, Hestenes-Stiefel, Liu-Storey, Dai-Yuan-type and Conjugate-Descent-type methods. Some preliminary numerical results are provided.
    0 references
    conjugate gradient method
    0 references
    line search
    0 references
    sufficient descent condition
    0 references
    global convergence
    0 references
    Polak-Ribière-Polyak
    0 references
    Hestenes-Stiefel
    0 references
    Liu-Storey
    0 references
    Dai-Yuan-type
    0 references
    conjugate-descent-type
    0 references
    numerical results
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers