Covariance selection for nonchordal graphs via chordal embedding

Optimization Methods and Software

Volumn 23, Issue 4, 2008, Pages 501-520

  Dahl, Joachim ^a   Vandenberghe, Lieven ^b   Roychowdhury, Vwani ^b  

^a AALBORG UNIVERSITY   (Denmark)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Chordal graphs; Convex optimization; Sparse matrices

Indexed keywords

ARTIFICIAL INTELLIGENCE; CONJUGATE GRADIENT METHOD; DECISION SUPPORT SYSTEMS; GRADIENT METHODS; GRAPH THEORY; GRAPHIC METHODS; INFORMATION MANAGEMENT; ITERATIVE METHODS; KNOWLEDGE MANAGEMENT; LEARNING SYSTEMS; MATHEMATICAL PROGRAMMING; MAXIMUM LIKELIHOOD ESTIMATION; NEWTON-RAPHSON METHOD; SEARCH ENGINES;

CHORDAL GRAPHS; CLOSED FORM SOLUTIONS; CONDITIONAL INDEPENDENCES; CONJUGATE GRADIENT (CG); CONVEX OPTIMIZATION PROBLEMS; EFFICIENT METHODS; GAUSSIAN; GRAPHICAL MODELS (GM); ITERATIVE ALGORITHMS; LIKELIHOOD ESTIMATION; LOG LIKELIHOOD FUNCTION (LLF); MACHINE-LEARNING; NEWTON'S METHODS; RECURSIONS;

TREES (MATHEMATICS);

EID: 47249127654     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556780802102693     Document Type: Article

References (29)

1. P. Amestoy, T. Davis, and I. Duff, An approximate minimum degree ordering, SIAM J. Matrix Anal. Appl. 17(4) (1996), pp. 886-905.
2. W. W. Barrett, C.R. Johnson, and M. Lundquist. Determinantal formulation for matrix completions associated with chordal graphs, Linear Algebra and Appl. 121 (1989), pp. 265-289.
3. D.P. Bertsekas and J.N. Tsitsiklis, Parallel and Distributed Computation. Prentice Hall, Englewood Cliffs, NJ, 1989.
4. J.R.S. Blair and B. Peyton, An introduction to chordal graphs and clique trees, in Graph Theory and Sparse Matrix Computation, A. George, J.R. Gilbert and J.W.H. Liu, eds., Springer-Verlag, 1993.
5. K. A. Bollen, Structural Equations with Latent Variables, John Wiley & Sons, 1989.
6. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge University Press, 2004. www.stanford.edu/~boyd/cvxbook.
7. C. Bron and J. Kerbosch, Algorithm 457: finding all cliques of an undirected graph, Commun. ACM 16(9) (1973), pp. 575-577.
8. G.R. Cowell, A.P. Dawid, S.L. Lauritzen, and D.J. Spiegelhalter, Probabilistic Networks and Expert Systems, New York, Springer-Verlag, 1999.
9. J. Dahl and L. Vandenberghe. CVXOPT: A Python package for convex optimization, 2006. Available at www.ee.ucla.edu/~vandenbe/cvxopt.
10. T. Davis, University of Florida sparse matrix collection. Available at http://www.cise.ufl.edu/research/sparse/mat/Kamvar.
11. A.P. Dempster, Covariance selection, Biometrics 28 (1972), pp. 157-175.
12. A.M. Erisman and W.F. Tinney. On computing certain elements of the inverse of a sparse matrix, Commun. ACM 18(3) (1975), pp. 177-179.
13. M. Fukuda, M. Kojima, K. Murota, and K. Nakata, Exploiting sparsity in semidefinite programming via matrix completion I: general framework, SIAM J. Optim. 11 (2000), pp. 647-674.
14. P.E. Gill, G.H. Golub. W. Murray, and M.A. Saunders, Methods for modifying matrix factorizations, Math. Comput. 28 (1974), pp. 505-535.
15. G.H. Golub and C.F. Van Loan. Matrix Computations, 3rd ed. John Hopkins University Press, 1996.
16. 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.
17. C.R. Johnson, B. Kroschel, and H. Wolkowicz, An interior-point method for approximate positive definite completions. Comput. Optim. Appl. 9(2) (1998), pp. 175-190.
18. M. Laurent, Matrix completion problems, in Encyclopedia of Optimization, Vol. III. C.A. Floudas and P.M. Pardalos, eds., Kluwer, 2001, pp. 221-229.
19. S.L. Lauritzen, Graphical Models, Oxford, Oxford University Press, 1996.
20. K. Nakata, K. Fujitsawa, M. Fukuda, M. Kojima, and K. Murota, Exploiting sparsity in semidefinite programming via matrix completion II: implementation and numerical details. Math. Program. Ser. B. 95 (2003) pp. 303-327.
21. Networkx. Python package for the creation, manipulation, and study of the structure, dynamics, and functions of complex networks. Available networkx.lanl.gov.
22. J. Pearl. Probabilistic Reasoning in Intelligent Systems, Morgan Kaufmann, 1988.
23. D.J. Rose, Triangulated graphs and the elimination process, J. Math. Anal. Appl. 32 (1970), pp. 597-609.
24. D.J. Rose, R.E. Tarjan, and G.S. Lueker, Algorithmic aspects of vertex elimination on graphs. SIAM J. Compu. 5(2) (1976), pp. 266-283.
25. T.P. Speed and H.T. Kiiveri, Gaussian Markov distribution over finite graphs, Ann. Stat. 14(1) (1986), pp. 138-150.
26. R.E. Tarjan and M. Yannakakis, Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs, SIAM J. Comput. 13(3) (1984) pp. 566-579.
27. L. Vandenberghe, S. Boyd, and S.-P. Wu, Determinant maximization with linear matrix inequality constraints, SIAM J. Matrix Anal. Appl. 19(2) (1998), pp. 499-533.
28. N. Wermuth, Linear recursive equations, covariance selection, and path analysis, J. Am. Stat. Assoc. 75(372) (1980), pp. 963-972.
29. N. Wermuth and E. Scheidt, Algorithm AS 105: fitting a covariance selection model to a matrix, Appl. Stat. 26(1) (1977), pp. 88-92.