A restarted and modified simplex search for unconstrained optimization
From MaRDI portal
Publication:833553
DOI10.1016/j.cor.2009.03.005zbMath1177.90203OpenAlexW1979541769MaRDI QIDQ833553
Nenad Mladenović, Pierre Hansen, Dragan Urošević, Qiu Hong Zhao
Publication date: 14 August 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.03.005
direct search methodsglobal optimizationunconstrained optimizationmetaheuristicsNelder-Mead methodrestarted modified simplex search
Nonconvex programming, global optimization (90C26) Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Global optimization using a genetic algorithm with hierarchically structured population, Variable neighborhood search: basics and variants, Gaussian variable neighborhood search for continuous optimization, Less is more: Simplified Nelder-Mead method for large unconstrained optimization
Uses Software
Cites Work
- A convergent variant of the Nelder--Mead algorithm
- A hybrid method combining continuous tabu search and Nelder--Mead simplex algorithms for the global optimization of multiminima functions
- Grid restrained Nelder-Mead algorithm
- General variable neighborhood search for the continuous optimization
- Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search
- Variable neighborhood search
- Tabu search applied to global optimization
- Gilding the lily: A variant of the Nelder-Mead algorithm based on Golden-section search
- A niche hybrid genetic algorithm for global optimization of continuous multimodal functions
- Genetic and Nelder--Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions.
- The continuous reactive tabu search: Blending combinatorial optimization and stochastic search for global optimization
- 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
- A Revised Simplex Search Procedure for Stochastic Simulation Response Surface Optimization
- Taboo Search: An Approach to the Multiple Minima Problem
- On the Convergence of Pattern Search Algorithms
- `` Direct Search Solution of Numerical and Statistical Problems
- Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
- Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
- Detection and Remediation of Stagnation in the Nelder--Mead Algorithm Using a Sufficient Decrease Condition
- Fortified-Descent Simplicial Search Method: A General Approach
- Arbitrary-norm hyperplane separation by variable neighbourhood search
- Use of VNS and TS in classification: variable selection and determination of the linear discrimination function coefficients
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- A Simplex Method for Function Minimization
- Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation
- A continuous genetic algorithm designed for the global optimization of multimodal functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
