We explore how a simple linear change of variable affects the inclusion functions obtained with Interval Analysis methods. Univariate and multivariate polynomial test functions are considered, showing that translation-based methods improve considerably the bounds computed by standard inclusion functions. An Interval Branch-and-Bound method for global optimization is then implemented to compare the different procedures, showing that, although with times higher than those given by Taylor forms, the number of clusters and iterations is strongly reduced
Interval global optimization algorithms based on branch-and-bound methods provide guaranteed and rel...
Abstract: Taylor models provide enclosures of functional dependencies by a polynomial and an interva...
AbstractWe give a short overview of the general ideas involved in solving optimization problems usin...
Most interval branch and bound methods for nonlinear algebraic systems have to date been based on im...
Global optimization methods in connection with interval arithmetic permit to determine an accurate e...
We investigate the use of higher order inclusion functions in the Moore-Skelboe (MS) algorithm of in...
International audienceWe study the problem of finding the global optimum of a nonlinear real functio...
AbstractInterval analysis provides a tool for (i) forward error analysis, (ii) estimating and contro...
Abstract. This paper contribution is about guaranteed numerical methods based on interval analysis f...
In interval computations, the range of each intermediate result r is described by an interval [r]. T...
The field of global optimization has been an active one for many years. By far the most applied meth...
The talk gives an overview on the numerical test results of solving inequality constrained global op...
The efficiency of global optimization methods in connection with interval arithmetic is no more to b...
When we usually process data, we, in effect, implicitly assume that we know the exact values of all ...
Branch and Bound (B&B) algorithms in Global Optimization are used to perform an exhaustive search ov...
Interval global optimization algorithms based on branch-and-bound methods provide guaranteed and rel...
Abstract: Taylor models provide enclosures of functional dependencies by a polynomial and an interva...
AbstractWe give a short overview of the general ideas involved in solving optimization problems usin...
Most interval branch and bound methods for nonlinear algebraic systems have to date been based on im...
Global optimization methods in connection with interval arithmetic permit to determine an accurate e...
We investigate the use of higher order inclusion functions in the Moore-Skelboe (MS) algorithm of in...
International audienceWe study the problem of finding the global optimum of a nonlinear real functio...
AbstractInterval analysis provides a tool for (i) forward error analysis, (ii) estimating and contro...
Abstract. This paper contribution is about guaranteed numerical methods based on interval analysis f...
In interval computations, the range of each intermediate result r is described by an interval [r]. T...
The field of global optimization has been an active one for many years. By far the most applied meth...
The talk gives an overview on the numerical test results of solving inequality constrained global op...
The efficiency of global optimization methods in connection with interval arithmetic is no more to b...
When we usually process data, we, in effect, implicitly assume that we know the exact values of all ...
Branch and Bound (B&B) algorithms in Global Optimization are used to perform an exhaustive search ov...
Interval global optimization algorithms based on branch-and-bound methods provide guaranteed and rel...
Abstract: Taylor models provide enclosures of functional dependencies by a polynomial and an interva...
AbstractWe give a short overview of the general ideas involved in solving optimization problems usin...