Abstract
In this paper, the global optimization problem with a multiextremal objective function satisfying the Lipschitz condition over a hypercube is considered. An algorithm that belongs to the class of information methods introduced by R.G. Strongin is proposed. The knowledge of the Lipschitz constant is not supposed. The local tuning on the behavior of the objective function and a new technique, named the local improvement, are used in order to accelerate the search. Two methods are presented: the first one deals with the one-dimensional problems and the second with the multidimensional ones (by using Peano-type space-filling curves for reduction of the dimension of the problem). Convergence conditions for both algorithms are given. Numerical experiments executed on more than 600 functions show quite a promising performance of the new techniques.
Similar content being viewed by others
Explore related subjects
Find the latest articles, discoveries, and news in related topics.References
Bomze I.M., Csendes T., Horst R., Pardalos P.M.: Developments in Global Optimization. Kluwer, Dordrecht (1997)
Butz A.R.: Space filling curves and mathematical programming. Inf. Contr. 12(4), 313–330 (1968)
Evtushenko Yu.G.: Numerical methods for finding global extrema of a nonuniform mesh. USSR Comput. Math. Math. Phys. 11, 1390–1403 (1971)
Gaviano M., Kvasov D.E., Lera D., Sergeyev Ya.D.: Software for generation of classes of test functions with known local and global minima for global optimization. ACM TOMS 29(4), 469–480 (2003)
Grishagin, V.A.: Operation characteristics of some global optimization algorithms. Prob. Stoch. Search 7, 198–206 (In Russian) (1978)
Hansen P., Jaumard B., Lu S.H.: Global optimization of univariate Lipschitz functions: 2. New algorithms and computational comparison. Math. Program. 55, 273–293 (1992)
Horst R., Pardalos P.M.: Handbook of Global Optimization. Kluwer, Dordrecht (1995)
Kushner H.: A new method for locating the maximum point of an arbitrary multipeak curve in presence of noise. J. Basic Eng. 86, 97–106 (1964)
Lera D., Sergeyev Ya.D.: Global minimization algorithms for Holder functions. BIT 42(1), 119–133 (2002)
Pijavskii S.A.: An algorithm for finding the absolute extremum of a function. USSR Comput. Math. Math. Phys. 12, 57–67 (1972)
Pintér J.: Global Optimization in Action (Continuous and Lipschitz Optimization: Algorithms, Implementations and Applications). Kluwer, Dordrecht (1996)
Platzman L.K., Bartholdi J.J. III: Spacefilling curves and the planar travelling salesman problem. J. ACM 36(4), 719–737 (1989)
Ratscek H., Rokne J.: New Computer Methods for Global Optimization. Ellis Horwood, Chichester (1988)
Sergeyev Ya.D.: An information global optimization algorithm with local tuning. SIAM J. Optim. 5(4), 858–870 (1995)
Sergeyev Ya.D.: Global one-dimensional optimization using smooth auxiliary functions. Math. Program. 81, 127–146 (1998)
Sergeyev Ya.D., Daponte P., Grimaldi D., Molinaro A.: Two methods for solving optimization problems arising in electronic measurements and electrical engineering. SIAM J. Optim. 10(1), 1–21 (1999)
Sergeyev Ya.D., Kvasov D.E.: Diagonal Global Optimization Methods. FizMatLit, Moscow (2008)
Strongin R.G.: Numerical Methods in Multiextremal Problems. Nauka, Moscow (1978)
Strongin R.G.: The information approach to multiextremal optimization problems. Stoch. Stoch. Rep. 27, 65–82 (1989)
Strongin R.G.: Algorithms for multi-extremal mathematical programming problems employing the set of joint space-filling curves. J. Glob. Optim. 2, 357–378 (1992)
Strongin R.G., Sergeyev Ya.D.: Global Optimization with Non-Convex Constraints: Sequential and Parallel Algorithms. Kluwer, Dordrecht (2000)
Törn A.A., Z̆ilinskas A.: Global Optimization. Lecture Notes in Computer Science, 350. Springer, Berlin (1989)
Zhigljavsky A.A., Žilinskas A.: Stochastic Global Optimization. Springer, New York (2008)
Author information
Authors and Affiliations
Corresponding author
Additional information
This research was supported by the following grants: Italian PRIN project 2007-9PLLN7, Russian RFBR grant 07-01-00467-a, the Russian Federal Program “Scientists and Educators in Russia of Innovations”, contract number 02.740.11.5018, and the grant 4694.2008.9 for supporting the leading research groups awarded by the President of the Russian Federation.
Rights and permissions
About this article
Cite this article
Lera, D., Sergeyev, Y.D. An information global minimization algorithm using the local improvement technique. J Glob Optim 48, 99–112 (2010). https://doi.org/10.1007/s10898-009-9508-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-009-9508-x