P-矩阵非单调线性互补问题的宽邻域路径跟踪算法及其计算复杂性  

A Wide-neighborhood Path-following Algorithms for a Class of Nonmonotonic Linear Complementary Problems and Its Computational Complexity

作　　者：张莉[1] 王浚岭[1] 

机构地区：[1]三峡大学理学院数学系,湖北宜昌443002

出　　处：《河南师范大学学报（自然科学版）》2007年第1期45-47,共3页Journal of Henan Normal University(Natural Science Edition)

基　　金：湖北省教育厅重点科研项目(D200613009)

摘　　要：对一类非单调(P-矩阵)线性互补问题,提出了一种新的宽邻域(N-∞(β))路径跟踪算法,并讨论了该算法的收敛性及计算复杂性.分析结果表明,所给方法是一多项式时间算法.In this paper, a new wide-neighborhood path-following algorithm for a class of nonmonotonie （P-matrix） linear complementary problems is presented, and its convergence and computational complexity is discussed. The results indicate that the algorithm is a polynomial-time one.

关 键 词：非单调线性互补问题 P-矩阵 宽邻域路径跟踪法 计算复杂性 

分 类 号：O221.2[理学—运筹学与控制论]