Interval Branch-and-Bound (B&B) algorithms are powerful methods which aim for guaranteed solutions of Global Optimisation problems. Lower bounds for a function in a given interval can be obtained directly with Interval Arithmetic. The use of lower bounds based on Taylor forms show a faster convergence to the minimum with decreasing size of the search interval. Our research focuses on one dimensional functions that can be decomposed into several terms (sub-functions). The question is whether using this characteristic leads to sharper bounds when based on bounds of the sub-functions. This paper deals with functions that are an addition of two sub-functions, also called additively separable functions. The use of the separability is investigated for the so-called Baumann form and Lower Bound Value Form (LBVF). It is proven that using the separability in the LBVF form may lead to a combination of linear minorants that are sharper than the original one. Numerical experiments confirm this improving behaviour and also show that not all separable methods do always provide sharper lower bounds.
|Title of host publication||Proceedings of the 12th International Conference, 18-21 June 2012, Salvador de Bahia, Brazil, Proceedings Part III|
|Editors||B. Murgante, G. Osvaldo, S. Misra|
|Place of Publication||Heidelberg|
|Publication status||Published - 2012|
|Name||Lecture Notes in Computer Science|