Hill climbing optimization

From Calculus
Revision as of 22:41, 9 May 2014 by Vipul (talk | contribs) (Created page with "==Definition== '''Hill climbing optimization''' refers to a subcategory of local search where, in each iteration, we change only one attribute of our guess. Examples of h...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Definition

Hill climbing optimization refers to a subcategory of local search where, in each iteration, we change only one attribute of our guess. Examples of hill-climbing optimization approaches include coordinate descent and gradient descent.

Retrieved from "https://calculus.subwiki.org/w/index.php?title=Hill_climbing_optimization&oldid=2677"