学术
国际标准刊号：ISSN 1000-2367
国内统一刊号：CN 41-1109
摘 要:
对P＊（τ）线性互补问题提出了一种高阶宽邻域内点算法，在算法的每步迭代过程中，基于线性规划原始一对偶仿射尺度算法的思想来求解一个线性方程组，得到迭代方向，再适当选取步长，得到算法迭代的多项式复杂性．[著者文摘]
文章出处:
《河南师范大学学报：自然科学版》-2006年34卷4期 -178-180页
Journal of Henan Normal University(Natural Science)
栏目信息:
分 类 号:
文献标识码:
A
文章编号:
1000-2367（2006）04-0178-03
[参考文献]
A High-Order Wide Neighborhood Interior-Point Algorithm for Solving P ＊（τ） Matrix Linear Complementarity Problem
GONG Xiao-yu , ZHANG Ming-wang （College of Science, Three Gorges University, Yichang 443002,China ）
Abstract:
This paper provides a wide neighborhood interior-point algorithm-high-order for solving P＊ （τ） matrix linear complementary problems. On the basis of the idea of primal-dual affine scaling method for linear programming, the search direction of our algorithm is obtained by a linear system of equation at each iteration. And we choose an appropriate step size, such that the algorithm has polynomial time complexity.[著者文摘]
Key words:
linear complementary problem;interior point algorithm; polynomial-time complexity;P, （r）-matrix
收稿日期: 2006-03-05
基金资助:
湖北省教育厅重点科研项目（D200613009）
更多评论>>文章评论
更多>>免费文章
cqvip.com