Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm
From MaRDI portal
Publication:3395009
DOI10.1137/070707518zbMath1180.90363OpenAlexW2144809990WikidataQ58201083 ScholiaQ58201083MaRDI QIDQ3395009
Sébastien Le Digabel, Charles Audet, John E. jun. Dennis
Publication date: 20 August 2009
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1911/102078
convergence analysisnonsmooth optimizationasynchronous parallel algorithmmesh adaptive direct search (MADS)parallel space decomposition
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56) Parallel algorithms in computer science (68W10)
Related Items
A batch, derivative-free algorithm for finding multiple local minima, Dynamic scaling in the mesh adaptive direct search algorithm for blackbox optimization, Mesh-based Nelder-Mead algorithm for inequality constrained optimization, Asynchronously parallel optimization solver for finding multiple minima, Optimal 3D printing of complex objects in a \(5\)-axis printer, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Robust optimization of noisy blackbox problems using the mesh adaptive direct search algorithm, Quantifying uncertainty with ensembles of surrogates for blackbox optimization, Parallel distributed block coordinate descent methods based on pairwise comparison oracle, Escaping local minima with local derivative-free methods: a numerical investigation, A decomposition method by interaction prediction for the optimization of maintenance scheduling, Black-box optimization on hyper-rectangle using recursive modified pattern search and application to ROC-based classification problem, Two decades of blackbox optimization applications, Efficient use of parallelism in algorithmic parameter optimization applications, Constrained stochastic blackbox optimization using a progressive barrier and probabilistic estimates, Convergence of derivative-free nonmonotone direct search methods for unconstrained and box-constrained mixed-integer optimization, Parallel strategies for direct multisearch, A variance-based method to rank input variables of the mesh adaptive direct search algorithm, The Mesh Adaptive Direct Search Algorithm for Granular and Discrete Variables, Decomposition in derivative-free optimization, Combining cross-entropy and MADS methods for inequality constrained global optimization, Parallelized hybrid optimization methods for nonsmooth problems using NOMAD and linesearch, An Initialization Strategy for High-Dimensional Surrogate-Based Expensive Black-Box Optimization, Use of quadratic models with mesh-adaptive direct search for constrained black box optimization, A mesh adaptive direct search algorithm for multiobjective optimization, Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates, Recursive modified pattern search on high-dimensional simplex: a blackbox optimization technique, Derivative-free optimization methods, GOPS: efficient RBF surrogate global optimization algorithm with high dimensions and many parallel processors including application to multimodal water quality PDE model calibration, On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization
Uses Software
