Editing Local search (optimization) (section)

==See also==
Local search is a sub-field of:
* [[Metaheuristic]]s
* [[Stochastic optimization]]
* [[Mathematical optimization|Optimization]]

Fields within local search include:
* [[Hill climbing]]
* [[Simulated annealing]] (suited for either local or global search)
* [[Tabu search]]
* [[Late acceptance hill climbing]]
* Reactive search optimization (combining [[machine learning]] and local search heuristics)

===Real-valued search-spaces===
Several methods exist for performing local search of [[real number|real-valued]] search-spaces:
* [[Luus–Jaakola]] searches locally using a [[Uniform distribution (continuous)|uniform distribution]] and an exponentially decreasing search-range.
* [[Random optimization]] searches locally using a [[normal distribution]].
* [[Random search]] searches locally by sampling a [[hypersphere]] surrounding the current position.
* [[Pattern search (optimization)|Pattern search]] takes steps along the axes of the search-space using exponentially decreasing step sizes.