摘要
对七种无约束优化算法进行了大量有效的数值试验,提出了各种算法在初始条件相同的情况下,产生的迭代点列可以有不同的极限点,并对此现象进行合理的解释。
Numerical experiments have been conducted to seven kinds of unconstrained optimization algorithms. The results show that under the same initial conditions, different algorithms produce different limited points in sequence. And the paper gives the explanation to this phenomenon.
出处
《广西工学院学报》
CAS
2005年第2期94-96,共3页
Journal of Guangxi University of Technology
关键词
无约束优化
极限点
算法
Unconstrained optimization
Algorithm Limited point
algorithm