1993
DOI: 10.1016/0024-3795(93)90234-f
|View full text |Cite
|
Sign up to set email alerts
|

The real positive definite completion problem for a simple cycle

Abstract: We consider the question of whether a real partial positive denite matrix (in which the specied o-diagonal entries consist of a full n cycle) has a positive denite completion. This lies in contrast to the previously studied chordal case. We give t w o solutions. In one, we describe about n 2 independent conditions on angles associated with a normalization of the data that are necessary and sucient. The second is more computational and allows presentation of all positive denite completions, as well as answering… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
59
0
1

Year Published

1997
1997
2022
2022

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 50 publications
(60 citation statements)
references
References 2 publications
0
59
0
1
Order By: Relevance
“…The dual cone C G consists of all partial matrices T ∈ R E with entries in positions (i, j) ∈ E, which can be extended to a full positive definite matrix. So, maximum likelihood estimation in Gaussian graphical models corresponds to the classical positive definite matrix completion problem (Barrett et al 1993;Grone et al 1984;Barrett et al 1996;Laurent 2001b). In this section we investigate our three guiding questions, first for chordal graphs, next for the chordless m-cycle C m , then for all graphs with five or less vertices, and finally for the m-wheel W m .…”
Section: Gaussian Graphical Modelsmentioning
confidence: 99%
See 4 more Smart Citations
“…The dual cone C G consists of all partial matrices T ∈ R E with entries in positions (i, j) ∈ E, which can be extended to a full positive definite matrix. So, maximum likelihood estimation in Gaussian graphical models corresponds to the classical positive definite matrix completion problem (Barrett et al 1993;Grone et al 1984;Barrett et al 1996;Laurent 2001b). In this section we investigate our three guiding questions, first for chordal graphs, next for the chordless m-cycle C m , then for all graphs with five or less vertices, and finally for the m-wheel W m .…”
Section: Gaussian Graphical Modelsmentioning
confidence: 99%
“…, x m ) such that (25) can be filled up to a positive definite matrix. The 2 × 2-minors of (25) Barrett et al (1993) gave a beautiful polyhedral description of the spectrahedron C ′ m . The idea is to replace each x i by its arc-cosine, that is, to substitute x i = cos(φ i ) into (25).…”
Section: Sketch Of Proofmentioning
confidence: 99%
See 3 more Smart Citations