On the worst-case evaluation complexity of non-monotone line search algorithms (Q1694392)

From MaRDI portal
Revision as of 05:47, 28 December 2024 by Import241228121245 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the worst-case evaluation complexity of non-monotone line search algorithms
scientific article

    Statements

    On the worst-case evaluation complexity of non-monotone line search algorithms (English)
    0 references
    1 February 2018
    0 references
    nonlinear optimization
    0 references
    unconstrained optimization
    0 references
    non-monotone line search
    0 references
    worst-case complexity
    0 references
    0 references

    Identifiers