Simulated annealing for constrained global optimization

  • Romeijn H
  • Smith R
  • 40


    Mendeley users who have this article in their library.
  • 129


    Citations of this article.


Hide-and-Seek is a powerful yet simple and easily implemented continuous simulated annealing algorithm for finding the maximum of a continuous function over an arbitrary closed, bounded and full-dimensional body. The function may be nondifferentiable and the feasible region may be nonconvex or even disconnected. The algorithm begins with any feasible interior point. In each iteration it generates a candidate successor point by generating a uniformly distributed point along a direction chosen at random from the current iteration point. In contrast to the discrete case, a single step of this algorithm may generate any point in the feasible region as a candidate point. The candidate point is then accepted as the next iteration point according to the Metropolis criterion parametrized by an adaptive cooling schedule. Again in contrast to discrete simulated annealing, the sequence of iteration points converges in probability to a global optimum regardless of how rapidly the temperatures converge to zero. Empirical comparisons with other algorithms suggest competitive performance by Hide-and-Seek.

Author-supplied keywords

  • Continuous simulated annealing
  • Monte Carlo optimization
  • adaptive cooling
  • global optimization
  • random search

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • H. Edwin Romeijn

  • Robert L. Smith

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free