Design and implementation of a massively parallel version of DIRECT
From MaRDI portal
Publication:953213
DOI10.1007/s10589-007-9092-2zbMath1181.90138MaRDI QIDQ953213
Jian He, Layne T. Watson, Alex Verstak, Masha Sosonkina
Publication date: 17 November 2008
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-007-9092-2
Related Items
DIRECT, A univariate global search working with a set of Lipschitz constants for the first derivative
Uses Software
Cites Work
- Unnamed Item
- Lipschitzian optimization without the Lipschitz constant
- Dynamic data structures for a direct search algorithm
- Global optimization approaches to an aircraft routing problem
- Deterministic parallel global parameter estimation for a model of the budding yeast cell cycle
- A fully‐distributed parallel global search algorithm
- Min-max heaps and generalized priority queues
- A 2-D parallel convex hull algorithm with optimal communication phases
- A locally-biased form of the DIRECT algorithm.