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

Carathéodory数的一个界

A bound on the Carathéodory number

Masaru Ito, Bruno F. Lourenço

摘要:

闭凸锥K的Carathéodory数k(K)是所有k中的最小值,使得K中的每个元素都可以写成最多k个属于极值射线的元素的非负线性组合。Carathéodory定理给出了界k(K)<= dim(K)。在这项工作中,我们观察到这个界限可以锐化为k(K)<= l-1,其中l是K中包含的非空面的最长链的长度,因此将Carathéodory数与面部缩减算法分析中出现的关键量联系起来。我们表明,这个界是紧的几个家庭的锥,其中包括对称锥和所谓的光滑锥。我们还给出了一个家庭的例子表明,这个界限也可以不尖锐。此外,我们还对Güler和Tunçel关于对称锥的Carathéodory数等于其秩的一个结果给出了新的证明。最后,我们将我们的讨论与完全正矩阵的cp秩的概念联系起来。

英文摘要:

The Carathéodory number k(K) of a pointed closed convex cone K is the minimum among all the k for which every element of K can be written as a nonnegative linear combination of at most k elements belonging to extreme rays. Carathéodory's Theorem gives the bound k(K) <= dim (K). In this work we observe that this bound can be sharpened to k(K) <= l-1, where l is the length of the longest chain of nonempty faces contained in K, thus tying the Carathéodory number with a key quantity that appears in the analysis of facial reduction algorithms. We show that this bound is tight for several families of cones, which include symmetric cones and the so-called smooth cones. We also give a family of examples showing that this bound can also fail to be sharp. In addition, we furnish a new proof of a result by Güler and Tunçel which states that the Carathéodory number of a symmetric cone is equal to its rank. Finally, we connect our discussion to the notion of cp-rank for completely positive matrices.

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

↑