Computational Complexity for Various Types of Stochastic Algorithms for Global Optimization
碩士 === 國立成功大學 === 數學系應用數學碩博士班 === 96 === This thesis analyzes three stochastic algorithms for global optimization on continuous domain, including the Pure Random Search (PRS), the Pure Adaptive Search(PAS), and the Hesitant Adaptive Search(HAS). Let $overline{y}$ denote the given target value, and $...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/42669643818873702280 |