Abstract
Hesitant adaptive search (HAS) extends the ideas of PAS by accommodating hesitation, or pausing, at objective function values for both continuous and discrete problems. At each iteration the HAS algorithm can either generate a point in the improving region with a certain “bettering” probability, or it “hesitates” and stays at the current point. PAS is a special case of HAS, occurring when the bettering probability is equal to one. The HAS algorithm goes a step further than PAS in modeling stochastic algorithms, because it allows hesitation at each iterate which may represent rejecting a sampled point. The bettering probability depends on the objective function value, so it can capture the realistic effect of it being harder to find an improving point as the objective function value gets smaller.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media New York
About this chapter
Cite this chapter
Zabinsky, Z.B. (2003). Hesitant Adaptive Search. In: Stochastic Adaptive Search for Global Optimization. Nonconvex Optimization and Its Applications, vol 72. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-9182-9_3
Download citation
DOI: https://doi.org/10.1007/978-1-4419-9182-9_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-4826-9
Online ISBN: 978-1-4419-9182-9
eBook Packages: Springer Book Archive