Hooke & Jeeves: Difference between revisions
Jump to navigation
Jump to search
mNo edit summary |
m (category) |
||
| (One intermediate revision by the same user not shown) | |||
| Line 1: | Line 1: | ||
{{ | {{BlueM.Opt nav}} | ||
==Beschreibung== | ==Beschreibung== | ||
| Line 15: | Line 15: | ||
<references/> | <references/> | ||
[[Kategorie: | [[Kategorie:BlueM.Opt]] | ||
Latest revision as of 03:04, 22 January 2018
BlueM.Opt | Download | Usage | Development
Beschreibung
Hillclimbing Algorithmus nach Hooke & Jeeves (1961)[1].
Beschränkt auf Single-Objective Problemstellungen.
Erforderliche Eingabedateien
- OPT-Datei
- MOD-Datei
- ZIE-Datei
- CON-Datei (werden Constraints bei H&J überhaupt berücksichtigt? -- Froehlich 10:31, 17. Dez. 2008 (UTC))
Literaturangaben
- ↑ Hooke, R., and T. A. Jeeves (1961) Direct Search. Solution of Numerical and Statistical Problems. Journal of Association of Computational Machinery 8:2.