A conjugate gradient method for unconstrained optimization problems (Q963493)

From MaRDI portal
Revision as of 13:33, 23 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q58648434, #quickstatements; #temporary_batch_1711196317277)
scientific article
Language Label Description Also known as
English
A conjugate gradient method for unconstrained optimization problems
scientific article

    Statements

    A conjugate gradient method for unconstrained optimization problems (English)
    0 references
    20 April 2010
    0 references
    Summary: A hybrid method combining the FR conjugate gradient method and the WYL conjugate gradient method is proposed for unconstrained optimization problems. The presented method possesses the sufficient descent property under the strong Wolfe-Powell (SWP) line search rule relaxing the parameter \(\sigma <1\). Under the suitable conditions, the global convergence with the SWP line search rule and the weak Wolfe-Powell (WWP) line search rule is established for nonconvex function. Numerical results show that this method is better than the FR method and the WYL method.
    0 references
    hybrid method
    0 references
    strong Wolfe-Powell line search rule
    0 references
    global convergence
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers