Function optimization based on incremental resolution

Bin Xin*, Jie Chen, Zhi Hong Peng

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

Aiming at solving the problems of function optimization with interval constraints, a class of optimization techniques based on incremental resolution is proposed by combining with Monte Carlo uniform random sampling and chaos search respectively. The reasons of that these optimization techniques are more efficient than the corresponding common optimizers with invariant resolution are analyzed. Dealing with function optimization problems, they can achieve the compression of searching space and the location of optimal region rapidly. Simulation results validate their effectiveness.

Original languageEnglish
Pages (from-to)131-134
Number of pages4
JournalBeijing Ligong Daxue Xuebao/Transaction of Beijing Institute of Technology
Volume27
Issue numberSUPPL. 1
Publication statusPublished - May 2007

Keywords

  • Function optimization
  • Incremental resolution
  • Random number generator

Fingerprint

Dive into the research topics of 'Function optimization based on incremental resolution'. Together they form a unique fingerprint.

Cite this

Xin, B., Chen, J., & Peng, Z. H. (2007). Function optimization based on incremental resolution. Beijing Ligong Daxue Xuebao/Transaction of Beijing Institute of Technology, 27(SUPPL. 1), 131-134.