Kearfott, Ralph - In: Journal of Global Optimization 59 (2014) 2, pp. 459-476
In branch and bound algorithms in constrained global optimization, a sharp upper bound on the global optimum is … important for the overall efficiency of the branch and bound process. Software to find local optimizers, using floating point … set that caused trouble for previous techniques, and is also employed in a mathematically rigorous branch and bound …