Partitioned random search for global optimization with sampling cost and discounting factor

DOI10.1023/A:1017539732327zbMath1007.90043OpenAlexW193178091MaRDI QIDQ1608149

R. Smith

Publication date: 12 August 2002

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1017539732327

zbMATH Keywords

global optimizationdynamic programmingpartitioned random searchsequential samples

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Stochastic programming (90C15)

Cites Work

• Optimal sequential sampling policy of partitioned random search and its approximation
• Adaptive partitioned random search to global optimization
• Optimality of index policies for a sequential sampling problem

This page was built for publication: Partitioned random search for global optimization with sampling cost and discounting factor