摘要
基于光滑Fischer-Burmeister函数,给出求解线性对称锥规划的一步光滑牛顿法.该算法在每一步迭代只需求解一个线性方程组,并进行一次线性搜索.不必满足严格互补,算法具有全局收敛性.
Based on the Fischer-Burmeister smoothing function, a one-step smoothing Newton method is presented for solving the symmetric conic linear programming in this paper. This algorithm requires only solving one linear system of equations and performing one line search at each iteration. Without strict complementarity, the algorithm is shown to be globally convergent.
出处
《黄冈师范学院学报》
2009年第3期1-3,7,共4页
Journal of Huanggang Normal University
基金
黄冈师范学院博士基金项目(08cd158)
湖北省教育厅优秀中青年人才项目(Q20092701)