论文标题
最大化到达超盘交点上“足够远”点的距离
Maximizing The Distance To A "Far Enough" Point Over The Intersection Of Hyper-Disks
论文作者
论文摘要
我们提出了一个新颖的可行性标准，用于不平等给出的凸集有限交集。该标准使我们能够通过分析特定的fic凸函数的最小值来轻松地断言可行性，这些功能是我们与给定集合形成的。接下来，提出了一种将概念扩展到特定非凸的情况的算法：主张在另一组具有不同半径的超盘中，一组具有相等半径的超盘的fi nite相交。
We present a novel feasibility criteria for the finite intersection of convex sets given by inequalities. This criteria allows us to easily assert the feasibility by analyzing the unconstrained minimum of a speci?fic convex function, that we form with the given sets. Next an algorithm is presented which extends the idea to a particular non-convex case: assert the inclusion of the fi?nite intersection of a set of hyper-disks with equal radii in another hyper-disk with a different radius.
