求解P_*(k)阵线性互补问题的内点幂级数算法

The Interior-Point Power Series Algorithm for P_*(k)-matrice Linear Complementarity Problem

本文对 P* ( k)阵线性互补问题 ,给出了一种内点幂级数算法 .其迭代复杂度为 O( 2 k+ 1) 2 n( 1 + 1 /r) /2L( 1 + 1 ) /r,r为阶数 .

In this paper, we introduce an interior point power series algorithm for -matrice linear complementarity problem, it has O((2k+1) 2n 1/2(1+1/r) L (1+1/r) )-iteration complexity, where r is the order .