摘要
基于一个新的函数,为线性规划设计了一个可行内点算法。该算法的迭代步长为满步长,迭代方向由该新函数决定,算法最终得到了线性规划目前最好的迭代复杂性.
A new feasible interior-point algorithm based on a new function is proposed for linear program-ming. The step is full-newton step, and the search direction is determined by this funtion. The best-known iter-ation complexity is obtained for linear programming.
作者
陈华平
毕迎鑫
Chen Huaping;Bi Yinxin(School of Mathematics and Information Engineering, Liupanshui Normal University, Liupanshui 553001, China)
出处
《六盘水师范学院学报》
2018年第3期73-77,共5页
Journal of Liupanshui Normal University
基金
2013年度贵州省科学技术基金项目"对称锥规划内点算法研究"(黔科合J字LKLS[2013]14)
关键词
线性规划
满牛顿步
可行算法
迭代复杂性
linear programming
full-newton step
feasible algorithm
the iteration complexity
