Reducing the Number of Function Evaluations in Mesh Adaptive Direct Search Algorithms

DOI10.1137/120895056zbMath1297.90149OpenAlexW2056272789WikidataQ58201042 ScholiaQ58201042MaRDI QIDQ3192095

Andrea Ianni, Charles Audet, Sébastien Le Digabel, Christophe Tribes

Publication date: 26 September 2014

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/820f7ff79b5e78634fd0b0310e3c3be58375bc39

zbMATH Keywords

nonsmooth optimizationderivative-free optimizationblackbox optimizationpositive spanning setsmesh adaptive direct search (mads) algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)

Related Items (30)

On the properties of positive spanning sets and positive bases ⋮ Dynamic scaling in the mesh adaptive direct search algorithm for blackbox optimization ⋮ Calibration by optimization without using derivatives ⋮ A progressive barrier derivative-free trust-region algorithm for constrained optimization ⋮ Mesh-based Nelder-Mead algorithm for inequality constrained optimization ⋮ A discussion on variational analysis in derivative-free optimization ⋮ Random derivative-free algorithm for solving unconstrained or bound constrained continuously differentiable non-linear problems ⋮ 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 ⋮ ANOVA-MOP: ANOVA Decomposition for Multiobjective Optimization ⋮ Parallel distributed block coordinate descent methods based on pairwise comparison oracle ⋮ Escaping local minima with local derivative-free methods: a numerical investigation ⋮ Equal angle distribution of polling directions in direct-search methods ⋮ A deterministic algorithm to compute the cosine measure of a finite positive spanning set ⋮ Uniform simplex of an arbitrary orientation ⋮ Two decades of blackbox optimization applications ⋮ Nicely structured positive bases with maximal cosine measure ⋮ Mesh adaptive direct search with second directional derivative-based Hessian update ⋮ Convergence of derivative-free nonmonotone direct search methods for unconstrained and box-constrained mixed-integer optimization ⋮ The Mesh Adaptive Direct Search Algorithm for Granular and Discrete Variables ⋮ Handling of constraints in multiobjective blackbox optimization ⋮ Black-Box Optimization: Methods and Applications ⋮ Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates ⋮ On the properties of the cosine measure and the uniform angle subspace ⋮ Mesh adaptive direct search with simplicial Hessian update ⋮ DMulti-MADS: mesh adaptive direct multisearch for bound-constrained blackbox multiobjective optimization ⋮ Derivative-free optimization methods ⋮ Positive bases with maximal cosine measure ⋮ Dynamic improvements of static surrogates in direct search optimization ⋮ Linear equalities in blackbox optimization

This page was built for publication: Reducing the Number of Function Evaluations in Mesh Adaptive Direct Search Algorithms