Optimal sequential sampling policy of partitioned random search and its approximation
type: Item
instance of: scholarly article
title: Optimal sequential sampling policy of partitioned random search and its approximation
zbMATH Open document ID: 0908.90245
DOI: 10.1023/A:1022645702900
author: K. Appert
published in: Journal of Optimization Theory and Applications
publication date: 1999-02-28T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 1206582
zbMATH Keywords: global optimization
zbMATH Keywords: partitioned random search
zbMATH Keywords: sequential sampling
zbMATH Keywords: dynamic programming
MaRDI profile type: Publication
cites work: Adaptive partitioned random search to global optimization
cites work: A counterexample to "adaptive partitioned random search to global optimization"
cites work: Convex Analysis
cites work: Q5332903
cites work: Optimal Search for the Best Alternative
full work available at URL: a:1022645702900
OpenAlex ID: W20964413
description: scientific article; zbMATH DE number 1206582