摘要

In this paper, we propose a new kind of kernel function for P*(k) nonlinear complementarity problems. We show that if a strictly feasible starting point is available and the undertake problem satisfies some conditions, then the new large-update primal-dual interior-point algorithm for P*(k)-NOP has 0((1+2k)n(m+2/2(m+1)) lognμ0/Ε). The result decreases the gap between the practical behavior of the large-update and their theoretical performance results.

  • 出版日期2013

全文