摘要
对一类非单调(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.
出处
《河南师范大学学报（自然科学版）》
CAS
CSCD
北大核心
2007年第1期45-47,共3页
Journal of Henan Normal University(Natural Science Edition)
基金
湖北省教育厅重点科研项目(D200613009)
关键词
非单调线性互补问题
P-矩阵
宽邻域路径跟踪法
计算复杂性
nonmonotonic linear complementary problem
P-matrix
wide-neighborhood path-following method
computational complexity
