Convergence of the descent Dai–Yuan conjugate gradient method for unconstrained optimization (Q5208033): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1177/1077546311405750 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2069731254 / 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: A Dai-Yuan conjugate gradient algorithm with sufficient descent and conjugacy conditions for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of functions having Lipschitz continuous first partial derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: A family of hybrid conjugate gradient methods for unconstrained optimization / 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: Q3129102 / 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: Function minimization by conjugate gradients / 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: Methods of conjugate gradients for solving linear systems / 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: Q4016506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization. Algorithms and consistent approximations / 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: Q3313210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of Liu-Storey conjugate gradient method / 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: Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4103338 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:26, 21 July 2024

scientific article; zbMATH DE number 7151086
Language Label Description Also known as
English
Convergence of the descent Dai–Yuan conjugate gradient method for unconstrained optimization
scientific article; zbMATH DE number 7151086

    Statements

    Convergence of the descent Dai–Yuan conjugate gradient method for unconstrained optimization (English)
    0 references
    0 references
    0 references
    15 January 2020
    0 references
    conjugate gradient method
    0 references
    descent condition
    0 references
    global convergence
    0 references
    Goldstein conditions
    0 references
    line search
    0 references
    unconstrained optimization
    0 references

    Identifiers