On the facial structure of the set of correlation matrices

SIAM Journal on Matrix Analysis and Applications

Volumn 17, Issue 3, 1996, Pages 530-547

  Laurent, Monique ^a   Poljak, Svatopluk ^b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b UNIVERSITY OF PASSAU   (Germany)

Author keywords

Correlation matrix; Face; Max cut problem

Indexed keywords

EID: 0030499632     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/0617031     Document Type: Article

References (20)

1. W. W. BARRETT, C. R. JOHNSON, AND P. TARAZAGA, The real positive definite completion problem for a simple cycle, Linear Algebra Appl., 192 (1993), pp. 3-31.
2. W. W. BARRETT, C. R. JOHNSON, AND R. LOEWY, The real positive definite completion problem: Cycle completability, to appear in Memoirs of the American Mathematical Society.
3. J. P. R. CHRISTENSEN AND J. VESTERSTRØM, A note on extreme positive definite matrices, Math. Ann., 244 (1979), pp. 65-68.
4. C. DELORME AND S. POLJAK, Laplacian eigenvalues and the maximum cut problem, Math. Programming, 62 (1993), pp. 557-574.
5. _, Combinatorial properties and the complexity of an eigenvalue approximation of the max-cut problem, European J. Combin., 14 (1993), pp. 313-333.
6. M. DEZA, M. LAURENT, AND S. POLJAK, The cut cone III: On the role of triangle facets, Graphs Combin., 8 (1992), pp. 125-142. Updated version in Graphs Combin., 9 (1993), pp. 135-152.
7. M. DEZA, M. LAURENT, AND S. POLJAK, The cut cone III: On the role of triangle facets, Graphs Combin., 8 (1992), pp. 125-142. Updated version in Graphs Combin., 9 (1993), pp. 135-152.
8. H. DYM AND I. GOHBERG, Extensions of band matrices with band inverses, Linear Algebra Appl., 36 (1981), pp. 1-24.
9. M. X. GOEMANS AND D. P. WILLIAMSON, .878-approximation algorithms for MAX CUT and MAX 2SAT, in Proceedings of the 26th Annual Symposium on Theory of Computing, Montréal, Canada, 1994, pp. 422-431.
10. R. GRONE, C. R. JOHNSON, E. M. SÁ, AND H. WOLKOWICZ, Positive definite completions of partial hermitian matrices, Linear Algebra Appl., 58 (1984), pp. 109-124.
11. R. GRONE, S. PIERCE, AND W. WATKINS, Extremal correlation matrices, Linear Algebra Appl., 134 (1990), pp. 63-70.
12. R. D. HILL AND S. R. WATERS, On the cone of positive semidefinite matrices, Linear Algebra Appl., 90 (1987), pp. 81-88.
13. M. LAURENT, The real positive semidefinite completion problem for series-parallel graphs, Report BS-R9439, Centrum voor Wiskunde en Informatica, Amsterdam, 1994, to appear in Linear Algebra Appl..
14. M. LAURENT AND S. POLJAK, One-third-integrality in the metric polytope, Math. Programming, 71 (1995), pp. 29-50.
15. _, On a positive semidefinite relaxation of the cut polytope, Linear Algebra Appl., 223/224 (1995), pp. 439-461.
16. M. LAURENT, S. POLJAK, AND F. RENDL, Connections between semidefinite relaxations of the max-cut and stable-set problems, Report BS-R9502, Centrum voor Wiskunde en Informatica, Amsterdam, 1995, to appear in Math. Programming.
17. G.S. LEUKER, D. J. ROSE, AND R. E. TARJAN, Algorithmic aspects of vertex eliminations on graphs, SIAM J. Comput., 5 (1976), pp. 266-283.
18. CHI-KWONG LI AND BIT-SHUN TAM, A note on extreme correlation matrices, SIAM J. Matrix Anal. Appl., 15 (1994), pp. 903-908.
19. R. LOEWY, Extreme points of a convex subset of the cone of positive semidefinite matrices, Math. Ann., 253 (1980), pp. 227-232.
20. M. L. OVERTON, On minimizing the maximum eigenvalue of a symmetric matrix, SIAM J. Matrix Anal. Appl., 9 (1988), pp. 256-268.