On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization (Q2902870)

From MaRDI portal
Revision as of 16:00, 22 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization
scientific article

    Statements

    On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization (English)
    0 references
    0 references
    0 references
    0 references
    22 August 2012
    0 references
    oracle complexity
    0 references
    worst-case analysis
    0 references
    finite differences
    0 references
    first-order methods
    0 references
    derivative-free optimization
    0 references
    nonconvex optimization
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references