Mathematical modeling of a parallel global optimization algorithm
From MaRDI portal
Publication:582823
For the solution of the global optimization problem on a message passing parallel computer (Intel hypercube) an algorithm is selected. This algorithm is carefully modelled, i.e. a mathematical model for its execution time is established. The model compares excellently with measurements. This model then allows to understand better the algorithm, to predict performance (instead of running many sample problems) and to improve the algorithm.
Recommendations
- Parallel algorithms for global optimization
- scientific article; zbMATH DE number 802433
- A parallel algorithm for global optimization
- Parallel search algorithms in global optimization
- Global multidimensional optimization on parallel computer
- scientific article; zbMATH DE number 3920212
- Properties and numerical testing of a parallel global optimization algorithm
- Parallel global optimization of functions of several variables
- Generalized parallel computational schemes for time-consuming global optimization
- Parallel characteristical algorithms for solving problems of global optimization
Cited in
(5)- A parallel method for finding the global minimum of univariate functions
- A model of computer structure organization for solving global optimization problems with an algorithmic complexity that is independent of the problem size
- Iteration grain sized asynchronous parallel algorithms in optimization
- scientific article; zbMATH DE number 2168936 (Why is no real title available?)
- Properties and numerical testing of a parallel global optimization algorithm
This page was built for publication: Mathematical modeling of a parallel global optimization algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q582823)
