The real positive definite completion problem for a simple cycle
From MaRDI portal
Publication:1311311
DOI10.1016/0024-3795(93)90234-FzbMath0786.15027OpenAlexW2062124264MaRDI QIDQ1311311
Charles R. Johnson, Pablo Tarazaga, Wayne W. Barrett
Publication date: 12 May 1994
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(93)90234-f
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Positive matrices and their generalizations; cones of matrices (15B48)
Related Items
Connections between the real positive semidefinite and distance matrix completion problems, Multivariate Gaussians, semidefinite matrix completion, and convex algebraic geometry, Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without \(K_{5}\) minors, Completion problem with partial correlation vines, On a generalization of the trigonometric moment problem, Extremal rays and duals for cones of positive definite matrices with prescribed zeros, Cuts, matrix completions and graph rigidity, A connection between positive semidefinite and Euclidean distance matrix completion problems, Structural conditions for cycle completable graphs, On Sidorenko's conjecture for determinants and Gaussian Markov random fields, The Euclidean distance completion problem: cycle completability, Computing the Grothendieck constant of some graph classes, A parameterization of positive definite matrices in terms of partial correlation vines, An efficient algorithm for maximum entropy extension of block-circulant covariance matrices, Geometry of maximum likelihood estimation in Gaussian graphical models, Positive semidefinite matrix completion, universal rigidity and the strong Arnold property, Symmetric completions of cycles and bipartite graphs, The real positive semidefinite completion problem for series-parallel graphs, Sums of Squares and Sparse Semidefinite Programming, A new graph parameter related to bounded rank positive semidefinite matrix completions, The real positive definite completion problem for a 4-cycle, Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming, The cycle completable graphs for the completely positive and doubly nonnegative completion problems, The symmetric inverse \(M\)-matrix completion problem, Error Bounds and Singularity Degree in Semidefinite Programming, Matrix sandwich problems
Cites Work
