求解退化单调线性互补问题极大互补解的复杂性

The Comlexity for Finding a Maximally Conplementary Solution to the Degenerate Monotone LCP

本文考虑求解退化单调线性互补问题的一类不可行内点算法，其中嵌入一个恢复算法，给出了用这类算法产生所考虑问题的一个精确极大互补解的复杂性．

In this paper,we consider a class of infeasible interior point algorithms for solving the degenerate monotone linear complementarity problem,where a rounding procedure is embed-ed. We give out the complexity of the algorithm above which yields an exact maximally com-plementary solution to the problem concerned