Hooke & Jeeves: Difference between revisions

Latest revision as of 04:04, 22 January 2018

BlueM.Opt | Usage | Development

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

Beschränkt auf Single-Objective Problemstellungen.

OPT-Datei
MOD-Datei
ZIE-Datei
CON-Datei (werden Constraints bei H&J überhaupt berücksichtigt? -- Froehlich 10:31, 17. Dez. 2008 (UTC))

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

Revision as of 04:46, 26 March 2009 (view source) Froehlich (talk \| contribs) mNo edit summary ← Older edit		Latest revision as of 04:04, 22 January 2018 (view source) Froehlich (talk \| contribs) m (category)
Line 15:		Line 15:
	<references/>		<references/>

	[[Kategorie:BlueM.Opt ~~Anwendung~~]]		[[Kategorie:BlueM.Opt]]