Local Tuning in Nested Scheme of Global Optimization

被引:36
作者
Gergel, Victor [1 ]
Grishagin, Vladimir [1 ]
Israfilov, Ruslan [1 ]
机构
[1] Lobachevsky State Univ Nizhni Novgorod, Nizhnii Novgorod, Russia
来源
INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE, ICCS 2015 COMPUTATIONAL SCIENCE AT THE GATES OF NATURE | 2015年 / 51卷
关键词
Global Lipschitz optimization; nested optimization scheme; adaptive tuning; speed-up of convergence; SPACE-FILLING CURVES; ALGORITHM; DERIVATIVES;
D O I
10.1016/j.procs.2015.05.216
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Numerical methods for global optimization of the multidimensional multiextremal functions in the framework of the approach oriented at dimensionality reduction by means of the nested optimization scheme are considered. This scheme reduces initial multidimensional problem to a set of univariate subproblems connected recursively. That enables to apply efficient univariate algorithms for solving the multidimensional problems. The nested optimization scheme served as the source of many methods for optimization of Lipschitzian function. However, in all of them there is the problem of estimating the Lipschitz constant as the parameter of the function optimized and, as a consequence, of tuning to it the optimization method. In the methods proposed earlier, as a rule, a global estimate (related to whole search domain) is used whereas local Lipschitz constants in some subdomains can differ significantly from the global constant. It can slow down the optimization process considerably. To overcome this drawback in the article the finer estimates of a priori unknown Lipschitz constants taking into account local properties of the objective function are considered and used in the nested optimization scheme. The results of numerical experiments presented demonstrate the advantages of methods with mixed (local and global) estimates of Lipschitz constants in comparison with the use of the global ones only.
引用
收藏
页码:865 / 874
页数:10
相关论文
共 33 条
[1]  
[Anonymous], 1989, Lecture Notes in Computer Science
[2]  
Barkalov K. A., 2014, P 1 INT C ENG APPL S, P2111
[3]   High performance computing in biomedical applications [J].
Bastrakov, S. ;
Meyerov, I. ;
Gergel, V. ;
Gonoskov, A. ;
Gorshkov, A. ;
Efimenko, E. ;
Ivanchenko, M. ;
Kirillin, M. ;
Malova, A. ;
Osipov, G. ;
Petrov, V. ;
Surmin, I. ;
Vildemanov, A. .
2013 INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE, 2013, 18 :10-19
[4]   SPACE FILLING CURVES AND MATHEMATICAL PROGRAMMING [J].
BUTZ, AR .
INFORMATION AND CONTROL, 1968, 12 (04) :314-&
[5]  
Carr C.R., 1964, QUANTITATIVE DECISIO
[6]   Algorithm 829: Software for generation of classes of test functions with known local and global minima for global optimization [J].
Gaviano, M ;
Kvasov, DE ;
Lera, D ;
Sergeyev, YD .
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 2003, 29 (04) :469-480
[7]  
Gergel VP, 2003, LECT NOTES COMPUT SC, V2763, P76
[8]   A global optimization algorithm for multivariate functions with Lipschitzian first derivatives [J].
Gergel, VP .
JOURNAL OF GLOBAL OPTIMIZATION, 1997, 10 (03) :257-281
[9]  
Gergel VP, 1996, COMP MATH MATH PHYS+, V36, P729
[10]   Global optimization with space-filling curves [J].
Goertzel, B .
APPLIED MATHEMATICS LETTERS, 1999, 12 (08) :133-135