Dynamic lattice searching methods for optimization of clusters

Global optimization of clusters is a subject of intense interest in computational chemistry. Especially for large clusters, locating the global minima is a challenging problem. Two strategies are generally used for the problem, i.e., the stochastic optimization and the static modeling strategy. The former is known as unbiased global optimization method, while the latter is more efficient but biased. This review describes the development of a dynamic lattice searching (DLS) approach. In DLS, the lattices are constructed dynamically and optimization is achieved by searching these lattices. Therefore, DLS possesses the characteristics of both the stochastic and static methods. With the aim of improving the efficiency of DLS for optimization of large clusters, several variants of the method have been developed. The results show that DLS methods may be promising tools for fast modeling of large clusters. With this review, greater interests are expected for global optimization of atomic or molecular clusters.