基于核函数的原始-对偶可行及不可行内点算法-应用数学专业论文.docxVIP

三峡大学硕士学位论文 三 峡 大 学 硕 士 学 位 论 文 PAGE IV PAGE IV Abstract Interior-point method is one of the effective algorithms for solving optimization problems． It not only has polynomial complexity，but also has excellent practical performance，which can be compared with simplex method．The first practical polynomial interior-point method was proposed by Karmarkar in 1984．Since then the researches on interior-point methods have achieved fruitful results：the theoretical system has been established and a series of efficient numerical software have been developed．Recently， interior-point method has been appli