New computer methods for global optimization
New computer methods for global optimization
Global optimization
Subdivision Direction Selection in Interval Methods for Global Optimization
SIAM Journal on Numerical Analysis
C++ Toolbox for Verified Scientific Computing I: Basic Numerical Problems
C++ Toolbox for Verified Scientific Computing I: Basic Numerical Problems
On lower bounds using additively separable terms in interval b&b
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part III
| Hi-index | 0.00 |
A new pruning method for interval branch and bound algorithms is presented. In reliable global optimization methods there are several approaches to make the algorithms faster. In minimization problems, interval B&B methods use a good upper bound of the function at the global minimum and good lower bounds of the function at the subproblems to discard most of them, but they need efficient pruning methods to discard regions of the subproblems that do not contain global minimizer points. The new pruning method presented here is based on the application of derivative information from the Baumann point. Numerical results were obtained by incorporating this new technique into a basic Interval B&B Algorithm in order to evaluate the achieved improvements.