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

抽象立方体上基于历史的单纯形主元规则的指数下界

Exponential lower bounds for history-based simplex pivot rules on abstract cubes

Antonis Thomas

摘要:

单纯形算法的行为是一个广泛研究的课题。具体而言,问题的存在的多项式枢轴规则的单纯形算法是非常重要的。在这里,我们给出了三个基于历史的枢轴规则的指数下界。这些规则根据对过去步骤的记忆来决定下一步。特别是,我们研究了扎德的最少进入规则,约翰逊的最近最少的基本规则和坎宁安的最近考虑(或循环)规则。我们给指数下界的抽象立方体的无环唯一的汇方向(AUSO),所有这些枢轴规则。对于约翰逊的规则,我们的界限是第一个超多项式在任何情况下;扎德的,它是第一个AUSO。这两个是我们的主要成果。

英文摘要:

The behavior of the simplex algorithm is a widely studied subject. Specifically, the question of the existence of a polynomial pivot rule for the simplex algorithm is of major importance. Here, we give exponential lower bounds for three history-based pivot rules. Those rules decide their next step based on memory of the past steps. In particular, we study Zadeh's least entered rule, Johnson's least-recently basic rule and Cunningham's least-recently considered (or round-robin) rule. We give exponential lower bounds on Acyclic Unique Sink Orientations (AUSO) of the abstract cube, for all of these pivot rules. For Johnson's rule our bound is the first superpolynomial one in any context; for Zadeh's it is the first one for AUSO. Those two are our main results.

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

↑