A direct search algorithm for global optimization
From MaRDI portal
Publication:1736805
DOI10.3390/a9020040zbMath1461.90169OpenAlexW2423494995MaRDI QIDQ1736805
José R. Perán, Alberto Herreros, Enrique Baeyens
Publication date: 26 March 2019
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a9020040
direct search methodsglobal optimizationderivative-free optimizationheuristics-based optimizationsearch space transformation
Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items (2)
A comparative study on recently-introduced nature-based global optimization methods in complex mechanical system design ⋮ Spatiotemporal interpolation through an extension of differential evolution algorithm for agricultural insurance claims
Uses Software
Cites Work
- Optimization by Simulated Annealing
- Lipschitz global optimization methods in control problems
- Computing sums of conditionally convergent and divergent series using the concept of grossone
- A modified DIRECT algorithm with bilevel partition
- Constrained global optimization of expensive black box functions using radial basis functions
- Additive scaling and the \texttt{DIRECT} algorithm
- Advances in differential evolution
- New filled functions for nonsmooth global optimization
- Lipschitz and Hölder global optimization using space-filling curves
- Incorporating minimum Frobenius norm models in direct search
- Lipschitzian optimization without the Lipschitz constant
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- A new filled function applied to global optimization.
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Direct search methods: Then and now
- The globally convexized filled functions for global optimization
- Revised filled function methods for global optimization.
- Globally-biased disimpl algorithm for expensive global optimization
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- Stochastic global optimization.
- Direct search methods for nonlinearly constrained optimization using filters and frames
- Introduction to Global Optimization Exploiting Space-Filling Curves
- Simplicial Global Optimization
- A global minimization algorithm with parallel iterations
- Introduction to Derivative-Free Optimization
- `` Direct Search Solution of Numerical and Statistical Problems
- Minimization by Random Search Techniques
- Direct Search Methods on Parallel Machines
- Tabu Search—Part I
- Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
- Trust Region Methods
- Pattern Search Methods for Linearly Constrained Minimization
- A Pattern Search Filter Method for Nonlinear Programming without Derivatives
- Pattern Search Algorithms for Bound Constrained Minimization
- A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds
- Use of quadratic models with mesh-adaptive direct search for constrained black box optimization
- Complete search in continuous global optimization and constraint satisfaction
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- A Simplex Method for Function Minimization
- A Sequential Method Seeking the Global Maximum of a Function
- Numerical methods for finding global extrema (Case of a non-uniform mesh)
- Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation
- A locally-biased form of the DIRECT algorithm.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A direct search algorithm for global optimization
