A simulated annealing driven multi-start algorithm for bound constrained global optimization

DOI10.1016/j.cam.2009.11.013zbMath1183.65063OpenAlexW2141634773WikidataQ57932000 ScholiaQ57932000MaRDI QIDQ847248

M. N. Gabere, M. Montaz Ali

Publication date: 12 February 2010

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2009.11.013

zbMATH Keywords

direct search methodsglobal optimizationconvergencenumerical resultssimulated annealingnumerical comparisonspattern searchmulti-start algorithmderivative-freemulti-level single linkagepositive spanning direction

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56) Combinatorial optimization (90C27)

Related Items (4)

Controlling variability in split-merge systems and its impact on performance ⋮ Global optimization using a genetic algorithm with hierarchically structured population ⋮ Sequential virtual motion camouflage method for nonlinear constrained optimal trajectory control ⋮ The combination stretching function technique with simulated annealing algorithm for global optimization

Cites Work

• Unnamed Item
• Global optimization and stochastic differential equations
• A Monte Carlo simulated annealing approach to optimization over continuous variables
• A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
• Speeding up continuous GRASP
• Global optimization by controlled random search
• Global optimization and simulated annealing
• Aspiration based simulated annealing algorithm
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• A numerical comparison of some modified controlled random search algorithms
• Application of stochastic global optimization algorithms to practical problems
• Population set-based global optimization algorithms: some modifications and numerical studies
• A differential free point generation scheme in the differential evolution algorithm
• Improved particle swarm algorithms for global optimization
• Convergence results for generalized pattern search algorithms are tight
• Stochastic global optimization methods part I: Clustering methods
• Stochastic global optimization methods part II: Multi level methods
• Convergence of a simulated annealing algorithm for continuous global optimization.

This page was built for publication: A simulated annealing driven multi-start algorithm for bound constrained global optimization