Escaping local minima with local derivative-free methods: a numerical investigation
From MaRDI portal
Publication:5093686
DOI10.1080/02331934.2021.1883015zbMath1492.65162OpenAlexW3131312709MaRDI QIDQ5093686
Lindon Roberts, Coralia Cartis, Oliver Sheridan-Methven
Publication date: 1 August 2022
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2021.1883015
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hyperband: A Novel Bandit-Based Approach to Hyperparameter Optimization
- A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
- Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search
- Design and implementation of a massively parallel version of DIRECT
- Globalization strategies for mesh adaptive direct search
- Efficient global optimization of expensive black-box functions
- Lipschitzian optimization without the Lipschitz constant
- Topographical global optimization using pre-sampled points
- Topographical multilevel single linkage
- A note on the Griewank test function
- Methods to compare expensive stochastic optimization algorithms with random restarts
- Dynamic data structures for a direct search algorithm
- A taxonomy of global optimization methods based on response surfaces
- An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables
- Globally-biased disimpl algorithm for expensive global optimization
- A derivative-free Gauss-Newton method
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- A DIRECT-type approach for derivative-free constrained global optimization
- Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization
- A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization
- Algorithm 897
- Algorithm 909
- Direct Multisearch for Multiobjective Optimization
- Implicit Filtering
- Reducing the Number of Function Evaluations in Mesh Adaptive Direct Search Algorithms
- Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm
- Convergence of Mesh Adaptive Direct Search to Second‐Order Stationary Points
- OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
- Introduction to Derivative-Free Optimization
- Stochastic global optimization methods part I: Clustering methods
- Stochastic global optimization methods part II: Multi level methods
- Trust Region Methods
- Derivative-Free and Blackbox Optimization
- The Mesh Adaptive Direct Search Algorithm for Granular and Discrete Variables
- Improving the Flexibility and Robustness of Model-based Derivative-free Optimization Solvers
- Benchmarking Derivative-Free Optimization Algorithms
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- A radial basis function method for global optimization
- A derivative-free algorithm for bound constrained optimization
