Abstract
In this paper, we give a new branch and bound algorithm for the global optimization problem with bound constraints. The algorithm is based on the use of inclusion functions. The bounds calculated for the global minimum value are proved to be correct, all rounding errors are rigorously estimated. Our scheme attempts to exclude most “uninteresting” parts of the search domain and concentrates on its “promising” subsets. This is done as fast as possible (by involving local descent methods), and uses little information as possible (no derivatives are required). Numerical results for many well-known problems as well as some comparisons with other methods are given.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alefeld, G. and Herzberger, J. (1983),Introduction to Interval Computations, Academic Press, New York.
Boender, C., Kan, A. R., Timmer, G. and Stougie, L. (1982), A stochastic method for global optimization.Mathematical Programming,22: 125–140.
Brent, R. P. (1973),Algorithms for Minimization without Derivatives, Prentice-Hall Inc., Englewood Cliffs, New Jersey.
Charalambous, C. and Bandler, J. W. (1976), Non-linear minimax optimization as a sequence of leastpth optimization with finite values ofp.J. Comput. Syst. Sci. 7(4): 377–391.
Csendes, T. (1991), Test Results of Interval Methods for Global Optimization, 417–424, in E. Kaucher, S. M. Markov, G. Mayer,Computer Arithmetic, Scientific Computation and Mathematical Modelling, IMACS.
Dixon, L. C. W. and Szegö, G. P. (eds.), (1975),Towards Global Optimization, North-Holland, Amsterdam.
Dixon, L. C. W. and Szegö, G. P. (eds.), (1978),Towards Global Optimization 2, North-Holland, Amsterdam.
Hansen, E. R. (1979), Global Optimization Using Interval Analysis —the One-Dimensional Case,J. Optim. Theor. and Appl. 29, 331–344.
Hansen, E. R. (1980), Global Optimization Using Interval Analysis —the Multidimensional Case,Numerische Mathematik 34, 247–270.
Hansen, E. R. (1992),Global Optimization Using Interval Analysis, Marcel Dekker Inc., New York.
Horst, R. and Tuy, H. (1990),Global Optimization, Springer-Verlag, Berlin.
Jansson, C. (1991), A Global Minimization Method: The One-Dimensional Case, Bericht 91.2 des Forschungsschwerpunktes Informations-und Kommunikationstechnik der TU Hamburg-Harburg.
Jansson, C. (1992), A Global Optimization Method Using Interval Arithmetik. In L. Atanassova and J. Herzberger,Computer Arithmetic and Enclosure Methods, 259–267, North-Holland, Amsterdam.
Jansson, C. and Knüppel, O. (1992), A Global Minimization Method: The Multi-Dimensional Case, Bericht 92.1 des Forschungsschwerpunktes Informations-und Kommunikationstechnik der TU Hamburg-Harburg.
Kearfott, B. Du, K. (1993) The Cluster Problem in Global Optimization,Computing Suppl. 9, 117–127.
Knüppel, O. (1993), BIAS —Basic Interval Arithmetic Subroutines, Bericht 93.3 des Forschungsschwerpunktes Informations-und Kommunikationstechnik der TU Hamburg-Harburg.
Knüppel, O. (1993), PROFIL —Programmer's Runtime Optimized Fast Interval Library, Bericht 93.4 des Forschungsschwerpunktes Informations-und Kommunikationstechnik der TU Hamburg-Harburg.
Knüppel, O. (1994), PROFIL/BIAS —A Fast Interval Library,Computing 53, 277–287.
Kulisch, U. and Miranker, W. L. (1981),Computer Arithmetic in Theory and Practice, Academic Press, New York.
Lohner, R. (1989), Enclosing all eigenvalues of symmetric matrices. InAccurate Numerical Algorithms, A Collection of Research Papers, volume 1 of Research Reports ESPRIT, Project 1072, DIAMOND, 87–103. Springer, Berlin.
Moore, R. E. (1966),Interval Analysis, Prentice-Hall, Englewood Cliffs, N.J.
Moore, R. E. (1976) On Computing the Range of Values of a Rational Function ofn Variables over a Bounded Region,Computing 16, 1–15.
Moore, R. E. (1979),Methods and Applications of Interval Analysis, SIAM, Philadelphia.
Moore, R., Hansen, E., and Leclerc, A. (1992), Rigorous Methods for Global Optimization. InRecent Advances in Global Optimization, Princeton series in computer science, 321–342. Princeton University Press, Princeton, New Jersey.
Murty, K. G. and Kabadi, S. N. (1987), Some NP-Complete Problems in Quadratic and Nonlinear Programming,Mathematical Programming 39, 117–130.
Neumaier, A. (1990),Interval Methods for Systems of Equations, Cambridge University Press.
Pardalos, P. M. and Rosen, J. B. (1987),Constrained Global Optimization: Algorithms and Applications, Springer Lecture Notes Comp. Sci. 268, Berlin.
Ratschek, H. (1985), Inclusion Functions and Global Optimization,Mathematical Programming 33, 300–317.
Ratschek, H. and Rokne, J. (1984),Computer Methods for the Range of Functions, Ellis Horwood Limited, Chichester.
Ratschek, H. and Rokne, J. (1988),New Computer Methods for Global Optimization, Ellis Horwood Limited, Chichester.
Ratz, D. (1992), An Inclusion Algorithm for Global Optimization in a Portable PASCAL-XSC Implementation, in L. Atanassova and J. Herzberger,Computer Arithmetic and Enclosure Methods, North-Holland, 329–339, Amsterdam.
Rump, S. M. (1983), Solving Algebraic Problems with High Accuracy, in U. W. Kulisch and W.L. Miranker (eds),A New Approach to Scientific Computation, Academic Press, New York.
Shen, Zuhe, Neumaier, A., and Eiermann, M.C. (1990), Solving Minimax Problems by Interval Methods,BIT 30, 742–751.
Skelboe, S. (1974), Computation of Rational Interval Functions,BIT 14, 87–95.
Törn, A. and Zilinskas, A. (1989),Global Optimization, Springer-Verlag, Berlin Heidelberg New York.
Walster, G., Hansen, E., and Sengupta, S., (1985), Test results for a global optimization algorithm.Numerical Optimization 1984, 272–287.
Wilkinson, J. H. (1971), Modern error analysis,SIAM Rev. 13, 548–568.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Jansson, C., Knüppel, O. A branch and bound algorithm for bound constrained optimization problems without derivatives. J Glob Optim 7, 297–331 (1995). https://doi.org/10.1007/BF01279453
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01279453