Application of neural networks: a molecular geometry optimization study

Summary form only given. Optimization algorithms are iterative procedures that evolve from guessed starting points (SP) to the desired global minimum. Their performance can be greatly improved, if a neural network (NN) is created to select suitable SP. In this paper we consider the use of trained NN to select possible ground-state geometries for silicon clusters. A genetic algorithm is initial population energy optimization. For convenience, a cluster's geometry is described as a piling up of plane layers of atoms.

[1]  Anders Krogh,et al.  Introduction to the theory of neural computation , 1994, The advanced book program.

[2]  M. R. Lemes,et al.  Generalized simulated annealing: Application to silicon clusters , 1997 .

[3]  Andrew H. Sung,et al.  Neural networks as an aid to iterative optimization methods , 1998, SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218).