Optimization of transition state structures using genetic algorithms

Journal of Mathematical Chemistry

Volumn 28, Issue 4, 2000, Pages 389-401

  Bungay, Sharene D ^a,b   Poirier, Raymond A ^a   Charron, Richard J ^a  

^a MEMORIAL UNIVERSITY OF NEWFOUNDLAND   (Canada)

^b UNIVERSITY OF GUELPH   (Canada)

Author keywords

Fitness value; Genetic algorithms; Optimization; Transition state structures

Indexed keywords

EID: 0034340223     PISSN: 02599791     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1011047105928     Document Type: Article

References (17)

1. C. Broyden, The convergence of a class of double rank minimization algorithms, Parts I and II, J. Inst. Math. Appl. 6 (1970) 76-90 and 222-231.
2. R. Fletcher, A new approach to variable metric algorithms, Comp. J. 13 (1970) 317-322.
3. D. Goldfarb, A family of variable metric methods derived by variational means, Math. Comp. 24 (1970) 23-26.
4. D. Shanno, Conditioning of quasi-Newton methods for function minimization, Math. Comp. 24 (1970) 647-656.
5. W. Davidon, Optimally conditioned optimization algorithms without line searches, Math. Prog. 9 (1975) 1-30.
6. J.M. Anglada and J.M. Bofill, How good is a Broyden-Fletcher-Goldfarb-Shanno-like update Hessian formula to locate transition structures? Specific reformulation of Broyden-Fletcher-Goldfarb-Shanno for optimizing saddle points, J. Comput. Chem. 19 (1998) 349-362.
7. J. Holland, Adaptation in Natural and Artificial systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence (University of Michigan Press, Ann Arbor, MI, 1975).
8. S.D. Bungay, Optimization of transition state structures using genetic algorithms, Master's thesis, Memorial University of Newfoundland, St. John's, NF, Canada (2000).
9. J. Mestres and G.E. Scuseria, Genetic algorithms: A robust scheme for geometry optimizations and global minimum structure problems, J. Comput. Chem. 16 (1995) 729-742.
10. A.Y. Jin, F.Y. Leung and D.F. Weaver, Development of a novel genetic algorithm search method (GAP1.0) for exploring peptide conformational space, J. Comput. Chem. 18 (1997) 1971-1984.
11. A.Y. Jin, F.Y. Leung and D.F. Weaver, Three variations of genetic algorithm for searching biomolecular conformation space: Comparison of GAP 1.0, 2.0, and 3.0, J. Comput. Chem. 20 (1999) 1329-1342.
12. S.M. Le Grand and K.M. Merz Jr., The application of the genetic algorithm to the minimization of potential energy functions, J. Global Opt. 3 (1993) 49-66.
13. R. Judson, Genetic algorithms and their use in chemistry, Reviews in Computational Chemistry 10 (1997) 1-73.
14. E.K.P. Chong and S.H. Zak, An Introduction to Optimization (Wiley, New York, 1996).
15. J. Baker and F. Chan, The location of transition states: A comparison of Cartesian, Z-matrix, and natural internal coordinates, J. Comput. Chem. 17 (1996) 888-904.
16. M.J.D. Powel, A method for minimizing a sum of squares of non-linear functions without calculating derivatives, Comp. J. 7 (1965) 303-307.
17. M.J.D. Powell, Subroutine VA05AD, AERE Subroutine Library, Harwell, Didcot, Berkshire, UK.