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

Discrete and Computational Geometry

Volumn 25, Issue 1, 2001, Pages 23-31

  Barvinok, A ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035584604     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004540010074     Document Type: Article

References (14)

1. A. Alfakih and H. Wolkowicz, On the embeddability of weighted graphs in Euclidean spaces, preprint, CORR 98-12, Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario 1998.
2. F. Alizadeh, J.-P.A. Haeberly, and M.L. Overton, Complementarity and nondegeneracy in semidefinite programming, Mathematical Programming, 77(2) (1997), 111-128.
3. E. Anderson and P. Nash, Linear Programming in Infinite-Dimensional Spaces. Theory and Applications, Wiley-Interscience, Chichester, 1987.
4. Y.H. Au-Yeung and Y.T. Poon, A remark on the convexity and positive definiteness concerning Hermitian matrices, Southeast Asian Bulletin of Mathematics, 3(2) (1979), 85-92.
5. A. Barvinok, Problems of distance geometry and convex properties of quadratic maps, Discrete & Computational Geometry, 13 (1995), 189-202.
6. M. Deza and M. Laurent, Geometry of Cuts and Metrics, Algorithms and Combinatorics, Vol. 15, Springer-Verlag, Berlin, 1997.
7. S. Friedland and R. Loewy, Subspaces of symmetric matrices containing matrices with a multiple first eigenvalue, Pacific Journal of Mathematics, 62 (1976), 389-399.
8. M. Laurent, A tour d'horizon on positive semidefinite and Euclidean distance matrix completion problems, in: Topics in Semidefinite and Interior-Point Methods (Toronto, Ontario, 1996), pp. 51-76, Fields Institute Communication, Vol. 18, American Mathematical Society, Providence, RI, 1998.
9. W.S. Massey, Singular Homology Theory, Graduate Texts in Mathematics, Vol. 70, Springer-Verlag, New York, 1980.
10. G. Pataki, Cone-LP's and semidefinite programs: geometry and a simplex-type method, in: Integer Programming and Combinatorial Optimization (Vancouver, BC, 1996), pp. 162-174, Lecture Notes in Computer Science, Vol. 1084, Springer-Verlag, Berlin, 1996.
11. G. Pataki, On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues, Mathematics of Operations Research, 23 (1998), 339-358.
12. Y.T. Poon, On the convex hull of the multiform numerical range, Linear and Multilinear Algebra, 37(1-3) (1994), 221-223.
13. L. Vandenberghe and S. Boyd, Semidefinite programming, SIAM Review 38(1) (1996), 49-95.
14. R. Webster, Convexity, Oxford Science Publications, The Clarendon Press, Oxford University Press, New York, 1994.