Heuristic pattern search and its hybridization with simulated annealing for nonlinear global optimization

DOI10.1080/10556780310001645189zbMath1059.90149OpenAlexW2095300418MaRDI QIDQ4657814

Abdel-Rahman Hedar, Masao Fukushima

Publication date: 14 March 2005

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

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

zbMATH Keywords

metaheuristicssimulated annealingpattern searchdescent directionunconstrained global optimization

Mathematics Subject Classification ID

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

Related Items (21)

Global sensing search for nonlinear global optimization ⋮ Finding local optima of high-dimensional functions using direct search methods ⋮ A directed tabu search method for solving controlled Volterra integral equations ⋮ Optimizing radial basis functions by d.c. programming and its use in direct search for global derivative-free optimization ⋮ A rigorous deterministic global optimization approach for the derivation of secondary information in digital maps ⋮ Hybrid chaos optimization algorithm with artificial emotion ⋮ Optimization methods for box-constrained nonlinear programming problems based on linear transformation and Lagrange interpolating polynomials ⋮ A hybrid genetic pattern search augmented Lagrangian method for constrained global optimization ⋮ A particle swarm pattern search method for bound constrained global optimization ⋮ Derivative-free filter simulated annealing method for constrained continuous global optimization ⋮ Investigating a hybrid simulated annealing and local search algorithm for constrained optimization ⋮ Parallel two-phase methods for global optimization on GPU ⋮ Hybrid scatter tabu search for unconstrained global optimization ⋮ An augmented Lagrangian fish swarm based method for global optimization ⋮ The combination stretching function technique with simulated annealing algorithm for global optimization ⋮ Comparative study of serial and parallel heuristics used to design combinational logic circuits ⋮ A novel global optimization technique for high dimensional functions ⋮ Hybridizing the electromagnetism-like algorithm with descent search for solving engineering design problems ⋮ Numerical study of augmented Lagrangian algorithms for constrained global optimization ⋮ Tabu search directed by direct search methods for nonlinear global optimization ⋮ On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization

Uses Software

• KELLEY

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• Tabu search applied to global optimization
• On the Convergence of Pattern Search Algorithms
• Enhanced simulated annealing for globally minimizing functions of many-continuous variables
• Hybrid simulated annealing and direct search method for nonlinear unconstrained global optimization
• Detection and Remediation of Stagnation in the Nelder--Mead Algorithm Using a Sufficient Decrease Condition

This page was built for publication: Heuristic pattern search and its hybridization with simulated annealing for nonlinear global optimization