Computational algorithms based on random search for solving global optimization problems

DOI10.1080/00207169008803842MaRDI QIDQ4009752zbMATH OpenOpenAlexFDO

Authors Kusum Shanker, C. 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

Computational algorithmsglobal optimizationrandom search techniques

Mathematics Subject Classification ID

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

Recommendations

• A random search approach to finding the global minimum
• scientific article; zbMATH DE number 3920191
• scientific article; zbMATH DE number 2099379
• scientific article; zbMATH DE number 624796
• Modified controlled random search algorithms

Cites work

• A Heuristic Search Procedure for Estimating a Global Solution of Nonconvex Programming Problems
• Global optimization by controlled random search
• scientific article; zbMATH DE number 3382096 (Why is no real title available?)
• The Tunneling Algorithm for the Global Minimization of Functions

Cited in

(19)

• Empirical study of the improved UNIRANDI local search method
• Performance of global random search algorithms for large dimensions
• Random search optimization approach for highly multi-modal nonlinear problems
• A heuristic approach for finding the global minimum: Adaptive random search technique
• Randomized algorithms in interval global optimization
• A random search approach to finding the global minimum
• scientific article; zbMATH DE number 3920191 (Why is no real title available?)
• scientific article; zbMATH DE number 3941278 (Why is no real title available?)
• scientific article; zbMATH DE number 4100970 (Why is no real title available?)
• scientific article; zbMATH DE number 4104377 (Why is no real title available?)
• Modified random-to-pattern search algorithm (mrps) for global ptimization
• Searching the components of the solution: The factor-based random search algorithm for ETSP
• scientific article; zbMATH DE number 624796 (Why is no real title available?)
• Asymptotic matching and genetic optimization applied to optimal aerospace design
• scientific article; zbMATH DE number 1070395 (Why is no real title available?)
• Improvement of pure random search in global optimization
• scientific article; zbMATH DE number 2099379 (Why is no real title available?)
• scientific article; zbMATH DE number 5061888 (Why is no real title available?)
• A linear constrained optimization Benchmark for probabilistic search algorithms: the rotated Klee-Minty problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4009752)