首页 | 本学科首页   官方微博 | 高级检索  
     检索      


A strengthened Barvinok-Pataki bound on SDP rank
Institution:Faculty of Mathematics, University of Waterloo, 200 University Ave W, Waterloo, N2L 3G1, ON, Canada
Abstract:The Barvinok-Pataki bound provides an upper bound on the rank of extreme points of a spectrahedron. This bound depends solely on the number of affine constraints of the problem, i.e., on the algebra of the problem. Specifically, the triangular number of the rank r is upper bounded by the number of affine constraints. We revisit this bound and provide a strengthened upper bound on the rank using the singularity degree of the spectrahedron. Thus we bring in the geometry and stability of the spectrahedron, i.e., increased instability as seen by higher singularity degree, yields a lower, strengthened rank bound.
Keywords:Barvinok-Pataki bound  Facial reduction  Rank  Semidefinite programming  Singularity degree
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号