<ul data-eligibleForWebStory="true"><li>Algorithms of local optimization for problem solving involve checking function values for neighbors and moving to the best one until a stop condition is met.</li><li>The direction in local optimization is determined by the Hessian and works well when starting points are close to the extremum.</li><li>Using Cauchy's method for larger steps when far from the solution and switching to Newton's for points close to the solution is common.</li><li>Implementing tabu memory can prevent repetitive moves and facilitate intensive searching of solution neighborhoods.</li></ul>

Algorithms of local optimisation for problem solving

Discover more