Finding local optima of high-dimensional functions using direct search methods
From MaRDI portal
Publication:2378372
Recommendations
Cites work
- `` Direct Search Solution of Numerical and Statistical Problems
- A hybrid method combining continuous tabu search and Nelder--Mead simplex algorithms for the global optimization of multiminima functions
- A Simplex Method for Function Minimization
- An Improved Procedure for Orthogonalising the Search Vectors in Rosenbrock's and Swann's Direct Search Optimisation Methods
- Analysis of Generalized Pattern Searches
- Asynchronous parallel pattern search for nonlinear optimization
- Continuous scatter search: an analysis of the integration of some combination methods and improvement strategies
- Direct search methods: Then and now
- Effect of dimensionality on the Nelder–Mead simplex method
- Experimental testing of advanced scatter search designs for global optimization of multimodal functions
- Fundamentals of scatter search and path relinking
- Future paths for integer programming and links to artificial intelligence
- Genetic and Nelder--Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions.
- Handbook of metaheuristics
- Heuristic pattern search and its hybridization with simulated annealing for nonlinear global optimization
- scientific article; zbMATH DE number 2002582 (Why is no real title available?)
- scientific article; zbMATH DE number 879773 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- Lipschitzian optimization without the Lipschitz constant
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- Minimization by Random Search Techniques
- Multivariate stochastic approximation using a simultaneous perturbation gradient approximation
- On the Convergence of the Multidirectional Search Algorithm
- Principles of scatter search
- Recent progress in unconstrained nonlinear optimization without derivatives
- Scatter search. Methodology and implementation in C. With CD-ROM.
- Tabu search directed by direct search methods for nonlinear global optimization
- Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
Cited in
(16)- Cyber swarm algorithms - improving particle swarm optimization using adaptive memory strategies
- Geodesic and contour optimization using conformal mapping
- Local search with groups of step sizes
- Tuning BARON using derivative-free optimization algorithms
- A batch, derivative-free algorithm for finding multiple local minima
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- Decoupling linear and nonlinear regimes: an evaluation of efficiency for nonlinear multidimensional optimization
- Asymptotic total variation tests for copulas
- In and out forests on combinatorial landscapes
- Rosenbrock artificial bee colony algorithm for accurate global optimization of numerical functions
- scientific article; zbMATH DE number 2002582 (Why is no real title available?)
- Finding approximate local minima faster than gradient descent
- Black-box optimization on hyper-rectangle using recursive modified pattern search and application to ROC-based classification problem
- Optimization by moving ridge functions: derivative-free optimization for computationally intensive functions
- A new partition method for DIRECT-type algorithm based on minimax design
- \(Q\)-fully quadratic modeling and its application in a random subspace derivative-free method
This page was built for publication: Finding local optima of high-dimensional functions using direct search methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2378372)
