| 求解P_*(τ)阵线性互补问题的高阶宽邻域内点算法 |
| |
| 引用本文： | 龚小玉,张明望.求解P_*(τ)阵线性互补问题的高阶宽邻域内点算法[J].河南师范大学学报(自然科学版),2006,34(4):178-180. |
| |
| 作者姓名： | 龚小玉 张明望 |
| |
| 作者单位： | 三峡大学,理学院,湖北,宜昌,443002 |
| |
| 摘 要： | 对P*(τ)线性互补问题提出了一种高阶宽邻域内点算法,在算法的每步迭代过程中,基于线性规划原始-对偶仿射尺度算法的思想来求解一个线性方程组,得到迭代方向,再适当选取步长,得到算法迭代的多项式复杂性.
|
| 关 键 词： | 线性互补问题 内点算法 多项式复杂性 P_*(τ)矩阵 |
| 文章编号： | 1000-2367(2006)04-0178-03 |
| 收稿时间： | 2006-03-05 |
| 修稿时间： | 2006年3月5日 |
A High-Order Wide Neighborhood Interior-Point Algorithm for Solving P*τ Matrix Linear Complementarity Problem |
| |
| GONG Xiao-yu,ZHANG Ming-wang.A High-Order Wide Neighborhood Interior-Point Algorithm for Solving P*τ Matrix Linear Complementarity Problem[J].Journal of Henan Normal University(Natural Science),2006,34(4):178-180. |
| |
| Authors: | GONG Xiao-yu ZHANG Ming-wang |
| |
| Institution: | 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. |
| |
| Keywords: | linear complementary problem interior point algorithm polynomial-time complexity P_*(τ)-matrix |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
