Violator空间的Clarksons算法
Clarksons Algorithm for Violator Spaces
摘要:
Clarksons算法是求解线性规划的一种两阶段随机算法。该算法已被简化和适应,以适应LP型问题的框架。在这个框架中,我们可以解决许多非线性问题,例如计算R ^d中一组点的最小封闭球。在2006年,它已经表明,该算法在其原始形式的作品违反者空间,这是一个适当的一般化的LP型问题。然而,目前尚不清楚以前对算法的简化是否适用于新的设置。本文给出了以下理论结果:(a)首次证明了克拉克森第二级可以简化。(b)克拉克森第一阶段的先前简化延续到违规者空间设置。(c)此外,我们还证明了Violator空间与超立方体的超立方体剖分的等价性。
英文摘要:
Clarksons algorithm is a two-staged randomized algorithm for solving linear programs. This algorithm has been simplified and adapted to fit the framework of LP-type problems. In this framework we can tackle a number of non-linear problems such as computing the smallest enclosing ball of a set of points in R^d . In 2006, it has been shown that the algorithm in its original form works for violator spaces too, which are a proper general- ization of LP-type problems. It was not clear, however, whether previous simplifications of the algorithm carry over to the new setting. In this paper we show the following theoretical results: (a) It is shown, for the first time, that Clarksons second stage can be simplified. (b) The previous simplifications of Clarksons first stage carry over to the violator space setting. (c) Furthermore, we show the equivalence of violator spaces and partitions of the hypercube by hypercubes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。