| 一致P-函数非线性互补问题的宽邻域不可行内点算法及其计算复杂性 |
| |
| 引用本文： | 王浚岭.一致P-函数非线性互补问题的宽邻域不可行内点算法及其计算复杂性[J].高等学校计算数学学报,2007,29(4):311-323. |
| |
| 作者姓名： | 王浚岭 |
| |
| 作者单位： | 三峡大学理学院数学系,宜昌,443002 |
| |
| 基金项目： | 湖北省教育厅重点科研项目(D200613009) |
| |
| 摘 要： | 1引言与记号单调线性互补问题和线性规划问题的原始-对偶路径跟踪算法,1989年的文献1、2]分别首先提出。以后又出现了一些改进的算法。早期的原始-对偶路径跟踪算法及其改进算法的迭代点列大都是在包含中心路径C的一个2-范数的窄邻域里,这种可行内点算法通常理论上具有最好的迭代复杂性O(n~(1/2)L),但是由于窄邻域极大地限制了迭代步长,实
|
| 关 键 词： | 不可行内点算法 非线性互补问题 计算复杂性 P-函数 邻域 路径跟踪算法 单调线性互补问题 2-范数 |
| 收稿时间： | 2005-09-17 |
A WIDE-NEIGHBORHOOD INFEASIBLE-INTERIOR-POINT ALGORITHMS FOR UNIFORM P-FUNCTION NONLINEAR COMPLEMENTARY PROBLEMS AND ITS COMPUTATIONAL COMPLEXITY |
| |
| Wang Junling.A WIDE-NEIGHBORHOOD INFEASIBLE-INTERIOR-POINT ALGORITHMS FOR UNIFORM P-FUNCTION NONLINEAR COMPLEMENTARY PROBLEMS AND ITS COMPUTATIONAL COMPLEXITY[J].Numerical Mathematics A Journal of Chinese Universities,2007,29(4):311-323. |
| |
| Authors: | Wang Junling |
| |
| Institution: | College of Science, China Three Gorges University, Yichang 443002 |
| |
| Abstract: | In this paper, a new wide-neighborhood infeasible-interior-point algo- rithm for uniform P-function nonlinear complementary problems is presented, and its convergence and computational complexity are discussed. The results indicate that the algorithm is a polynomial-time one. If the initial point is a feasible-interior point, then the algorithm reduces to a wide-neighborhood feasible-interior-point algorithm. |
| |
| Keywords: | nonlinear complementary problem wide-neighborhood infeasibleinterior-point algorithms computational complexity uniform P-function |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
