Hybrid simulated annealing and direct search method for nonlinear unconstrained global optimization

DOI10.1080/1055678021000030084zbMath1065.90081OpenAlexW2058709169MaRDI QIDQ4405945

Masao Fukushima, Abdel-Rahman Hedar

Publication date: 2002

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/1055678021000030084

zbMATH Keywords

Nonlinear Unconstrained Global Optimization, Direct Search Methods, Meta-heuristics, Simulated Annealing

Mathematics Subject Classification ID

Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Improving particle swarm optimization performance with local search for high-dimensional function optimization, Test problem generator for unconstrained global optimization, Study of multiscale global optimization based on parameter space partition, Hybrid chaos optimization algorithm with artificial emotion, Parameter identification in financial market models with a feasible point SQP algorithm, A hybrid method combining genetic algorithm and Hooke-Jeeves method for constrained global optimization, Derivative-free filter simulated annealing method for constrained continuous global optimization, Global optimization by continuous grasp, Investigating a hybrid simulated annealing and local search algorithm for constrained optimization, CGRS -- an advanced hybrid method for global optimization of continuous functions closely coupling extended random search and conjugate gradient method, Parallel two-phase methods for global optimization on GPU, Heuristic pattern search and its hybridization with simulated annealing for nonlinear global optimization, Gaussian variable neighborhood search for continuous optimization, A hybrid shuffled complex evolution approach with pattern search for unconstrained optimization, Speeding up continuous GRASP, Comparative study of serial and parallel heuristics used to design combinational logic circuits, A multidimensional descent method for global optimization, A modified quasisecant method for global optimization, Comparative analysis of the cutting angle and simulated annealing methods in global optimization, Nonlinear inertia weight variation for dynamic adaptation in particle swarm optimization, Efficient hybrid methods for global continuous optimization based on simulated annealing, Tabu search directed by direct search methods for nonlinear global optimization, Parallel MCMC methods for global optimization, An improved central force optimization algorithm for multimodal optimization, Local optimization method with global multidimensional search, GLODS: global and local optimization using direct search, Control of dead-time systems using derivative free local search guided population based incremental learning algorithms

Uses Software

• KELLEY

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• A hybrid method combining continuous tabu search and Nelder--Mead simplex algorithms for the global optimization of multiminima functions
• A tabu search Hooke and Jeeves algorithm for unconstrained optimization
• Handbook of global optimization
• Tabu search applied to global optimization
• Handbook of global optimization. Vol. 2
• Continuous optimization by a variant of simulated annealing
• Direct Search Methods on Parallel Machines
• Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
• Enhanced simulated annealing for globally minimizing functions of many-continuous variables
• Detection and Remediation of Stagnation in the Nelder--Mead Algorithm Using a Sufficient Decrease Condition
• Fortified-Descent Simplicial Search Method: A General Approach
• A Simplex Method for Function Minimization