The monotone horizontal linear complementarity problem is considered in this paper.
考虑了单调的水平线性互补问题。
The MAOR iterative algorithm is used to solve an implicit linear complementarity problem with L-matrix.
用MAOR迭代算法求解一类L -矩阵的隐线性互补问题。
The linear complementarity problem was very useful in economics, it was widely used in game theory and mathematical programming.
线性互补问题在经济学、对策论和数学规划领域中有广泛的应用，线性互补问题解的存在性与特殊矩阵密切相关。
We extend P_property in the linear complementarity problem to V_P property in the extended vertical linear complementarity problem.
进一步研究扩展的垂直线性互补问题，即将线性互补问题中的P性质在扩展的垂直线性互补问题中推广为V P性质。
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.
利用牛顿方向和中心路径方向，获得了求解单调线性互补问题的一种内点算法，并证明该算法经过多项式次迭代之后收敛到原问题的一个最优解。
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.
利用牛顿方向和中心路径方向，获得了求解单调线性互补问题的一种内点算法，并证明该算法经过多项式次迭代之后收敛到原问题的一个最优解。
应用推荐