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

被引：0

作者：

何尚录

徐成贤

机构：

来源：

Science China Mathematics | 2001年 / 03期

基金：

中国国家自然科学基金;

关键词：

complementarity problem; infeasible-interior-point algorithm; polynomial-time complexity; uniform P-function;

D O I：

暂无

中图分类号：

O241 [数值分析];

学科分类号：

070102 ;

摘要：

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

页数：7