we prove that the algorithm is either globally linearly convergent or globally and locally superlinearly convergent under mild conditions.
在较弱的条件下,证明了所给算法或者是全局线性收敛,或者是全局和局部超线性收敛。
under mild conditions, it is proved that the algorithm is well defined and globally linearly convergent to a optimization solution of primary problem.
所给算法拥有一些好的特性,在较弱的条件下,证明了算法有好的定义而且全局(线性)收敛到一个原问题的最优解。
it is given that a super linearly convergent feasible direction method for solving optimization problems with lincar constraints.
介绍了简化模糊推理方法 ,在此基础上提出了求解模糊专家系统中约束最优化问题的一般方法 。