z-logo
Premium
Sequential number‐theoretic optimization (SNTO) method applied to chemical quantitative analysis
Author(s) -
Zhang Lin,
Liang YiZeng,
Yu RuQin,
Fang KaiTai
Publication year - 1997
Publication title -
journal of chemometrics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.47
H-Index - 92
eISSN - 1099-128X
pISSN - 0886-9383
DOI - 10.1002/(sici)1099-128x(199705)11:3<267::aid-cem477>3.0.co;2-t
Subject(s) - simulated annealing , global optimization , mathematical optimization , bilinear interpolation , local optimum , computer science , algorithm , optimization problem , mathematics , convergence (economics) , selection (genetic algorithm) , artificial intelligence , statistics , economics , economic growth
A sequential number‐theoretic optimization (SNTO) method recently developed in statistics was introduced as a global optimization procedure in constrained background bilinearization (CBBL) for the quantification of real two‐way bilinear data. SNTO searches for the global optimum among points uniformly scattered in the search space and convergence of the algorithm is quickened through sequential contraction of that space. Since the global optimization performance of SNTO is closely related to the number of points scattered, a new practical approach for selection of the number of points scattered in the original search space by trial tests is proposed in this paper in order to increase the possibility of locating the global optimum. The performance of SNTO has also been tested with mathematical models with multiple local optima. In comparison with another global optimization method, variable step size simulated annealing (VSGSA), SNTO achieved satisfactory results for both mathematical models and a real analytical system. The clarity and simplicity of the idea of SNTO together with its convenience for implementation make SNTO a promising tool in chemometrics. © 1997 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here