解一般约束优化问题的牛顿法的超线性收敛性

Superlinear Convergence of Newton Algorithm for General Constrained Optimization Problem

文献[2]提出了基于F-B函数的解一般约束优化规划问题的牛顿算法,但仅给出了该算法的全局收敛性。在该算法的基础上,进一步证明了该算法的超线性收敛性。

Then Literature [ 2 ] proposed the Newton problem, but this paper has only proved the global foundation,we prove the superlinear convergence of algorithm with F-B function for general constraint optimization conve-rgence of the algorithm. With the help of this method＇s the algorithm to go a step further.