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 条

[1] Infeasible-interior-point algorithm for a class of nonmonotone complementarity problems and its computational complexity
何尚录
徐成贤
[J]. Science in China,Ser.A, 2001, Ser.A.2001 (03) - 344
[2] Infeasible-interior-point algorithm for a class of nonmonotone complementarity problems and its computational complexity
何尚录
徐成贤
[J]. Science China Mathematics, 2001, (03) : 338 - 344
[3] Infeasible-interior-point algorithm for a class of nonmonotone complementarity problems and its computational complexity
He, SL
Xu, CX
[J]. SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY, 2001, 44 (03): : 338 - 344
[4] AN INFEASIBLE-INTERIOR-POINT ALGORITHM FOR LINEAR COMPLEMENTARITY-PROBLEMS
WRIGHT, SJ
[J]. MATHEMATICAL PROGRAMMING, 1994, 67 (01) : 29 - 51
[5] A superlinear infeasible-interior-point algorithm for monotone complementarity problems
Wright, S
Ralph, D
[J]. MATHEMATICS OF OPERATIONS RESEARCH, 1996, 21 (04) : 815 - 838
[6] IMPROVED INFEASIBLE-INTERIOR-POINT ALGORITHM FOR LINEAR COMPLEMENTARITY PROBLEMS
Zangiabadi, M.
Mansouri, H.
[J]. BULLETIN OF THE IRANIAN MATHEMATICAL SOCIETY, 2012, 38 (03) : 787 - 803
[7] An infeasible-interior-point method for linear complementarity problems
Simantiraki, EM
Shanno, DF
[J]. SIAM JOURNAL ON OPTIMIZATION, 1997, 7 (03) : 620 - 640
[8] Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity
Stoer, J
Wechs, M
[J]. MATHEMATICAL PROGRAMMING, 1998, 83 (03) : 407 - 423
[9] Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity
Josef Stoer
Martin Wechs
[J]. Mathematical Programming, 1998, 83 : 407 - 423
[10] A Modified Infeasible-Interior-Point Algorithm for Linear Optimization Problems
H. Mansouri
M. Zangiabadi
M. Arzani
[J]. Journal of Optimization Theory and Applications, 2015, 166 : 605 - 618

← 1 2 3 4 5 →