On the Efficient Gerschgorin Inclusion Usage in the Global Optimization {α}BB Method

In this paper, we revisit the {\alpha}BB method for solving global optimization problems. We investigate optimality of the scaling vector used in Gerschgorin's inclusion theorem to calculate bounds on the eigenvalues of the Hessian matrix. We propose two heuristics to compute good scaling vector d, and state three necessary optimality conditions for optimal d. Since the scaling vector calculated by the second presented method satisfies all three optimality conditions, it serves as a cheap but efficient solution.