GOSH: derivative-free global optimization using multi-dimensional space-filling curves

被引:30
作者
Lera, Daniela [1 ]
Sergeyev, Yaroslav D. [2 ,3 ,4 ]
机构
[1] Univ Cagliari, Dipartimento Matemat & Informat, Cagliari, Italy
[2] Univ Calabria, Dipartimento Ingn Informat Modellist Elettron & S, Via Pietro Bucci 42C, I-87036 Arcavacata Di Rende, CS, Italy
[3] Natl Res Council Italy, Inst High Performance Comp & Networking, Via Pietro Bucci 42C, I-87036 Arcavacata Di Rende, CS, Italy
[4] Lobachevskiy Univ Nizhni Novgorod, Dept Software & Supercomp, Gagarin Ave 23, Nizhnii Novgorod, Russia
基金
俄罗斯科学基金会;
关键词
Global optimization; Space-filling curves; Derivative-free methods; Acceleration; Lipschitz functions; HOLDER FUNCTIONS; ALGORITHM; LIPSCHITZ; SEARCH; SCHEME; ACCELERATION; CONSTANTS; WORKING;
D O I
10.1007/s10898-017-0589-7
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
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 Holder 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.
引用
收藏
页码:193 / 211
页数:19
相关论文
共 54 条
[1]  
[Anonymous], 1996, Global Optimization. Deterministic Approaches
[2]   Parallel global optimization on GPU [J].
Barkalov, Konstantin ;
Gergel, Victor .
JOURNAL OF GLOBAL OPTIMIZATION, 2016, 66 (01) :3-20
[3]   SPACE FILLING CURVES AND MATHEMATICAL PROGRAMMING [J].
BUTZ, AR .
INFORMATION AND CONTROL, 1968, 12 (04) :314-&
[4]   One-dimensional P-algorithm with convergence rate O(n-3+δ) for smooth functions [J].
Calvin, J ;
Zilinskas, A .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2000, 106 (02) :297-307
[5]   A deterministic approach to global box-constrained optimization [J].
Evtushenko, Yury ;
Posypkin, Mikhail .
OPTIMIZATION LETTERS, 2013, 7 (04) :819-829
[6]   A global optimization technique for checking parametric robustness [J].
Famularo, D ;
Pugliese, P ;
Sergeyev, YD .
AUTOMATICA, 1999, 35 (09) :1605-1611
[7]   Additive scaling and the DIRECT algorithm [J].
Finkel, D. E. ;
Kelley, C. T. .
JOURNAL OF GLOBAL OPTIMIZATION, 2006, 36 (04) :597-608
[8]   A locally-biased form of the DIRECT algorithm [J].
Gablonsky, JM ;
Kelley, CT .
JOURNAL OF GLOBAL OPTIMIZATION, 2001, 21 (01) :27-37
[9]  
Gablonsky M. J., 2001, TECHNICAL REPORT
[10]  
Gablonsky MJ, 2001, THESIS