Computational algorithms based on random search for solving global optimization problems

DOI10.1080/00207169008803842zbMath0752.65053OpenAlexW1971788035MaRDI QIDQ4009752

Kusum Shanker, Cruz Mohan

Publication date: 27 September 1992

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

global optimizationComputational algorithmsrandom search techniques

Mathematics Subject Classification ID

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

Related Items (2)

Modified random-to-pattern search algorithm (mrps) for global ptimization ⋮ Asymptotic matching and genetic optimization applied to optimal aerospace design

Cites Work

• Unnamed Item
• Global optimization by controlled random search
• The Tunneling Algorithm for the Global Minimization of Functions
• A Heuristic Search Procedure for Estimating a Global Solution of Nonconvex Programming Problems

This page was built for publication: Computational algorithms based on random search for solving global optimization problems