82 search results - page 2 / 17 » A New Multisection Technique in Interval Methods for Global ... |
SARA
2009
Springer
14 years 2 months ago
2009
Springer
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...
AMC
2005
13 years 7 months ago
2005
We present an interval branch-and-prune algorithm for computing verified enclosures for the global minimum and all global minimizers of univariate functions subject to bound const...
ICCAD
2004
IEEE
14 years 4 months ago
2004
IEEE
New embedded systems offer rich power management features in the form of multiple operational and non-operational power modes. While they offer mechanisms for better energy effic...
JGO
2010
13 years 6 months ago
2010
In this paper, the global optimization problem with an objective function that is multiextremal that satisfies the Lipschitz condition over a hypercube is considered. An algorithm...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
This paper introduces a new method for proving global stability of fluid flows through the construction of Lyapunov functionals. For finite dimensional approximations of fluid...