Abstract
There are many global optimization algorithms which do not use global information. We broaden previous results, showing limitations on such algorithms, even if allowed to run forever. We show that deterministic algorithms must sample a dense set to find the global optimum value and can never be guaranteed to converge only to global optimizers. Further, analogous results show that introducing a stochastic element does not overcome these limitations. An example is simulated annealing in practice. Our results show that there are functions for which the probability of success is arbitrarily small.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Piyavskii, S. A., An Algorithm for Finding the Absolute Extremum of a Function, USSR Computational Mathematics and Mathematical Physics, Vol. 12, pp. 57–67, 1972.
Shubert, B. O., A Sequential Method Seeking the Global Maximum of a Function, SIAM Journal on Numerical Analysis, Vol. 9, pp. 379–388, 1972.
Hansen, P., Jaumard, B., and Lu, S. H., Global Optimization of Uni-Variate Lipschitz Functions, II: New Algorithms and Computational Comparison, Mathematical Programming, Vol. 55, pp. 273–292, 1992.
Mladineo, R. H., An Algorithm for Finding the Global Maximum of Multimodal, Multivariate Functions, Mathematical Programming, Vol. 34, pp. 188–200, 1986.
Wood, G. R., Multidimensional Bisection and Global Optimization, Computers and Mathematics with Applications, Vol. 21, pp. 161–172, 1991.
Brent, R. P., Algorithms for Minimization without Derivatives, Prentice-Hall, Englewood Cliffs, New Jersey, 1973.
Breiman, L., and Cutter, A., A Deterministic Algorithm for Global Optimization, Mathematical Programming, Vol. 58, pp. 179–199, 1993.
Ratcheck, H., and Ronke, J. New Computer Methods for Global Optimization, Ellis Horwood Limited, Chichester, England, 1988.
Hansen, E., Global Optimization Using Interval Analysis, Marcel Dekker, New York, New York, 1992.
Kirkpatrick, S., Gelatt, C. D., and Vecchi, M. P., Optimization by Simulated Annealing, Science, Vol. 220, pp. 621–680, 1993.
Aluffi-Pentini, F., Parisi, V., and Zirilli, F., Global Optimization and Stochastic Differential Equations, Journal of Optimization Theory and Applications, Vol. 47, pp. 1–16, 1985.
Geman, S., and Hwang, C. R., Diffusions for Global Optimization, SIAM Journal on Control and Optimization, Vol. 24, pp. 1031–1043, 1986.
Jones, D. R., Perttunen, C. D., and Stuckman, B. E., Lipschitzian Optimization without the Lipschitz Constant, Journal of Optimization Theory and Application, Vol. 79, pp. 157–181, 1993.
Strongin, R. G., On the Convergence of an Algorithm for Finding a Global Extremum, Engineering Cybernetics, Vol. 11, pp. 549–555, 1973.
Sergeyev, Y. P., A Global Optimization Algorithm Using Derivatives and Local Tuning, Technical Report 1, Istituto per la Sistemistica e L'Informatica, Università della Calabria, 1994.
Solis, F. J., and Wets, R. J. B., Minimization by Random Search Techniques, Mathematics of Operation Research, Vol. 6, pp. 19–30, 1981.
Hansen, P., Jaumard, B., and Lu, S. H., On Using Estimates of Lipschitz Constants in Global Optimization, Journal of Optimization Theory and Applications, Vol. 75, pp. 195–200, 1992.
TÖrn, A., and Žilinskas, A., Global Optimization, Springer-Verlag, Berlin, Germany, 1989.
Hocking, J. G., and Young, G. S., Topology, Addison-Wesley Publishing Company, Reading, Massachusetts, 1961.
Hajek, B., Cooling Schedules for Optimal Annealing, Mathematics of Operations Research, Vol. 13, pp. 311–329, 1988.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Stephens, C.P., Baritompa, W. Global Optimization Requires Global Information. Journal of Optimization Theory and Applications 96, 575–588 (1998). https://doi.org/10.1023/A:1022612511618
Issue Date:
DOI: https://doi.org/10.1023/A:1022612511618