Controlled Random Search Methods as a Stochastic Decision Process
Kurt Marti ()
Additional contact information
Kurt Marti: Federal Armed Forces University Munich
Chapter Chapter 5 in Stochastic Optimization Methods, 2024, pp 119-129 from Springer
Abstract:
Abstract As already discussed in the preceding chapter, in order to develop procedures for increasing the rate of convergence of the basic search method, the stochastic search procedure is equipped with a mechanism for controlling the conditional probability distributions of the search variates at the iteration points, generating the new trial points for improving the current iteration point. In an attendant control or stochastic decision process, the parameters of the search variables can be selected to maximize criteria for measuring the progress of the search, such as the probability of a step into the area of success, or the mean step length into the area of success at a certain iteration point. Due to the black-box situation concerning the objective function F, we have a stochastic control or decision process under uncertainty concerning the objective function. Based on a Bayesian approach, with the obtained information from the search algorithm, the conditional distribution of F, given the information obtained during the search, can be determined.
Date: 2024
References: Add references at CitEc
Citations:
There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-031-40059-9_5
Ordering information: This item can be ordered from
http://www.springer.com/9783031400599
DOI: 10.1007/978-3-031-40059-9_5
Access Statistics for this chapter
More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().