## Abstract

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. We define strong and weak variations of PAS in the setting of finite global optimization and prove analogous results. In particular, for the n-dimensional lattice {1,⋯, k}^{n}, the expected number of iterations to find the global optimum is linear in n. Many discrete combinatorial optimization problems, although having intractably large domains, have quite small ranges. The strong version of PAS for all problems, and the weak version of PAS for a limited class of problems, has complexity the order of the size of the range.

Original language | English |
---|---|

Pages (from-to) | 443-448 |

Number of pages | 6 |

Journal | Mathematical Programming |

Volume | 69 |

Issue number | 1-3 |

DOIs | |

Publication status | Published - Jul 1995 |