| 宽域不可行内点算法的复杂性 |
| |
| 引用本文： | 魏跃春. 宽域不可行内点算法的复杂性[J]. 襄樊学院学报, 2000, 21(2): 9-14 |
| |
| 作者姓名： | 魏跃春 |
| |
| 作者单位： | 襄樊学院,数学系,湖北,襄樊,441053 |
| |
| 摘 要： | 本文讨论求解Ｐ＊（ｋ）阵线性互补问题的宽域不可行内点算法。通过引进辅助系列，给出了算法的迭代方向的上界估计，进而通过使用高阶校正技术，给出了算法的复杂性。
|
| 关 键 词： | 多项式 宽域 不可行内点算法 P^（k）阵 复杂性 |
| 文章编号： | 1009-2854(2000)02-0009-06 |
The Complexity of Wide-Neighborhood Infeasible Interior Point Algorithm |
| |
| WEI Yue-chun. The Complexity of Wide-Neighborhood Infeasible Interior Point Algorithm[J]. Journal of Xiangfan University, 2000, 21(2): 9-14 |
| |
| Authors: | WEI Yue-chun |
| |
| Abstract: | The wide-neighborhood infeasible interior point algorithm for solving P*(k) matrix linearcomplementarity problem is discussed in this paper, and the upper bound estimation of the iteration direction ofthe algorithm is raised by introducing an auxiliary series. Furthermore, the iteration complexity of the algorithmis posed by using high-order corrector technique. |
| |
| Keywords: | Polynomal Interior Point Algorithmn Wide-Neighborhood |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
