By using Newton direction and centering direction, we establish a feasible interior point algorithm for monotone linear complementarity problem and show that this method is polynomial in complexity.
利用牛顿方向和中心路径方向，获得了求解单调线性互补问题的一种内点算法，并证明该算法经过多项式次迭代之后收敛到原问题的一个最优解。
The monotone horizontal linear complementarity problem is considered in this paper.
考虑了单调的水平线性互补问题。
The monotone horizontal linear complementarity problem is considered in this paper.
考虑了单调的水平线性互补问题。
应用推荐