Mathematical Programming: Series A and B - Special Issue: Essays on Nonconvex Optimization
New computer methods for global optimization
New computer methods for global optimization
Journal of Optimization Theory and Applications
A General Global Optimization Approach for Solving Location Problems in the Plane
Journal of Global Optimization
Empirical convergence speed of inclusion functions for facility location problems
Journal of Computational and Applied Mathematics - Special issue: Scientific computing, computer arithmetic, and validated numerics (SCAN 2004)
Computers and Operations Research
The big cube small cube solution method for multidimensional facility location problems
Computers and Operations Research
Continuous location problems and Big Triangle Small Triangle: constructing better bounds
Journal of Global Optimization
Geometric fit of a point set by generalized circles
Journal of Global Optimization
Convergence rate of McCormick relaxations
Journal of Global Optimization
Theoretical rate of convergence for interval inclusion functions
Journal of Global Optimization
Convergence analysis of Taylor models and McCormick-Taylor models
Journal of Global Optimization
Journal of Global Optimization
Hi-index | 0.00 |
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.