2005
DOI: 10.1016/j.cplett.2005.03.044
|View full text |Cite
|
Sign up to set email alerts
|

Genetic algorithms optimization approach supported by the first-order derivative and Newton–Raphson methods: Application to fluorescence spectroscopy

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
13
0

Year Published

2006
2006
2013
2013

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 7 publications
(13 citation statements)
references
References 2 publications
0
13
0
Order By: Relevance
“…The genetic algorithm Genetic algorithms (GA) are computational methods, which are inspired by the principal ideas of biological evolution (18), and used to construct numerical optimization techniques suitable for the analyses of an ill-behaved search space. Recently GA was implemented in fluorescence spectroscopy (19); here this approach is employed for the first time, to our knowledge, for analysis of fluorescent depolarization data collected by the TCSPC technique.…”
Section: Theoretical Backgroundmentioning
confidence: 99%
“…The genetic algorithm Genetic algorithms (GA) are computational methods, which are inspired by the principal ideas of biological evolution (18), and used to construct numerical optimization techniques suitable for the analyses of an ill-behaved search space. Recently GA was implemented in fluorescence spectroscopy (19); here this approach is employed for the first time, to our knowledge, for analysis of fluorescent depolarization data collected by the TCSPC technique.…”
Section: Theoretical Backgroundmentioning
confidence: 99%
“…In the parameters set, we distinguish two subsets which include linear and nonlinear parameters, respectively. The latter are subjects to the GA optimization, while the former are found, for each individual, by the Newton-Raphson minimization of a quadratic form set up by the v 2 merit function [15]. In our case, the linear parameters are the decays amplitudes A c .…”
Section: Illustrative Examplementioning
confidence: 99%
“…The increasing number of dimensions of the searched parameters space depreciates usability of the gradient expansion method, successfully applied in the symmetric rotor case [13]. The measure presented in this work in order to surmount these difficulties consists in applying the genetic algorithm (GA) method [14], as in [13,15], to localize presumable global minimum of the v 2 merit function, whereafter using the local gradient search algorithm to refine the values of the recovered model parameters. This approach merges good exploration ability of the GA and a convergence speed-up of the gradients method in the vicinity of the minimum.…”
Section: Introductionmentioning
confidence: 99%
“…In this section we come back to the GA-NR algorithm introduced in our recent publication 13 and mentioned in short in the Introduction. We here want to add a few important explanatory comments on the application of the GA-NR optimizer to linear and weakly nonlinear model parameters that occur in the same optimization problem together with the nonlinear parameters.…”
Section: Optimization Of Linear Weakly Nonlinear and Nonlinear Model ...mentioning
confidence: 99%
“…In ref 13 we have discussed the methods for reduction of the number of fitted nonlinear and linear model parameters appearing in the nonlinear model functions. Such methods may eliminate essential problems with the "inconvenient" nonlinear and linear fitted parameters, for which the prediction of initial guesses in the GE optimization or their most adequate upper and lower bounds in the GA optimization represents a serious difficulty.…”
Section: Introductionmentioning
confidence: 99%