Local search: Difference between revisions
(Created page with "==Definition== '''Local search''' is a general approach for finding points of local extremum of a function through an iterative algorithm. The idea is to start with a particu...") |
No edit summary |
||
| Line 1: | Line 1: | ||
==Definition== | ==Definition== | ||
'''Local search''' is a general approach for finding points of local extremum of a function through an iterative algorithm. The idea is to start with a particular guess and then improve it iteratively. | '''Local search''' is a general approach for finding points of local extremum of a function through an iterative algorithm. The idea is to start with a particular guess and then improve it iteratively. It is an [[wikipedia:anytime algorithm|anytime algorithm]], because at any intermediate stage, we can return the best guess so far and terminate the algorithm (albeit we hope that the more iterations we manage, the better our result). | ||
Latest revision as of 22:34, 9 May 2014
Definition
Local search is a general approach for finding points of local extremum of a function through an iterative algorithm. The idea is to start with a particular guess and then improve it iteratively. It is an anytime algorithm, because at any intermediate stage, we can return the best guess so far and terminate the algorithm (albeit we hope that the more iterations we manage, the better our result).