A polynomial-time algorithm for linear optimization based on a new class of parametric kernel function

摘要：

In this paper, we present a class of polynomial primal-dual interior-point algorithms for linear optimization based on a new class of parametric kernel functions. This class is fairly general and includes several classes of kernel functions, such as given in |1, 4). The goal of this paper is to investigate such a class of kernel functions and to show that the interior-point methods based on these functions have favorable complexity results.

关键词： kernel function primal dual interior point methods complexity analysis linear optimization.

作者: Lipu Zhang Yinghong Xu

作者单位: Department of Mathematics,Zhejiang Forestry University,Zhejiang 311300,China Department of Mathematics,Zhejiang Sci-Tech University Zhejiang 310018,China

会议类型: 国际会议

会议名称: The 2nd IEEE International Conference on Advanced Computer Control(第二届先进计算机控制国际会议 ICACC 2010)

会议地点: 沈阳

会议语种:英文

页码: 503-507

在线出版日期: 2010-03-27（万方平台首次上网日期，不代表论文的发表时间）