Abstract
In this article, we introduce a global optimization algorithm that integrates the basic idea of interval branch and bound, and new local sampling strategies along with an efficient data structure. Also included in the algorithm are procedures that handle constraints. The algorithm is shown to be able to find all the global optimal solutions under mild conditions. It can be used to solve various optimization problems. The local sampling (even if done stochastically) is used only to speed up the convergence and does not affect the fact that a complete search is done. Results on several examples of various dimensions ranging from 1 to 100 are also presented to illustrate numerical performance of the algorithm along with comparison with another interval method without the new local sampling and several noninterval methods. The new algorithm is seen as the best performer among those tested for solving multi-dimensional problems.
Similar content being viewed by others
References
G. Alefeld J. Herzberger (1983) Introduction to Interval Computations Academic Press New York, NY
J. Clausen A. Zilinskas (2002) ArticleTitleSubdivision, sampling,and initialization strategies for simplical branch and bound in global optimization Computers & Mathematics with Applications 44 943–955
A.E. Csallner (2001) ArticleTitleLipschitz continuity and the termination of interval methods for global optimization Computers & Mathematics with Applications 42 1035–1042
J.E. Falk R.M. Soland (1969) ArticleTitleAn algorithm for separable nonconvex programming problems Management Science 15 550–569
C.A. Floudas P.M. Pardalos (1990) A Collection of Test Problems for Constrained Global Optimization Algorithms Springer-Verlag Berlin Heidelberg
D.E. Goldberg (1989) Genetic Algorithms in Search, Optimization and Machine Learning Addison-Wesley Reading MA
E.R. Hansen (1992) Global Optimization using Interval Analysis Marcel Dekker NY
R. Horst (1976) ArticleTitleAn algorithm for nonconvex programming problems Mathematical Programming 10 312–321 Occurrence Handle10.1007/BF01580678
R. Horst H. Tuy (1990) Global Optimization, Deterministic Approaches Springer-Verlag Berlin
K. Ichida Y. Fujii (1979) ArticleTitleAn interval arithmetic method for global optimization Computing 23 85–97
Kearfott, R.B. (1996), A review of techniques in the verified solution of constrained global optimization problems. In: Applications of Interval Computations (El Paso, TX, 1995), Appl. Optim., vol. 3, Kluwer Acad. Publ., Dordrecht, 23–59.
Z. Michalewicz (1996) Genetic Algorithms + Data Structures = Evolution Programs, 3rd ed. Springer-Verlag Berlin
S. Kirkpatrick C.D. Gelatt SuffixJr. M.P. Vecchi (1983) ArticleTitleOptimization by simulated annealing Science 220 671–680
R.E. Moore (1966) Interval Analysis Prentice-Hall Englewood Cliffs, NJ.
R.E. Moore (1979) Methods and Applications of Interval Analysis SIAM Publication Philadelphia, Pennsylvania
A. Neumaier (1990) Interval Methods for Systems of Equations Cambridge University Press Cambridge, U.K
H. Ratscheck J. Rokne (1984) Computer Methods for the Range of Functions Ellis Horwood Limited Chichester
H. Ratscheck J. Rokne (1988) New Computer Methods for Global Optimization Wiley New York, NY
S. Skelboe (1974) ArticleTitleComputation of rational interval functions BIT 14 87–95 Occurrence Handle10.1007/BF01933121
Sun, M. (2002), Tree annealing for constrained optimization, In: Proceedings of 34th IEEE Southeastern Symposium on System Theory, Huntsville, AL, pp. 412–416.
T. Van Voorhis (2002) ArticleTitleA global optimization algorithm using Lagrangian underestimates and the interval Newton method Journal of Global Optimization 24 349–370 Occurrence Handle10.1023/A:1020383700229
Z.B. Xu J.S. Zhang Y.W. Leung (1997) ArticleTitleA general CDC formulation for specializing the cell exclusion algorithms of finding all zeros of vector functions Applied Mathematics and Computation 86 235–259 Occurrence Handle10.1016/S0096-3003(96)00191-9
X. Yao Y. Liu G. Lin (1999) ArticleTitleEvolutionary programming made faster IEEE Transactions on Evolutionay Computation 3 82–102 Occurrence Handle10.1109/4235.771163
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Sun, M., Johnson, A. Interval Branch and Bound with Local Sampling for Constrained Global Optimization. J Glob Optim 33, 61–82 (2005). https://doi.org/10.1007/s10898-004-6097-6
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10898-004-6097-6