Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization (Q2841063)

From MaRDI portal
Revision as of 00:54, 20 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization
scientific article

    Statements

    Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization (English)
    0 references
    0 references
    0 references
    24 July 2013
    0 references
    derivative-free optimization
    0 references
    direct search
    0 references
    smoothing function
    0 references
    worst-case complexity
    0 references
    nonsmoothness
    0 references
    nonconvexity
    0 references
    algorithm
    0 references
    convergence
    0 references
    numerical experiments
    0 references

    Identifiers

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