Answers are grounded in this paper and cite their sources.
A stochastic version of the standard nonlinear programming problem is considered. A function <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">f(x)</tex> is observed in the presence of noise, and we seek to minimize <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">f(x)</tex> for <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">x ∈ C = {x:qⁱ(x) ≤ 0}</tex> , where <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">qⁱ(x)</tex> are constraints. Numerous practical examples exist. Algorithms are discussed for selecting a sequence X <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</inf> which converges wp 1 to a point where a necessary condition for optimality holds. The algorithms use, of course, noise-corrupted observations on the <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">f(x)</tex> . Numerical results are presented. They indicate that the approach is quite versatile, and can be a useful tool for systematic Monte-Carlo optimization of constrained systems, a much-neglected area. However, many practical problems remain to be resolved, e.g., investigation of efficient one-dimensional search methods and of the tradeoffs between the effort spent per search cycle and the number of search cycles.
No takes yet. Share an insight, caveat, or question.
Kushner et al. (1974) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: