On the Facial Structure of the Set of Correlation Matrices
From MaRDI portal
Publication:4891696
DOI10.1137/0617031zbMath0855.15011OpenAlexW1976962893MaRDI QIDQ4891696
Svatopluk Poljak, Monique Laurent
Publication date: 4 February 1997
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/a32afe17d21fc6ad6cbd4fc97907d03213b8f9fb
Combinatorial optimization (90C27) Positive matrices and their generalizations; cones of matrices (15B48) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Related Items
Extreme points of Gram spectrahedra of binary forms, Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations, Efficient rank reduction of correlation matrices, A polyhedral approach to the single row facility layout problem, Deciding Polyhedrality of Spectrahedra, Nonlinear formulations and improved randomized approximation algorithms for multicut problems, Binary Positive Semidefinite Matrices and Associated Integer Polytopes, Gap inequalities for non-convex mixed-integer quadratic programs, Null spaces of correlation matrices, Complexity results for the gap inequalities for the max-cut problem, The data singular and the data isotropic loci for affine cones, Polyhedral faces in Gram spectrahedra of binary forms, Valid inequalities for quadratic optimisation with domain constraints, The real positive semidefinite completion problem for series-parallel graphs, Simplicial faces of the set of correlation matrices, Exploring the relationship between max-cut and stable set relaxations, Symmetric matrices, Catalan paths, and correlations, Unnamed Item, Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope, Exact recovery in the Ising blockmodel, Determinantal sampling designs, Solving quadratic (0,1)-problems by semidefinite programs and cutting planes, Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP, Binary Component Decomposition Part I: The Positive-Semidefinite Case, Unnamed Item, Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
