Furthermore, the convergency of the iterative algorithm and the optimality of its limit sate are proved based on Kuhn-Tucker condition. Its high convergency speed and the efficiency of the proposed methods are illustrated by a practital application.

• 证明了迭代算法的收敛性和极限状态的最优性，并以实例应用说明了有关方法的有效性和高收敛速度。