文章把艾文宝的邻域跟踪算法推广到单调线性互补问题(LCP),由于单调LCP的迭代方向不再具有正交性,因此算法的理论分析变得复杂。证明了算法的迭代复杂性为0(√nL),并且通过证明对偶间隙的单调性,使得算法易于执行。
This paper extends Ai's neighborhood-following algorithms for linear programming to monotone linear comple- mentarity problems (LCP). Since monotone LCP is the generalization of linear programming, the analysis is more difficult than the one in the linear programming case. The O(√nL) iteration complexity is given. After proving the monotone property of the dual-gap, the proposed algorithm can be specified into easy implementable variants with given parameters.