|
|||||
|
|
Infeasible-interior-point algorithm for a class of nonmonotone complementarity problems and its computational complexity |
|
| Authors: | HE Shanglu Xu Chengxian |
| Affiliation: | Department of Scientific Computing, Science School, Xi'an Jiaotong University, Xi'an 710049, China |
| Abstract: | 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. |
| Keywords: | complementarity problem infeasible-interior-point algorithm polynomial-time complexity uniform P-function |
| 本文献已被 万方数据 SpringerLink 等数据库收录！ | |