Hooke & Jeeves

From BlueM
Revision as of 03:04, 22 January 2018 by Froehlich (talk | contribs) (category)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

EVO.png BlueM.Opt | Usage | Development

Beschreibung

Hillclimbing Algorithmus nach Hooke & Jeeves (1961)[1].

Beschränkt auf Single-Objective Problemstellungen.

Erforderliche Eingabedateien

Literaturangaben

  1. Hooke, R., and T. A. Jeeves (1961) Direct Search. Solution of Numerical and Statistical Problems. Journal of Association of Computational Machinery 8:2.