A restarted and modified simplex search for unconstrained optimization
type: Item
instance of: scholarly article
title: A restarted and modified simplex search for unconstrained optimization
zbMATH Open document ID: 1177.90203
author: Nenad Mladenović
author: Pierre Hansen
author: Qiu-Hong Zhao
author: Dragan Urošević
published in: Computers \& Operations Research
publication date: 2009-08-14T00:00:00Z
Mathematics Subject Classification ID: 90B40
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5595298
zbMATH Keywords: unconstrained optimization
zbMATH Keywords: global optimization
zbMATH Keywords: direct search methods
zbMATH Keywords: Nelder-Mead method
zbMATH Keywords: restarted modified simplex search
zbMATH Keywords: metaheuristics
describes a project that uses: GLOB
describes a project that uses: fminsearch
MaRDI profile type: Publication
full work available at URL: j.cor.2009.03.005
OpenAlex ID: W1979541769
cites work: Q4065051
cites work: Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search
cites work: Mesh Adaptive Direct Search Algorithms for Constrained Optimization
cites work: The continuous reactive tabu search: Blending combinatorial optimization and stochastic search for global optimization
cites work: Grid restrained Nelder-Mead algorithm
cites work: A continuous genetic algorithm designed for the global optimization of multimodal functions
cites work: A hybrid method combining continuous tabu search and Nelder--Mead simplex algorithms for the global optimization of multiminima functions
cites work: Tabu search applied to global optimization
cites work: Genetic and Nelder--Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions.
cites work: Taboo Search: An Approach to the Multiple Minima Problem
cites work: Q5755530
cites work: Tabu search directed by direct search methods for nonlinear global optimization
cites work: Continuous scatter search: an analysis of the integration of some combination methods and improvement strategies
cites work: `` Direct Search'' Solution of Numerical and Statistical Problems
cites work: A revised simplex search procedure for stochastic simulation response surface optimization
cites work: Arbitrary-norm hyperplane separation by variable neighbourhood search
cites work: Detection and Remediation of Stagnation in the Nelder--Mead Algorithm Using a Sufficient Decrease Condition
cites work: Q4435425
cites work: Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
cites work: Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
cites work: Variable neighborhood search
cites work: General variable neighborhood search for the continuous optimization
cites work: Gilding the lily: A variant of the Nelder-Mead algorithm based on Golden-section search
cites work: A Simplex Method for Function Minimization
cites work: Use of VNS and TS in classification: variable selection and determination of the linear discrimination function coefficients
cites work: Q5684176
cites work: A convergent variant of the Nelder--Mead algorithm
cites work: Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation
cites work: On the Convergence of Pattern Search Algorithms
cites work: Fortified-Descent Simplicial Search Method: A General Approach
cites work: A niche hybrid genetic algorithm for global optimization of continuous multimodal functions
cites work: Q4878831
DOI: 10.1016/J.COR.2009.03.005
description: scientific article; zbMATH DE number 5595298