Finding local optima of high-dimensional functions using direct search methods

DOI10.1016/j.ejor.2008.01.039zbMath1156.90440OpenAlexW2026721457MaRDI QIDQ2378372

Fred Glover, Lars Magnus Hvattum

Publication date: 8 January 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2008.01.039

zbMATH Keywords

local minimumdirect searchscatter searchnon-linear optimizationderivative free

Mathematics Subject Classification ID

Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)

Related Items (6)

In and out forests on combinatorial landscapes ⋮ Derivative-free optimization: a review of algorithms and comparison of software implementations ⋮ Rosenbrock artificial bee colony algorithm for accurate global optimization of numerical functions ⋮ Tuning BARON using derivative-free optimization algorithms ⋮ Asymptotic total variation tests for copulas ⋮ Cyber swarm algorithms - improving particle swarm optimization using adaptive memory strategies

Uses Software

• DFO
• Scatter Search
• CEC 05

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A hybrid method combining continuous tabu search and Nelder--Mead simplex algorithms for the global optimization of multiminima functions
• Lipschitzian optimization without the Lipschitz constant
• Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
• Recent progress in unconstrained nonlinear optimization without derivatives
• Direct search methods: Then and now
• Genetic and Nelder--Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions.
• Future paths for integer programming and links to artificial intelligence
• Scatter search. Methodology and implementation in C. With CD-ROM.
• Principles of scatter search
• Continuous scatter search: an analysis of the integration of some combination methods and improvement strategies
• Tabu search directed by direct search methods for nonlinear global optimization
• Experimental testing of advanced scatter search designs for global optimization of multimodal functions
• Asynchronous Parallel Pattern Search for Nonlinear Optimization
• Effect of dimensionality on the Nelder–Mead simplex method
• `` Direct Search Solution of Numerical and Statistical Problems
• Minimization by Random Search Techniques
• Multivariate stochastic approximation using a simultaneous perturbation gradient approximation
• On the Convergence of the Multidirectional Search Algorithm
• Analysis of Generalized Pattern Searches
• Heuristic pattern search and its hybridization with simulated annealing for nonlinear global optimization
• Mesh Adaptive Direct Search Algorithms for Constrained Optimization
• An Improved Procedure for Orthogonalising the Search Vectors in Rosenbrock's and Swann's Direct Search Optimisation Methods
• A Simplex Method for Function Minimization
• Handbook of metaheuristics

This page was built for publication: Finding local optima of high-dimensional functions using direct search methods