Dynamic scaling in the mesh adaptive direct search algorithm for blackbox optimization
From MaRDI portal
Publication:2358022
DOI10.1007/s11081-015-9283-0zbMath1364.90360OpenAlexW1925813256WikidataQ58201015 ScholiaQ58201015MaRDI QIDQ2358022
Charles Audet, Sébastien Le Digabel, Christophe Tribes
Publication date: 20 June 2017
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11081-015-9283-0
Applications of statistics in engineering and industry; control charts (62P30) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items
Mesh-based Nelder-Mead algorithm for inequality constrained optimization, Escaping Unknown Discontinuous Regions in Blackbox Optimization, Two decades of blackbox optimization applications, A concurrent implementation of the surrogate management framework with application to cardiovascular shape optimization, The Mesh Adaptive Direct Search Algorithm for Granular and Discrete Variables, Combining cross-entropy and MADS methods for inequality constrained global optimization, Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates, Generating set search using simplex gradients for bound-constrained black-box optimization, DMulti-MADS: mesh adaptive direct multisearch for bound-constrained blackbox multiobjective optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Analysis of direct searches for discontinuous functions
- A variance-based method to rank input variables of the mesh adaptive direct search algorithm
- On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals
- Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search
- Globalization strategies for mesh adaptive direct search
- Variable neighborhood search
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Constrained derivative-free optimization on thin domains
- Using QR decomposition to obtain a new instance of mesh adaptive direct search with uniformly distributed polling directions
- Convergence results for generalized pattern search algorithms are tight
- Asynchronous Parallel Pattern Search for Nonlinear Optimization
- Algorithm 909
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- On the Convergence of Pattern Search Algorithms
- Reducing the Number of Function Evaluations in Mesh Adaptive Direct Search Algorithms
- A Note on the Generation of Random Normal Deviates
- Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm
- OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
- Introduction to Derivative-Free Optimization
- Numerical Optimization
- Problem Formulation for Multidisciplinary Optimization
- Principles of Optimal Design
- New Sequential and Parallel Derivative-Free Algorithms for Unconstrained Minimization
- On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization
- Use of quadratic models with mesh-adaptive direct search for constrained black box optimization
- Benchmarking Derivative-Free Optimization Algorithms
- A Progressive Barrier for Derivative-Free Nonlinear Programming
- Stationarity Results for Generating Set Search for Linearly Constrained Optimization
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- Choosing a Point from the Surface of a Sphere
- Frame based methods for unconstrained optimization
