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

DOI10.1007/s004540010074zbMath0969.90096OpenAlexW1984149403MaRDI 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

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items (17)

Optimal Information Blending with Measurements in the L² Sphere ⋮ On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations ⋮ Simultaneous Diagonalization via Congruence of Hermitian Matrices: Some Equivalent Conditions and a Numerical Solution ⋮ A strengthened Barvinok-Pataki bound on SDP rank ⋮ An upper bound on the minimum rank of a symmetric Toeplitz matrix completion problem ⋮ Time-Varying Semidefinite Programming: Path Following a Burer–Monteiro Factorization ⋮ Low-Rank Univariate Sum of Squares Has No Spurious Local Minima ⋮ A new semidefinite programming relaxation scheme for a class of quadratic matrix problems ⋮ The generalized trust region subproblem ⋮ Gram spectrahedra ⋮ Polynomial diffusions on compact quadric sets ⋮ A new graph parameter related to bounded rank positive semidefinite matrix completions ⋮ Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization ⋮ New results on Hermitian matrix rank-one decomposition ⋮ Graph theoretic uncertainty and feasibility ⋮ Positive semidefinite rank ⋮ Convexity properties associated with nonconvex quadratic matrix functions and applications to quadratic programming

This page was built for publication: A remark on the rank of positive semidefinite matrices subject to affine constraints