A hybrid simplex search and particle swarm optimization for unconstrained optimization
type: Item
instance of: scholarly article
title: A hybrid simplex search and particle swarm optimization for unconstrained optimization
zbMATH Open document ID: 1121.90116
author: Shu-Kai S. Fan
author: Erwie Zahara
published in: European Journal of Operational Research
publication date: 2007-04-19T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5144954
zbMATH Keywords: simplex search method
zbMATH Keywords: particle swarm optimization
zbMATH Keywords: unconstrained optimization
zbMATH Keywords: metaheuristics
describes a project that uses: minpack
MaRDI profile type: Publication
full work available at URL: j.ejor.2006.06.034
OpenAlex ID: W1978740922
cites work: A Simplex Method for Function Minimization
cites work: The Nelder-Mead Simplex Procedure for Function Minimization
cites work: `` Direct Search'' Solution of Numerical and Statistical Problems
cites work: Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation
cites work: Q4226179
cites work: Nelder-Mead Simplex Modifications for Simulation Optimization
cites work: Gilding the lily: A variant of the Nelder-Mead algorithm based on Golden-section search
cites work: Testing Unconstrained Optimization Software
DOI: 10.1016/J.EJOR.2006.06.034
description: scientific article; zbMATH DE number 5144954