摘要
本文改进了文献[1]中的算法并讨论其收敛性,指出了原问题最优解即为搜索函数不动点的条件,提供了在不同条件下可采用的较好的求解方法,得到了实际计算与理论分析相一致的结果。
In this paper, the algorithm in Reference [1] is improved and its convergence is discussed. It shows that the optimal solution of the problem is the fixed point of the algorithm's search-function, and it supplies better methods for solving the problem on the difference conditions. The results of the digital simulation for the algorithm is the same as that of the theoretical analysis.
出处
《东南大学学报（自然科学版）》
EI
CAS
CSCD
1992年第5期28-34,共7页
Journal of Southeast University：Natural Science Edition
关键词
不动点
递阶
优化/搜索函数
fixed-points
hierarchy
optimization/search-function
