Infeasible-interior-point algorithm for a class of nonmonotone complementarity problems and its computational complexity

被引：0
|
作者：
Shanglu He
Chengxian Xu
机构：
[1] Xi’an Jiaotong University,Department of Scientific Computing, Science School
来源：
Science in China Series A: Mathematics | 2001年 / 44卷
关键词：
complementarity problem; infeasible-interior-point algorithm; polynomial-time complexity; uniform P-function;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
This paper presents an infeasible-interior-point algorithm for a class of nonmonotone complementarity problems, and analyses its convergence and computational complexity. The results indicate that the proposed algorithm is a polynomial-time one.
引用
收藏
页码：338 / 344
页数：6
相关论文
共 50 条
12345