Direct search based on probabilistic feasible descent for bound and linearly constrained problems (Q2419520): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: NOMAD / rank | |||
Normal rank | |||
Revision as of 07:04, 28 February 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
