Direct search based on probabilistic feasible descent for bound and linearly constrained problems (Q2419520): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q128547599, #quickstatements; #temporary_batch_1724928618437 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q128547599 / rank | |||
Normal rank | |||
Latest revision as of 11:56, 29 August 2024
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
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
