In this paper, we propose a decentralized parallel computation model for global optimization using interval analysis. The model is adaptive to any number of processors and there is no need to design an initial decomposition scheme to feed each processor at the beginning. The work load is distributed evenly among all processors by alternative message passing. Numerical experiments indicate that the model works well and is stable with different number of parallel processors, distributes the load evenly among the processors, and provides an impressive speedup, especially when the problem is time-consuming to solve
The problem of finding a global minimum of a real function on a set S of Rn occurs in many real worl...
Global optimization problems sometimes attain their extrema on infinite subsets of the search space,...
The problem of finding a global minimum of a real function on a set S Rn occurs in many real world p...
In this paper, we propose a decentralized parallel computation model for global optimization using i...
In this paper, we propose a decentralized parallel computation model for global optimization using i...
In this paper, we propose a decentralized parallel computation model for global optimization using i...
During the past few years the interest paid to global opt imization has rapidly increased. One of th...
The focus of this paper is on the analysis and evaluation of a type of parallel strategies applied t...
Branch-and-prune (BP) and branch-and-bound (BB) techniques are commonly used for intelligent search ...
International audienceHansen's algorithm for verified continuous global optimization is based on int...
(eng) This paper describes efficient coarse-grained parallel algorithms and implementations for a su...
Global optimization problems arise in a wide range of real-world problems. They include applications...
AbstractWe give a short overview of the general ideas involved in solving optimization problems usin...
Reliability of computational results is crucial in computational science and engineering. In this pa...
This thesis presents new algorithms for the deterministic global optimization of general non-linear ...
The problem of finding a global minimum of a real function on a set S of Rn occurs in many real worl...
Global optimization problems sometimes attain their extrema on infinite subsets of the search space,...
The problem of finding a global minimum of a real function on a set S Rn occurs in many real world p...
In this paper, we propose a decentralized parallel computation model for global optimization using i...
In this paper, we propose a decentralized parallel computation model for global optimization using i...
In this paper, we propose a decentralized parallel computation model for global optimization using i...
During the past few years the interest paid to global opt imization has rapidly increased. One of th...
The focus of this paper is on the analysis and evaluation of a type of parallel strategies applied t...
Branch-and-prune (BP) and branch-and-bound (BB) techniques are commonly used for intelligent search ...
International audienceHansen's algorithm for verified continuous global optimization is based on int...
(eng) This paper describes efficient coarse-grained parallel algorithms and implementations for a su...
Global optimization problems arise in a wide range of real-world problems. They include applications...
AbstractWe give a short overview of the general ideas involved in solving optimization problems usin...
Reliability of computational results is crucial in computational science and engineering. In this pa...
This thesis presents new algorithms for the deterministic global optimization of general non-linear ...
The problem of finding a global minimum of a real function on a set S of Rn occurs in many real worl...
Global optimization problems sometimes attain their extrema on infinite subsets of the search space,...
The problem of finding a global minimum of a real function on a set S Rn occurs in many real world p...