Design and implementation of a massively parallel version of DIRECT

DOI10.1007/s10589-007-9092-2zbMath1181.90138OpenAlexW2083957939MaRDI QIDQ953213

Jian He, Layne T. Watson, Masha Sosonkina, Alex Verstak

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

zbMATH Keywords

DIRECTdata structuresload balancingglobal searchtask allocation

Mathematics Subject Classification ID

Search theory (90B40) Parallel numerical computation (65Y05)

Related Items (15)

Derivative-free global ship design optimization using global/local hybridization of the DIRECT algorithm ⋮ A batch, derivative-free algorithm for finding multiple local minima ⋮ Asynchronously parallel optimization solver for finding multiple minima ⋮ Optimal 3D printing of complex objects in a \(5\)-axis printer ⋮ Parallel global optimization on GPU ⋮ On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization ⋮ Escaping local minima with local derivative-free methods: a numerical investigation ⋮ Lipschitz-inspired \texttt{HALRECT} algorithm for derivative-free global optimization ⋮ An empirical study of various candidate selection and partitioning techniques in the \texttt{DIRECT} framework ⋮ Parallel deterministic and stochastic global minimization of functions with very many minima ⋮ Solving a set of global optimization problems by the parallel technique with uniform convergence ⋮ A multi-objective \textbf{DIRECT} algorithm for ship hull optimization ⋮ DIRECT ⋮ A univariate global search working with a set of Lipschitz constants for the first derivative ⋮ Derivative-free optimization methods

Uses Software

• ARMCI
• GPSHMEM

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.

This page was built for publication: Design and implementation of a massively parallel version of DIRECT