@Article{AAMM-9-2,
author = {Yunqing, Huang and Kai, Jiang},
title = {Hill-Climbing Algorithm with a Stick for Unconstrained Optimization Problems},
journal = {Advances in Applied Mathematics and Mechanics},
year = {2017},
volume = {9},
number = {2},
pages = {307--323},
abstract = {<p style="text-align: justify;">Inspired by the behavior of the blind for hill-climbing using a stick to detect
a higher place by drawing a circle, we propose a heuristic direct search method to
solve the unconstrained optimization problems. Instead of searching a neighbourhood
of the current point as done in the traditional hill-climbing, or along specified search
directions in standard direct search methods, the new algorithm searches on a surface
with radius determined by the motion of the stick. The significant feature of the proposed
algorithm is that it only has one parameter, the search radius, which makes the
algorithm convenient in practical implementation. The developed method can shrink
the search space to a closed ball, or seek for the final optimal point by adjusting search
radius. Furthermore, our algorithm possesses multi-resolution feature to distinguish
the local and global optimum points with different search radii. Therefore, it can be
used by itself or integrated with other optimization methods flexibly as a mathematical
optimization technique. A series of numerical tests, including high-dimensional
problems, have been well designed to demonstrate its performance.</p>},
issn = {2075-1354},
doi = {https://doi.org/10.4208/aamm.2016.m1481},
url = {https://global-sci.com/article/73252/hill-climbing-algorithm-with-a-stick-for-unconstrained-optimization-problems}
}