Parallelized hybrid optimization methods for nonsmooth problems using NOMAD and linesearch (Q1993602)

From MaRDI portal
Revision as of 16:59, 16 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
Parallelized hybrid optimization methods for nonsmooth problems using NOMAD and linesearch
scientific article

    Statements

    title
    Parallelized hybrid optimization methods for nonsmooth problems using NOMAD and linesearch (English)
    0 references
    author
    Giampaolo Liuzzi
    0 references
    Klaus Truemper
    0 references
    publication date
    5 November 2018
    0 references
    zbMATH Keywords
    derivative-free optimization
    0 references
    nonsmooth optimization
    0 references
    parallel algorithms
    0 references
    cites work
    NOMAD
    0 references
    Algorithm 659
    0 references
    Q4692508
    0 references
    Algorithm 856
    0 references
    Algorithm 909
    0 references
    Q3932576
    0 references
    describes a project that uses
    NOMAD
    0 references
    APPSPACK
    0 references
    OPT++
    0 references
    OrthoMADS
    0 references
    TOMS659
    0 references
    SDPEN
    0 references
    DFL
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C30
    0 references
    90C56
    0 references
    49J52
    0 references
    68W10
    0 references
    zbMATH DE Number
    6973259
    0 references
    OpenAlex ID
    W2755987995
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1993602&oldid=38820747"
    Powered by MediaWiki