Nonlinear conjugate gradient methods with Wolfe type line search (Q370171): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Created claim: Wikidata QID (P12): Q58916854, #quickstatements; #temporary_batch_1706273008033
Property / Wikidata QID
 
Property / Wikidata QID: Q58916854 / rank
 
Normal rank

Revision as of 14:44, 26 January 2024

scientific article
Language Label Description Also known as
English
Nonlinear conjugate gradient methods with Wolfe type line search
scientific article

    Statements

    Nonlinear conjugate gradient methods with Wolfe type line search (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 September 2013
    0 references
    Summary: The nonlinear conjugate gradient method is one of the useful methods for unconstrained optimization problems. In this paper, we consider three kinds of nonlinear conjugate gradient methods with Wolfe type line search for unstrained optimization problems. Under some mild assumptions, the global convergence results of the given methods are proposed. The numerical results show that the nonlinear conjugate gradient methods with Wolfe type line search are efficient for some unconstrained optimization problems.
    0 references
    0 references
    nonlinear conjugate gradient method
    0 references
    unconstrained optimization problems
    0 references
    0 references