Abstract

In iterative non-linear least-squares fitting, the reliable estimation of initial parameters that lead to convergence to the global optimum can be difficult. Irrespective of the algorithm used, poor parameter estimates can lead to abortive divergence if initial guesses are far from the true values or in rare cases convergence to a local optimum. For determination of the parameters of complex reaction mechanisms, where often little is known about what value these parameters should take, the task of determining good initial estimates can be time consuming and unreliable. In this contribution, the methodology of applying a genetic algorithm (GA) to the task of determining initial parameter estimates that lie near the global optimum is explained. A generalised genetic algorithm was implemented according to the methodology and the results of its application are also given. The parameter estimates obtained were then used as the starting parameters for a gradient search method, which quickly converged to the global optimum. The genetic algorithm was successfully applied to both simulated kinetic measurements where the reaction mechanism contained one equilibrium constant and two rate constants to be fitted, and to kinetic measurements of the complexation of Cu 2+ by 1,4,8,11-tetraazacyclotetradecane where two equilibrium and two rate constants were fitted. The implementation of the algorithm is such that it can be generally applied to any reaction mechanism that can be expressed by standard chemistry notation. The control parameters of the algorithm can be varied through a simple user interface to account for parameter range and the number of parameters involved.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.