Hill-Climbing Algorithm with a Stick for Unconstrained Optimization Problems
主 题: Hill-Climbing Algorithm with a Stick for Unconstrained Optimization Problems
报告人: 黄云清教授 (湘潭大学)
时 间: 2017-06-17 16:00 - 17:00
地 点: 理科一号楼 1114
Inspired by the behavior of the blind for hill-climbing using a stick to detect a higher place in the form of 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.