Abstract
A large number of algorithms introduced in the literature to find the global minimum of a real function rely on iterative executions of searches of a local minimum. Multistart, tunneling and some versions of simulated annealing are methods that produce well-known procedures. A crucial point of these algorithms is to decide whether to perform or not a new local search. In this paper we look for the optimal probability value to be set at each iteration so that by moving from a local minimum to a new one, the average number of function evaluations evals is minimal. We find that this probability has to be 0 or 1 depending on the number of function evaluations required by the local search and by the size of the level set at the current point. An implementation based on the above result is introduced. The values required to calculate evals are estimated from the history of the algorithm at running time. The algorithm has been tested both for sample problems constructed by the GKLS package and for problems often used in the literature. The outcome is compared with recent results.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Horst R., Pardalos P.: Handbook of Global Optimization. Kluwer, Dordrecht (1995)
Horst R., Tuy H.: Global Optimization, Deterministic Approaches. Springer, Berlin (1993)
Strongin R., Sergeyev Y.: Global Optimization with Non-convex Constraints: Sequential and Parallel Algorithms. Kluwer, Dordrecht (2000)
Zhigljavsky A., Žilinskas A.: Stochastic Global Optimization. Springer, New York (2008)
Boender C.G.E., Rinnooy Kan A.H.G.: Bayesian stopping rules for multistart global optimization methods. Math. Program. 37, 59–80 (1987)
Cetin B.C., Barhen J., Burdick J.W.: Terminal repeller unconstrained subenergy tunnelling (trust) for fast global optimization. J. Optim. Theory Appl. 77(1), 97–126 (1993)
Desai, R., Patil, R.: Salo: combining simulated annealing and local optimization for efficient global optimization. In: Proceedings 9th Florida AI Research Simposium (FLAIRS-96’), pp. 233–237 (1996)
Hedar A.R., Fukushima M.: Tabu search directed by direct search methods for non linear global optimization. Eur. J. Oper. Res. 170(2), 329–349 (2006)
Levy A., Montalvo A.: The tunneling algorithm for the global minimization of functions. SIAM J. Sci. Stat. Comp. 6, 15–29 (1985)
Lucidi S., Piccioni M.: Random tunneling by means of acceptance-rejection sampling for global optimization. J. Optim. Theory Appl. 62(2), 255–277 (1989)
Oblow E.M.: Spt: a stochastic tunneling algorithm for global optimization. J. Global Optim. 20, 195–212 (2001)
Gaviano M., Kvasov D., Lera D., Sergeyev Y.: Software for generation of test functions with known local and global minima for global optimization. ACM Trans. Math. Softw. 29(4), 469–480 (2003)
Torn, A., Zilinskas, A.: Global Optimization. Lectures Notes in Computer Science, vol. 350, pp. 1–252. Springer (1989)
Kelley C.T.: Iterative Methods for Optimization. SIAM, Philadelphia (1999)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Gaviano, M., Lera, D. & Steri, A.M. A local search method for continuous global optimization. J Glob Optim 48, 73–85 (2010). https://doi.org/10.1007/s10898-009-9519-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-009-9519-7