Global optimization with a limited solution time

DOI10.1007/BF02404001zbMath0848.90111OpenAlexW2079450424MaRDI QIDQ1918987

Jaap Roosma, Eligius M. T. Hendrix

Publication date: 23 July 1996

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02404001

zbMATH Keywords

random methodslocal searchbox constrained global optimizationheuristic solution strategylimited solution time

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (1)

On the investigation of stochastic global optimization algorithms

Cites Work

• Unnamed Item
• Pure adaptive search in global optimization
• Bayesian stopping rules for multistart global optimization methods
• Generalized Simulated Annealing for Function Optimization
• Sequential stopping rules for the multistart algorithm in global optimisation
• An efficient method for finding the minimum of a function of several variables without calculating derivatives

This page was built for publication: Global optimization with a limited solution time