Global optimization with space-filling curves
暂无分享,去创建一个
Abstract It is shown that, contrary to a claim of Torn and Zilinskas, it is possible to efficiently optimize functions on n dimensions by projecting them into a single dimension using a space-filling curve.
[1] Aimo A. Törn,et al. Global Optimization , 1999, Science.
[2] A. J. Fisher. A new algorithm for generating hilbert curves , 1986, Softw. Pract. Exp..
[3] John Darzentas,et al. Problem Complexity and Method Efficiency in Optimization , 1983 .
[4] Francesco Archetti,et al. A probabilistic algorithm for global optimization problems with a dimensionality reduction technique , 1980 .
[5] H. Woxniakowski. Information-Based Complexity , 1988 .