| 一个求解水平线性互补问题的高阶可行内点算法的多项式复杂性 |
| |
| 引用本文： | 黄正海.一个求解水平线性互补问题的高阶可行内点算法的多项式复杂性[J].系统科学与数学,2000,20(4):432-438. |
| |
| 作者姓名： | 黄正海 |
| |
| 作者单位： | 复旦大学统计运筹系，上海 200433 |
| |
| 基金项目： | 国家自然科学基金(No:
19871016)资助项目. |
| |
| 摘 要： | 最近,Zhao和Sun提出了一个求解sufficient线性互补问题的高阶不可行内点算法.不需要严格互补解条件,他们的算法获得了高阶局部收敛率,但他们的文章没有报告多项式复杂性结果.本文我们考虑他们所给算法的一个简化版本,即考虑求解单调水平线性互补问题的一个高阶可行内点算法.我们证明了算法的迭代复杂性是
|
| 关 键 词： | 高阶内点算法，单调水平线性互补问题 多项式复杂性。 |
| 修稿时间： | 1998年5月21日 |
POLYNOMIALITY OF A HIGH-ORDER FEASIBLE INTERIORPOINT METHOD FOR SOLVING THE HORIZONTAL LINEAR COMPLEMENTARITY PROBLEMS |
| |
| Huang Zhenghai.POLYNOMIALITY OF A HIGH-ORDER FEASIBLE INTERIORPOINT METHOD FOR SOLVING THE HORIZONTAL LINEAR COMPLEMENTARITY PROBLEMS[J].Journal of Systems Science and Mathematical Sciences,2000,20(4):432-438. |
| |
| Authors: | Huang Zhenghai |
| |
| Institution: | Department of Statistics and Operations Research, Fudan University, Shanghai 200433,P.R.China |
| |
| Abstract: | Recently, Zhao and Sun presented a high-order infeasible interior point method (IPM) for solving the sufficient linear complementarity problem (LCP) which possesses highorder convergent rate when the LCP has no strictly complementary solution. But no polynomiality result was reported in their paper. In this paper, we consider a simple version of their algorithm, i.e., a high-order feasible IPM for solving the monotone horizontal linear complementarity problem. We prove that the iteration complexity of the method is of O(). |
| |
| Keywords: | High-order interior point method the monotone horizontal linear comple- mentarity problem polynomiality |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《系统科学与数学》浏览原始摘要信息 |
| 点击此处可从《系统科学与数学》下载免费的PDF全文 |
