n-dimensional Cauchy neighbor generation for the fast simulate dannealing

Dongkyung Nam, Jong Seok Lee, Cheol Hoon Park

Research output: Contribution to journalArticle

15 Citations (Scopus)

Abstract

Many simulated annealing algorithms use the Cauchy neighbors for fast convergence, and the conventional method uses the product of n one-dimensional Cauchy distributions as an approximation. However, this method slows down the search severely as the dimension gets high because of the dimension-wise neighbor generation. In this paper, we analyze the orthogonal neighbor characteristics of the conventional method and propose a method of generating symmetric neighbors from the n-dimensional Cauchy distribution. The simulation results show that the proposed method is very effective for the search in the simulated annealing and can be applied to many other stochastic optimization algorithms.

Original languageEnglish
Pages (from-to)2499-2502
Number of pages4
JournalIEICE Transactions on Information and Systems
VolumeE87-D
Issue number11
Publication statusPublished - 2004 Nov

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'n-dimensional Cauchy neighbor generation for the fast simulate dannealing'. Together they form a unique fingerprint.

  • Cite this