The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Chordal Graphs and Semidefinite Optimization
Abstract
Chordal graphs play a central role in techniques for exploiting sparsity in large semidefinite optimization problems and in related convex optimization problems involving sparse positive semidefinite matrices. Chordal graph properties are also fundamental to several classical results in combinatorial optimization, linear algebra, statistics, signal processing, machine learning, and nonlinear optimization. This survey covers the theory and applications of chordal graphs, with an emphasis on algorithms developed in the literature on sparse Cholesky factorization. These algorithms are formulated as recursions on elimination trees, supernodal elimination trees, or clique trees associated with the graph. The best known example is the multifrontal Cholesky factorization algorithm, but similar algorithms can be formulated for a variety of related problems, including the computation of the partial inverse of a sparse positive definite matrix, positive semidefinite and Euclidean distance matrix completion problems, and the evaluation of gradients and Hessians of logarithmic barriers for cones of sparse positive semidefinite matrices and their dual cones. The purpose of the survey is to show how these techniques can be applied in algorithms for sparse semidefinite optimization, and to point out the connections with related topics outside semidefinite optimization, such as probabilistic networks, matrix completion problems, and partial separability in nonlinear optimization.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Goemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587
Lauritzen, S. L. (1996) · doi:10.1093/oso/9780198522195.001.0001 · Cited by 2,976
Cited by
A Survey of Distributed Optimization and Control Algorithms for Electric Power Systems
Molzahn, D. K., Dorfler, F., Sandberg, H., Low, S. H., Chakrabarti, S., Baldick, R., & Lavaei, J. (2017) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2017.2720471 · Cited by 1,273
A rewriting system for convex optimization problems
Agrawal, A., Verschueren, R., Diamond, S., & Boyd, S. (2018) · Journal of Control and Decision · doi:10.1080/23307706.2017.1397554 · Cited by 669
A Survey of Relaxations and Approximations of the Power Flow Equations
Molzahn, D. K., & Hiskens, I. A. (2019) · Foundations and Trends® in Electric Energy Systems · doi:10.1561/3100000012 · Cited by 272
Metadata
- Authors
- Vandenberghe, L., & Andersen, M. S.
- Venue
- Foundations and Trends in Optimization
- Publisher
- Emerald
- Published
- 2015-05-27
- Volume
- 1
- Issue
- 4
- Pages
- 241-433
- ISSN
- 2167-3888 (ISSN-L)
- 2167-3918
- OpenAlex
- W4292070118
- Cited by
- 185
- References
- 3
- FWCI
- 15.54
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Chordal Graphs and Semidefinite Optimization. https://app.cochat.ai/papers/10.1561/2400000006
- The paper
- Vandenberghe, L., & Andersen, M. S. (2015). Chordal Graphs and Semidefinite Optimization. Foundations and Trends in Optimization. https://doi.org/10.1561/2400000006
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.