The convergence of conjugate gradient method with nonmonotone line search (Q606706)

From MaRDI portal
Revision as of 11:22, 3 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The convergence of conjugate gradient method with nonmonotone line search
scientific article

    Statements

    The convergence of conjugate gradient method with nonmonotone line search (English)
    0 references
    0 references
    0 references
    0 references
    18 November 2010
    0 references
    The authors propose a new nonmonotone line search for Liu-Storey conjugate gradient method for unconstrained minimization problems of the form \[ \min f(x),\quad x\in\mathbb{R}^n. \] Numerical experiments are given and show that the new approach is effective in practical computation.
    0 references
    0 references
    unconstrained optimization
    0 references
    conjugate gradient method
    0 references
    global convergence
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers