Direct search based on probabilistic feasible descent for bound and linearly constrained problems (Q2419520)

From MaRDI portal
Revision as of 11:56, 29 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q128547599, #quickstatements; #temporary_batch_1724928618437)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Direct search based on probabilistic feasible descent for bound and linearly constrained problems
scientific article

    Statements

    Direct search based on probabilistic feasible descent for bound and linearly constrained problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 June 2019
    0 references
    derivative-free optimization
    0 references
    direct-search methods
    0 references
    bound constraints
    0 references
    linear constraints
    0 references
    feasible descent
    0 references
    probabilistic feasible descent
    0 references
    worst-case complexity
    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