Mathematics (Feb 2024)

Allocation of Starting Points in Global Optimization Problems

  • Oleg Khamisov,
  • Eugene Semenkin,
  • Vladimir Nelyub

DOI
https://doi.org/10.3390/math12040606
Journal volume & issue
Vol. 12, no. 4
p. 606

Abstract

Read online

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