摘要
A new algorithm built on a hybrid method (GRSA) for large scale global optimization problems is proposed. Unlike the previous proposed method that the original objective functions keep unchanged during the whole course of optimizing, a convexized auxiliary function on the obtained local minimizer so far is employed to improve the SA search ability. The experiments conducted show that the new method provides excellent results especially for large scale problems, compared to other state-of-the-art algorithm.
| 源语言 | 英语 |
|---|---|
| 页(从-至) | 87-98 |
| 页数 | 12 |
| 期刊 | Dynamics of Continuous, Discrete and Impulsive Systems Series B: Applications and Algorithms |
| 卷 | 15 |
| 期 | 1 |
| 出版状态 | 已出版 - 2月 2008 |
学术指纹
探究 'A hybrid fast descent method for globally optimizing high dimensional functions' 的科研主题。它们共同构成独一无二的学术指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver