arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0807.1249math.OC
收藏

线性互补中的旋转:两种多项式时间情形

Pivoting in Linear Complementarity: Two Polynomial-Time Cases

Jan Foniok, Komei Fukuda, Bernd Gärtner, Hans-Jakob Lüthi

摘要:

研究了P-矩阵线性互补性问题的简单主元方法的性质。我们解决了一个开放的问题,莫里斯表明,Murty的最小指数枢轴规则(在任何固定的索引顺序)导致二次迭代次数的莫里斯的高度循环P-LCP的例子。然后,我们表明,在K-矩阵LCP的情况下,所有的枢轴规则只需要一个线性数量的迭代。作为主要的工具,我们采用独特的下沉方向的立方体,一个有用的组合抽象的P-LCP。

英文摘要:

We study the behavior of simple principal pivoting methods for the P-matrix linear complementarity problem (P-LCP). We solve an open problem of Morris by showing that Murty's least-index pivot rule (under any fixed index order) leads to a quadratic number of iterations on Morris's highly cyclic P-LCP examples. We then show that on K-matrix LCP instances, all pivot rules require only a linear number of iterations. As the main tool, we employ unique-sink orientations of cubes, a useful combinatorial abstraction of the P-LCP.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑