A Filled Function Method for Finding a Global Minimizer of a Function of Several Variables
暂无分享,去创建一个
The concept of a filled function is introduced. We construct a particular filled function and analyze its properties. An algorithm for global minimization is generated based on the concept and properties of the filled function. Some typical examples with 1 to 10 variables are tested and computational results show that in most cases this algorithm works better than the tunneling algorithm. The advantages and disadvantages are analyzed and further research directions are discussed.
[1] J. F. Price,et al. On descent from local minima , 1971 .
[2] B. Shubert. A Sequential Method Seeking the Global Maximum of a Function , 1972 .
[3] H. Zimmermann. Towards global optimization 2: L.C.W. DIXON and G.P. SZEGÖ (eds.) North-Holland, Amsterdam, 1978, viii + 364 pages, US $ 44.50, Dfl. 100,-. , 1979 .
[4] A. V. Levy,et al. The Tunneling Algorithm for the Global Minimization of Functions , 1985 .