Abstract

AbstractGeneralized simulated annealing (GSA) is an optimization technique for locating the global optimum. In this paper GSA was used as the optimization 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 real fluorescence excitation–emission data for organic dye mixtures.

Full Text
Paper version not known

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