Reducing the number of function evaluations in mesh adaptive direct search algorithms
From MaRDI portal
Recommendations
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search
- A mesh adaptive direct search algorithm for multiobjective optimization
- Optimization algorithm based on densification and dynamic canonical descent
- Robust optimization of noisy blackbox problems using the mesh adaptive direct search algorithm
Cited in
(34)- Mesh adaptive direct search algorithms for mixed variable optimization
- A progressive barrier derivative-free trust-region algorithm for constrained optimization
- Mesh-based Nelder-Mead algorithm for inequality constrained optimization
- Robust optimization of noisy blackbox problems using the mesh adaptive direct search algorithm
- Parallel distributed block coordinate descent methods based on pairwise comparison oracle
- Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates
- On the properties of the cosine measure and the uniform angle subspace
- DMulti-MADS: mesh adaptive direct multisearch for bound-constrained blackbox multiobjective optimization
- A deterministic algorithm to compute the cosine measure of a finite positive spanning set
- Uniform simplex of an arbitrary orientation
- Mesh adaptive direct search with simplicial Hessian update
- Positive bases with maximal cosine measure
- Dynamic improvements of static surrogates in direct search optimization
- Linear equalities in blackbox optimization
- 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
- Optimization algorithm based on densification and dynamic canonical descent
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Random derivative-free algorithm for solving unconstrained or bound constrained continuously differentiable non-linear problems
- Erratum: Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- ANOVA-MOP: ANOVA decomposition for multiobjective optimization
- The mesh adaptive direct search algorithm for granular and discrete variables
- Escaping local minima with local derivative-free methods: a numerical investigation
- Black-Box Optimization: Methods and Applications
- Derivative-free optimization methods
- Two decades of blackbox optimization applications
- Nicely structured positive bases with maximal cosine measure
- Convergence of derivative-free nonmonotone direct search methods for unconstrained and box-constrained mixed-integer optimization
- Handling of constraints in multiobjective blackbox optimization
- A discussion on variational analysis in derivative-free optimization
- Spent potliner treatment process optimization using a MADS algorithm
- Equal angle distribution of polling directions in direct-search methods
- Mesh adaptive direct search with second directional derivative-based Hessian update
This page was built for publication: Reducing the number of function evaluations in mesh adaptive direct search algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3192095)
