A remark on the rank of positive semidefinite matrices subject to affine constraints

DOI10.1007/s004540010074zbMath0969.90096MaRDI QIDQ1592506

Alexander I. Barvinok

Publication date: 4 October 2001

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004540010074

zbMATH Keywords

weighted graphs

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

52A20: Convex sets in (n) dimensions (including convex hypersurfaces)

Related Items

Gram spectrahedra, Graph theoretic uncertainty and feasibility, Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization, A new semidefinite programming relaxation scheme for a class of quadratic matrix problems, The generalized trust region subproblem, Polynomial diffusions on compact quadric sets, New results on Hermitian matrix rank-one decomposition, Positive semidefinite rank, Convexity properties associated with nonconvex quadratic matrix functions and applications to quadratic programming, A new graph parameter related to bounded rank positive semidefinite matrix completions, A strengthened Barvinok-Pataki bound on SDP rank, Optimal Information Blending with Measurements in the L² Sphere