CONSTRAINED BACKGROUND BILINEARIZATION WITH A GENERALIZED SIMULATED ANNEALING ALGORITHM
Citation
Yl. Xie et al., CONSTRAINED BACKGROUND BILINEARIZATION WITH A GENERALIZED SIMULATED ANNEALING ALGORITHM, Journal of chemometrics, 7(5), 1993, pp. 369-379
Categorie Soggetti
Chemistry Analytical","Statistic & Probability
SICI code
0886-9383(1993)7:5<369:CBBWAG>2.0.ZU;2-X
Abstract
Generalized simulated annealing (GSA) is an optimization technique for
locating the global optimum. In this paper GSA was used as the optimi
zation procedure in the constrained background bilinearization (CBBL)
of two-way bilinear data in order to reduce the possibility of sinking
into local optima. The behaviour of the algorithm and its comparison
with the modified Powell algorithm were studied by simulations and rea
l fluorescence excitation-emission data for organic dye mixtures.