Abstract
We present a global optimization algorithm of the interval type that does not require a lot of memory and treats standard constraints. The algorithm is shown to be able to find one globally optimal solution under certain conditions. It has been tested with many examples with various degrees of complexity and a large variety of dimensions ranging from 1 to 2,000 merely in a basic personal computer. The extensive numerical experiments have indicated that the algorithm would have a good chance to successfully find a good approximation of a globally optimal solution. More importantly, it finds such a solution much more quickly and using much less memory space than a conventional interval method. The new algorithm is also compared with several noninterval global optimization methods in our numerical experiments, again showing its clear superiority in most cases.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alefeld G., Herzberger J.: Introduction to Interval Computations. Academic Press, New York (1983)
Ali M.M., Torn A., Viitanen S.: A direct search variant of the simulated annealing algorithm for optimization involving continuous variables. Comput. Oper. Res. 29, 87–102 (2002)
Bilbro G.L., Snyder W.E.: Optimization of functions with many minima. IEEE Trans. Syst. Man Cybern. 21(4), 840–849 (1991)
Clausen J., Zilinskas A.: Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization. Comput. Math. Appl. 44, 943–955 (2002)
Csallner A.E.: Lipschitz continuity and the termination of interval methods for global optimization. Comput. Math. Appl. 42, 1035–1042 (2001)
Csallner A.E., Csendes T.: The convergence speed of interval methods for global optimization. Comput. Math. Appl. 31, 173–178 (1996)
Cvijovic D., Klinowski J.: Tabu search: an approach to the multiple minima problem. Science 267, 664–666 (1995)
Falk J.E., Soland R.M.: An algorithm for separable nonconvex programming problems. Manag. Sci. 15, 550–569 (1969)
Floudas C.A., Pardalos P.M.: A Collection of Test Problems for Constrained Global Optimization Algorithms. Springer, Berlin (1990)
Glover F.: Tabu search—part I. ORSA J. Comput. 1(3), 190–206 (1989)
Goldberg D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading (1989)
Hansen E.R.: Global Optimization Using Interval Analysis. Marcel Dekker, NY (1992)
Hedar A.R., Fukushima M.: Derivative-free filter simulated annealing method for constrained continuous global optimization. J. Glob. Optim. 35, 521–549 (2006)
Horst R.: An algorithm for nonconvex programming problems. Math. Program. 10, 312–321 (1976)
Horst R., Tuy H.: Global Optimization, Deterministic Approaches. Springer, Berlin (1990)
Ichida K., Fujii Y.: An interval arithmetic method for global optimization. Computing 23, 85–97 (1979)
Kearfott R.B.: A review of techniques in the verified solution of constrained global optimization problems. In: Kearfott, R.B., Kreinovich, V. (eds) Applications of Interval Computations (El Paso, TX), Applied Optimization, vol. 3, pp. 23–60. Kluwer, Dordrecht (1996)
Kirkpatrick S., Gelatt C.D. Jr, Vecchi M.P.: Optimization by simulated annealing. Science 220, 671–680 (1983)
Michalewicz Z.: Genetic Algorithms + Data Structures = Evolution Programs. Springer, Berlin (1996)
Moore R.E.: Methods and Applications of Interval Analysis. SIAM Publication, Philadelphia (1979)
Moore R.E., Kearfott R.B., Cloud M.J.: Introduction to Interval Analysis. SIAM Publication, Philadelphia (2009)
Neumaier A.: Interval Methods for Systems of Equations. Encyclopedia of Mathematics and its Applications 37. Cambridge University Press, Cambridge (1991)
Pardalos P.M., Romeijn E.: Handbook of Global Optimization—Volume 2: Heuristic Approaches. Kluwer, Dordrecht (2002)
Pedamallu C.S., Ozdamar L., Csendes T., Vinko T.: Efficient interval partitioning approach for global optimization. J. Glob. Optim. 42, 369–384 (2008)
Ratscheck H., Rokne J.: New Computer Methods for Global Optimization. Wiley, New York (1988)
Siarry P., Berthiau G.: Fitting of Tabu Search to optimize functions of continuous variables. Intern. J. Numer. Methods Eng. 40(13), 2449–2457 (1997)
Skelboe S.: Computation of rational interval functions. BIT 14, 87–95 (1974)
Storn R., Price K.: Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 11, 341–359 (1997)
Sun M., Johnson A.W.: Interval branch and bound with local sampling for constrained global optimization. J. Glob. Optim. 33, 61–82 (2005)
Van Voorhis T.: A global optimization algorithm using Lagrangian underestimates and the interval Newton method. J. Glob. Optim. 24, 349–370 (2002)
Vavasis S.A.: Nonlinear Optimization: Complexity Issues. Oxford University Press, New York (1991)
Yao X., Liu Y., Lin G.: Evolutionary programming made faster. IEEE Trans. Evol. Comput. 3, 82–102 (1999)
Zhang X., Liu S.: Interval algorithm for global numerical optimization. Eng. Optim. 40, 849–868 (2008)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Sun, M. A fast memoryless interval-based algorithm for global optimization. J Glob Optim 47, 247–271 (2010). https://doi.org/10.1007/s10898-009-9472-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-009-9472-5