A heuristic approach for finding the global minimum: Adaptive random search technique

DOI10.1016/J.AMC.2005.05.002zbMath1088.65058OpenAlexW2040061045MaRDI QIDQ2489483

Coşkun Hamzaçebi, Fevzi Kutay

Publication date: 28 April 2006

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

Full work available at URL: https://doi.org/10.1016/j.amc.2005.05.002

zbMATH Keywords

AlgorithmNumerical examplesArtificial neural networkXOR problemGlobal minimumARSETRandom optimizationRandom search technique

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (9)

State transition algorithm ⋮ A multi-strategy improved slime mould algorithm for global optimization and engineering design problems ⋮ A new hybrid method for solving global optimization problem ⋮ Continuous functions minimization by dynamic random search technique ⋮ Improving genetic algorithms' performance by local search for continuous function optimization ⋮ A heuristic approach to find the global optimum of function ⋮ A novel hybrid algorithm based on particle swarm and ant colony optimization for finding the global minimum ⋮ Evolutionary programming based on non-uniform mutation ⋮ A new solution algorithm for improving performance of ant colony optimization

Cites Work

• Unnamed Item
• Unnamed Item
• A modified convergence theorem for a random optimization method
• Random optimization
• Minimization by Random Search Techniques

This page was built for publication: A heuristic approach for finding the global minimum: Adaptive random search technique