On global optimization using interval arithmetic

Identification of uncertain nonlinear systems for robust fuzzy control

“…Closer bounds for the interval function can be found using a branch and bound technique [21][22][23][24]. The bounds of the interval valued function can be found using the interval arithmetic rules combined with a branch and bound technique which splits boxes adaptively until the overestimation becomes insignificant.…”

“…If it is linear, it can be solved easily by inequality constrained linear programming approach. In case of nonlinear interval valued functions, the bounds can be estimated from the methods addressed in the literature [21][22][23][24].…”

Intersection points algorithm for piecewise algebraic curves based on Groebner bases

“…It is easy to observe that: Nowadays, interval arithmetic has been widely applied to many scientific fields, see [17][18][19][20][21]. For example, interval arithmetic is helpful in solving polynomial equations system.…”

Design of Intelligent Cross-Layer Routing Protocols for Airborne Wireless Networks Under Dynamic Spectrum Access Paradigm

“…We have used the branch and bound (BnB) technique to solve the priority-aware expected weighted goodput optimization problem [43][44][45]. BnB is a global optimization technique used for non-convex problems, especially in discrete and combinatorial optimization.…”

“…The Branch and Bound (BnB) algorithm along with an interval arithmetic method [43][44][45] is used to find the maximum expected weighted goodput and derive the optimal fragment sizes. In order to reduce error propagation within a group of pictures (GOP), we use a slice discard scheme based on frame importance and the cumulative mean square error (CMSE) contribution of the slice.…”