Allocation of Starting Points in Global Optimization Problems

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

Mathematics, 2024, vol. 12, issue 4, 1-21

Abstract: 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.

Keywords: multistart; maximum distant points; multiple local minima (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/12/4/606/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/4/606/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:12:y:2024:i:4:p:606-:d:1340991

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().