Global optimization algorithms for bound constrained problems
László Pál · 2011
Frequently, X * consists only of a single point x * , but this is not necessarily the case in general.For the sake of algorithmic tractability, we suppose throughout this study that X * is countable.If the feasible set is given by its lower and upper bound,