Hill-Climbing Algorithm with a Stick for Unconstrained Optimization Problems (Q5155232)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Hill-Climbing Algorithm with a Stick for Unconstrained Optimization Problems |
scientific article; zbMATH DE number 7407128
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hill-Climbing Algorithm with a Stick for Unconstrained Optimization Problems |
scientific article; zbMATH DE number 7407128 |
Statements
Hill-Climbing Algorithm with a Stick for Unconstrained Optimization Problems (English)
0 references
6 October 2021
0 references
direct search algorithm
0 references
stick hill-climbing algorithm
0 references
search radius
0 references
0 references
0 references
0 references
0.87405026
0 references
0.86229837
0 references
0.8572736
0 references
0.8562608
0 references
0.8521719
0 references
0.8518381
0 references
0 references
