577 search results - page 1 / 116 » New interval methods for constrained global optimization |
MP
2006
13 years 5 months ago
2006
Abstract. Interval analysis is a powerful tool which allows to design branch-and-bound algorithms able to solve many global optimization problems. In this paper we present new adap...
COMPUTING
2000
13 years 5 months ago
2000
INFORMATICALT
2006
13 years 5 months ago
2006
New ways to estimate ranges of values of functions from standard and inner interval arithmetic have been proposed. Using the proposed ways ranges of values of mathematical test fun...
ANOR
2002
13 years 5 months ago
2002
A new algorithm for solving smooth large-scale minimization problems with bound constraints is introduced. The way of dealing with active constraints is similar to the one used in...
GECCO
2005
Springer
13 years 10 months ago
2005
Springer
During the optimization of a constrained problem using evolutionary algorithms (EAs), an individual in the population can be described using three important properties, i.e., obje...