GOSH: derivative-free global optimization using multi-dimensional space-filling curves |
| |
Authors: | Daniela Lera Yaroslav D. Sergeyev |
| |
Affiliation: | 1.Dipartimento di Matematica e Informatica,Università di Cagliari,Cagliari,Italy;2.Dipartimento di Ingegneria Informatica, Modellistica, Elettronica e Sistemistica,Università della Calabria and the Institute of High Performance Computing and Networking of the National Research Council of Italy,Rende,Italy;3.Department of Software and Supercomputing,Lobachevskiy University of Nizhni Novgorod,Nizhni Novgorod,Russia |
| |
Abstract: | Global optimization is a field of mathematical programming dealing with finding global (absolute) minima of multi-dimensional multiextremal functions. Problems of this kind where the objective function is non-differentiable, satisfies the Lipschitz condition with an unknown Lipschitz constant, and is given as a “black-box” are very often encountered in engineering optimization applications. Due to the presence of multiple local minima and the absence of differentiability, traditional optimization techniques using gradients and working with problems having only one minimum cannot be applied in this case. These real-life applied problems are attacked here by employing one of the mostly abstract mathematical objects—space-filling curves. A practical derivative-free deterministic method reducing the dimensionality of the problem by using space-filling curves and working simultaneously with all possible estimates of Lipschitz and Hölder constants is proposed. A smart adaptive balancing of local and global information collected during the search is performed at each iteration. Conditions ensuring convergence of the new method to the global minima are established. Results of numerical experiments on 1000 randomly generated test functions show a clear superiority of the new method w.r.t. the popular method DIRECT and other competitors. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|