A hybrid shuffled complex evolution approach with pattern search for unconstrained optimization

DOI10.1016/j.matcom.2011.02.009zbMath1219.65056OpenAlexW1965847060MaRDI QIDQ551488

Leandro dos Santos Coelho, Viviana Cocco Mariani

Publication date: 20 July 2011

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.matcom.2011.02.009

zbMATH Keywords

unconstrained optimizationgenetic algorithmpattern searchshuffled complex evolution algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05)

Related Items (2)

A search grid for parameter optimization as a byproduct of model sensitivity analysis ⋮ Hybrid real-code ant colony optimisation for constrained mechanical design

Uses Software

• Genocop
• KELLEY
• fminsearch

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A hybrid simplex search and particle swarm optimization for unconstrained optimization
• A new genetic algorithm for solving nonconvex nonlinear programming problems
• Ant colony pattern search algorithms for unconstrained and bound constrained optimization
• Global optimization algorithms for a CAD workstation
• Shuffled complex evolution approach for effective and efficient global minimization
• Bare bones differential evolution
• A novel ecological particle swarm optimization algorithm and its population dynamics analysis
• 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 parameter free continuous ant colony optimization algorithm for the optimal design of storm sewer networks: constrained and unconstrained approach
• On the Convergence of Pattern Search Algorithms
• `` Direct Search Solution of Numerical and Statistical Problems
• Direct Search Methods on Parallel Machines
• On the Convergence of the Multidirectional Search Algorithm
• Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
• Hybrid simulated annealing and direct search method for nonlinear unconstrained global optimization
• Analysis of Generalized Pattern Searches
• Pattern Search Methods for Linearly Constrained Minimization
• A Pattern Search Filter Method for Nonlinear Programming without Derivatives
• Pattern Search Algorithms for Bound Constrained Minimization
• Detection and Remediation of Stagnation in the Nelder--Mead Algorithm Using a Sufficient Decrease Condition
• A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds
• A New Method of Constrained Optimization and a Comparison With Other Methods
• A Simplex Method for Function Minimization

This page was built for publication: A hybrid shuffled complex evolution approach with pattern search for unconstrained optimization