Allocation of Starting Points in Global Optimization Problems

被引:1
|
作者
Khamisov, Oleg [1 ]
Semenkin, Eugene [2 ]
Nelyub, Vladimir [2 ]
机构
[1] Melentiev Energy Syst Inst, Dept Appl Math, Lermontov St 130, Irkutsk 664033, Russia
[2] Bauman Moscow State Tech Univ, Sci & Educ Ctr Artificial Intelligence Technol, 2nd Baumanskaya St,5, Moscow 105005, Russia
关键词
multistart; maximum distant points; multiple local minima;
D O I
10.3390/math12040606
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We propose new multistart techniques for finding good local solutions in global optimization problems. The objective function is assumed to be differentiable, and the feasible set is a convex compact set. The techniques are based on finding maximum distant points on the feasible set. A special global optimization problem is used to determine the maximum distant points. Preliminary computational results are given.
引用
收藏
页数:21
相关论文
共 50 条