Abstract
Presented in this paper is the prototype of a very general algorithm referred to as Division – Deletion Algorithm (DDA) for solving the most general global search problem. Various necessary conditions, sufficient conditions, and necessary and sufficient conditions for the convergence of the algorithm are proposed and analyzed. As an example of its application, we demonstrate that the convergence of a standard Hansen’s interval algorithm for unconstrained global optimization simply follows from this general theory.
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. (1983). Introduction to Interval Computations. Academic Press, New York, NY
Csallner A.E., Csendes T., Markót M.C. (2000). Multisection in interval branch-and-bound methods for global optimization I. Theoretical results. J. Global Optim. 16:317–392
Csendes T. (2001). New subinterval selection criteria for interval global optimization. J. Global Optim. 19:307–327
Goldberg D.E. (1989). Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading, MA
Hansen E.R. (1980). Global optimization using interval analysis: the multidimensional case. Numer. Math. 34:247–270
Hansen E.R. (1992). Global Optimization Using Interval Analysis. Marcel Dekker, NY
Horst R. (1976). An algorithm for nonconvex programming problems. Math. Program. 10:312–321
Horst R., Tuy H. (1990). Global Optimization, Deterministic Approaches. Springer-Verlag, Berlin
Kearfott, R.B.: A review of techniques in the verified solution of constrained global optimization problems. Applications of interval computations (El Paso, TX, 1995), Appl. Optimi. 3, 23–59 (1996).
Kirkpatrick S., Gelatt Jr. C.D., Vecchi M.P. (1983). Optimization by simulated annealing, Science 220:671–680
Lawler E.L., Wood D.E. (1966). Branch-and-bound methods: A survey. Oper. Res. 14:699–719
Moore R.E. (1979). Methods and Applications of Interval Analysis. SIAM Publication, Philadelphia
Neumaier A. (1990). Interval Methods for Systems of Equations. Cambridge University Press, Cambridge, UK
Ratscheck H., Rokne J. (1988). New Computer Methods for Global Optimization. Wiley, New York, NY
Royden H.L. (1968). Real Analysis. Macmillan, New York, NY
Rudin W. (1964). Principles of Mathematical Analysis, 2nd edn. McGraw-Hill Inc., New York NY
Sun, M.: Tree annealing for constrained optimization, Proceedings of 34th IEEE Southeastern Symposium on System Theory, pp. 412–416 Huntsville, AL, (2002)
Sun M., Johnson A.W. (2005). Interval branch and bound with local sampling for constrained global optimization, J. Global Optimi. 33:61–82
Xu Z.B., Zhang J.S., Leung Y.W. (1997). A general CDC formulation for specializing the cell exclusion algorithms of finding all zeros of vector functions. Appl Math Comput 86:235–259
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Yang, X., Sun, M. Theoretical Convergence Analysis of a General Division–deletion Algorithm for Solving Global Search Problems. J Glob Optim 37, 27–45 (2007). https://doi.org/10.1007/s10898-006-9034-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-006-9034-z