Abstract
Geometric branch-and-bound solution methods, in particular the big square small square technique and its many generalizations, are popular solution approaches for non-convex global optimization problems. Most of these approaches differ in the lower bounds they use which have been compared empirically in a few studies. The aim of this paper is to introduce a general convergence theory which allows theoretical results about the different bounds used. To this end we introduce the concept of a bounding operation and propose a new definition of the rate of convergence for geometric branch-and-bound methods. We discuss the rate of convergence for some well-known bounding operations as well as for a new general bounding operation with an arbitrary rate of convergence. This comparison is done from a theoretical point of view. The results we present are justified by some numerical experiments using the Weber problem on the plane with some negative weights.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Blanquero R., Carrizosa E.: Continuous location problems and big triangle small triangle: constructing better bounds. J. Glob. Optim. 45, 389–402 (2009)
Csallner A.E., Csendes T.: The convergence speed of interval methods for global optimization. Comput. Math. Appl. 31, 173–178 (1996)
Drezner Z.: A general global optimization approach for solving location problems in the plane. J. Glob. Optim. 37, 305–319 (2007)
Drezner T., Drezner Z.: Finding the optimal solution to the Huff based competitive location model. Comput. Manag. Sci. 1, 193–208 (2004)
Drezner Z., Suzuki A.: The big triangle small triangle method for the solution of nonconvex facility location problems. Oper. Res. 52, 128–135 (2004)
Fernández J., Pelegrín B., Plastria F., Tóth B.: Solving a huff-like competitive location and design model for profit maximization in the plane. Eur. J. Oper. Res. 179, 1274–1287 (2007)
Hansen E.: Global Optimization Using Interval Analysis, 1st edn. Marcel Dekker, New York (1992)
Hansen P., Peeters D., Richard D., Thisse J.F.: The minisum and minimax location problems revisited. Oper. Res. 33, 1251–1265 (1985)
Hiriart-Urruty J.B., Lemaréchal C.: Fundamentals of Convex Analysis, 1st edn. Springer, Berlin (2004)
Horst R., Thoai N.V.: DC programming: overview. J. Optim. Theory Appl. 103, 1–43 (1999)
Horst R., Tuy H.: Global Optimization: Deterministic Approaches, 3rd edn. Springer, Berlin (1996)
Horst R., Pardalos P.M., Thoai N.V.: Introduction to Global Optimization, 2nd edn. Springer, Berlin (2000)
Pardalos P.M., Resende M.G.C.: Handbook of Applied Optimization, 1st edn. Oxford University Press, Oxford (2002)
Plastria F.: GBSSS: The generalized big square small square method for planar single-facility location. Eur. J. Oper. Res. 62, 163–174 (1992)
Ratschek H., Rokne J.: New Computer Methods for Global Optimization, 1st edn. Ellis Horwood, Chichester (1988)
Rockafellar R.T.: Convex Analysis, 1st edn. Princeton University Press, Princeton (1970)
Schöbel A., Scholz D.: The big cube small cube solution method for multidimensional facility location problems. Comput. Oper. Res. 37, 115–122 (2010)
Tóth B., Csendes T.: Empirical investigation of the convergence speed of inclusion functions in a global optimization context. Reliab. Comput. 11, 253–273 (2005)
Tóth B., Fernández J., Csendes T.: Empirical convergence speed of inclusion functions for facility location problems. J. Comput. Appl. Math. 199, 384–389 (2007)
Tóth B., Fernández J., Pelegrín B., Plastria F.: Sequential versus simultaneous approach in the location and design of two new facilities using planar huff-like models. Comput. Oper. Res. 36, 1393–1405 (2009)
Tuy H.: A general D.C. approach to location problems. In: Floudas, C.A., Pardalos, P.M. (eds) State of the Art in Gloabal Optimization: Computational Methods and Applications, pp. 413–432. Kluwer, Dordrecht (1996)
Tuy H., Horst R.: Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems. Math. Program. 41, 161–183 (1988)
Tuy H., Al-Khayyal F., Zhou F.: A D.C. optimization method for single facility location problems. J. Glob. Optim. 7, 209–227 (1995)
We want to thank two anonymous referees for their helpful comments.
Open Access
This article is distributed under the terms of the Creative Commons Attribution Noncommercial License which permits any noncommercial use, distribution,and reproduction in any medium, provided the original author(s) and source are credited.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Schöbel, A., Scholz, D. The theoretical and empirical rate of convergence for geometric branch-and-bound methods. J Glob Optim 48, 473–495 (2010). https://doi.org/10.1007/s10898-009-9502-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-009-9502-3