Тип публикации: статья из журнала

Год издания: 2024

Идентификатор DOI: 10.3390/math12040606

Аннотация: <jats:p>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.</jats:p>

Журнал: Mathematics

Выпуск журнала: Т. 12, № 4

Номера страниц: 606

ISSN журнала: 22277390

Место издания: Basel

Издатель: MDPI

• Khamisov Oleg (Department of Applied Mathematics, Melentiev Energy Systems Institute, Lermontov St. 130, 664033 Irkutsk, Russia)
• Semenkin Eugene (Scientific and Educational Center “Artificial Intelligence Technologies”, Bauman Moscow State Technical University, 2nd Baumanskaya St., 5, 105005 Moscow, Russia)
• Nelyub Vladimir (Scientific and Educational Center “Artificial Intelligence Technologies”, Bauman Moscow State Technical University, 2nd Baumanskaya St., 5, 105005 Moscow, Russia)

• Ядро РИНЦ (eLIBRARY.RU)