Abstract
Any global minimization algorithm is made by several local searches performed sequentially. In the classical multistart algorithm, the starting point for each new local search is selected at random uniformly in the region of interest. In the tunneling algorithm, such a starting point is required to have the same function value obtained by the last local minimization. We introduce the class of acceptance-rejection based algorithms in order to investigate intermediate procedures. A particular instance is to choose at random the new point approximately according to a Boltzmann distribution, whose temperatureT is updated during the algorithm. AsT → 0, such distribution peaks around the global minima of the cost function, producing a kind of random tunneling effect. The motivation for such an approach comes from recent works on the simulated annealing approach in global optimization. The resulting algorithm has been tested on several examples proposed in the literature.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bertsekas, D. P.,Constrained Optimization and Lagrange Multiplier Methods, Academic Press, New York, New York, 1982.
Dixon, L. C. W., andSzegö, G. P.,Toward Global Optimization 2, North-Holland, New York, New York, 1978.
Hartman, J. K.,Some Experiments in Global Optimization, Naval Research Logistic Quarterly, Vol. 20, pp. 569–576, 1973.
Levy, A. V., andMontalvo, A.,The Tunneling Algorithm for the Global Minimization of Functions, SIAM Journal on Scientific and Statistical Computing, Vol. 6, pp. 15–29, 1985.
Aluffi-Pentini, F., Parisi, V., andZirilli, F.,Global Optimization and Stochastic Differential Equations, Journal of Optimization Theory and Applications, Vol. 47, pp. 1–16, 1985.
Kirkpatrick, S., Gelatt, C. D., andVecchi, M. P. Optimization by Simulated Annealing, Science, Vol. 220, pp. 621–680, 1983.
Geman, S., andGeman, D.,Stochastic Relaxation, Gibbs Distribution, and Bayesian Restoration of Images, IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. PAMI-6, pp. 721–741, 1984.
Betrò, B.,Bayesian Testing of Nonparametric Hypotheses and Its Application to Global Optimization, Journal of Optimization Theory and Applications, Vol. 42, pp. 31–50, 1984.
Boender, C. G. E., andRinnooy Kan, A. H. G.,Bayesian Stopping Rules for Multistart Global Optimization Methods, Mathematical Programming, Vol. 37, pp. 59–80, 1987.
Chichinadze, V. K.,Random Search to Determine the Extremum of a Function of Several Variables, Engineering Cybernetics, Vol. 1, pp. 115–123, 1967.
Grippo, L., Lampariello, F., andLucidi, S.,A Nonmonotone Line Search Technique for Newton's Method, SIAM Journal on Numerical Analysis, Vol. 23, pp. 707–716, 1986.
Rubinstein, R. Y.,Simulation and the Monte Carlo Method, John Wiley and Sons, New York, New York, 1981.
Solis, F. J., andWets, R. J. B.,Minimizations by Random Search Techniques, Mathematics of Operations Research, Vol. 6, pp. 19–30, 1981.
Devroye, L. P.,Progressive Global Random Search of Continuous Functions, Mathematical Programming, Vol. 15, pp. 330–342, 1978.
Jaynes, E. T.,Information Theory and Statistical Mechanics, Physical Reviews, Vol. 106, pp. 620–630, 1957.
Hwang, C. R.,Laplace's Method Revisited: Weak Convergence of Probability Measures, Annals of Probability, Vol. 8, pp. 1177–1182, 1980.
Pincus, M.,A Closed Form Solution of Certain Programming Problems, Operations Research, Vol. 16, pp. 690–694, 1968.
Yudin, D. B.,Quantitative Analysis of Complex Systems, Part II, Engineering Cybernetics, Vol. 1, pp. 1–23, 1966.
Piccioni, M.,A Combined Multistart-Annealing Algorithm for Continuous Global Optimization, University of Maryland, Systems Research Center, Report No. 87–45, 1987.
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., andTeller, E.,Equations of State Calculations by Fast Computing Machines, Journal of Chemical Physics, Vol. 21, pp. 1087–1092, 1953.
Lucidi, S., andPiccioni, M.,Random Tunneling by Means of Acceptance-Rejection Sampling for Global Optimization, IASI-CNR, Report No. 187, 1987.
Hajek, B.,A Tutorial Survey of Theory and Applications of Simulated Annealing, Proceedings of IEEE Conference on Decision and Control, Fort Lauderdale, Florida, 1985.
Archetti, F., Betrò, B., andSteffè, S.,A Theoretical Framework for Global Optimization via Random Sampling, University of Pisa, Dipartimento di Ricerca Operativa e Scienze Statistiche, Report No. 25, 1975.
Archetti, F., andBetrò, B.,Recursive Stochastic Evaluation of the Level Set Measure in Global Optimization Problems, University of Pisa, Dipartimento di Ricerca Operativa e Scienze Statistiche, Report No. 21, 1975.
Di Pillo, G., andGrippo, L.,An Exact Penalty Method with Global Convergence Properties for Nonlinear Programming Problems, Mathematical Programming, Vol. 36, pp. 1–18, 1986.
Di Pillo, G., andGrippo, L.,Globally Exact Nondifferentiable Penalty Functions, University of Rome “La Sapienza,” Dipartimento di Informatica e Sistemistica, Report No. 10.87, 1987.
Lucidi, S.,New Results on a Class of Exact Augmented Lagrangians, Journal of Optimization Theory and Applications, Vol. 58, pp. 259–282, 1988.
Author information
Authors and Affiliations
Additional information
Communicated by F. Zirilli
Rights and permissions
About this article
Cite this article
Lucidl, S., Piccioni, M. Random tunneling by means of acceptance-rejection sampling for global optimization. J Optim Theory Appl 62, 255–277 (1989). https://doi.org/10.1007/BF00941057
Issue Date:
DOI: https://doi.org/10.1007/BF00941057