zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
On the convergence of generalized hill climbing algorithms. (English) Zbl 0994.90115
Authors’ summary: Generalized Gill Climbing (GHC) algorithms provide a general local search strategy to address intractable discrete optimization problems. GHC algorithms include as special cases stochastic local search algorithms such as simulated annealing and the noising method, among others. In this paper, a proof of convergence of GHC algorithms is presented, that relaxes the sufficient conditions for the most general convergence proof for stochastic local search algorithms in the literature. Note that classical convergence proofs for stochastic local search algorithms require either that an exponential distribution be used to model the acceptance of candidate solutions along a search trajectory, or that the Markov chain model of the algorithm must be reversible. The proof in this paper removes these limitations, by introducing a new path concept between global and local optima. Convergence is based on the asymptotic behavior of path probabilities between local and global optima. Examples are given to illustrate the convergence conditions. Implications of this result are also discussed.
Reviewer: S.Gal (Haifa)
90C27Combinatorial optimization