  The beetle antennae search algorithm was recently proposed and investigated
for solving global optimization problems. Although the performance of the
algorithm and its variants were shown to be better than some existing
meta-heuristic algorithms, there is still a lack of convergence analysis. In
this paper, we provide theoretical analysis on the convergence of the beetle
antennae search algorithm. We test the performance of the BAS algorithm via
some representative benchmark functions. Meanwhile, some applications of the
BAS algorithm are also presented.
