On extending some wide-neighborhood interior point algorithms from linear programming to linear complementarity problems

摘要：

This paper establishes the polynomial convergence of a new class of path-following methods for linea-r complemetarity problems (LCP) whose search directions are obtaines by-applying Newtons method to the central path equation Xz = μe,Mx-c=z.Specifically,we show that the short-step path-following metho-ds based on the L∞ norm neighborhood and the semilong-step path-following methods based on the L∞ seminorm neighbor-hood have the iterationcomplexity bounds of O(n),respectively.

关键词： interior-point algorithm polynomial complexity path-following methods linear complementarity problems.

作者: Feixiang Chen Yuming Feng Zhanfei Zuo

作者单位: College of Mathematics and Computer Science,Chongqing Three Gorges University,Wanzhou,Chongqing,404000,P.R.China

会议类型: 国际会议

会议名称: 2011 3rd International Conference on Computer and Network Technology(ICCNT 2011)(2011第三届IEEE计算机与网络技术国际会议)

会议地点: 太原

会议语种:英文

页码: 65-69

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