Article ID: | iaor19971120 |
Country: | Netherlands |
Volume: | 69 |
Issue: | 3 |
Start Page Number: | 443 |
End Page Number: | 448 |
Publication Date: | Sep 1995 |
Journal: | Mathematical Programming (Series A) |
Authors: | Wood G.R., Steel M.A., Zabinsky Z.B., Baritompa W.P. |
Keywords: | programming: integer, computational analysis |
Pure Adaptive Search is a stochastic algorithm which has been analyzed for continuous global optimization. When a uniform distribution is used in PAS, it has been shown to have complexity which is linear in dimension. The authors define strong and weak variations of PAS in the setting of finite global optimization and prove analogous results. In particular, for the