The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Log-det heuristic for matrix rank minimization with applications to Hankel and Euclidean distance matrices
Abstract
We present a heuristic for minimizing the rank of a positive semidefinite matrix over a convex set. We use the logarithm of the determinant as a smooth approximation for rank, and locally minimize this function to obtain a sequence of trace minimization problems. We then present a lemma that relates the rank of any general matrix to that of a corresponding positive semidefinite one. Using this, we readily extend the proposed heuristic to handle general matrices. We examine the vector case as a special case, where the heuristic reduces to an iterative l/sub 1/-norm minimization technique. As practical applications of the rank minimization problem and our heuristic, we consider two examples: minimum-order system realization with time-domain constraints, and finding lowest-dimension embedding of points in a Euclidean space from noisy distance data.
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
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Linear Matrix Inequalities in System and Control Theory
Boyd, S., El Ghaoui, L., Feron, E., & Balakrishnan, V. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970777 · Cited by 21,687
Self-citationLinear and nonlinear programming.
(1986) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(86)90092-3 · Cited by 4,805
Vandenberghe, L., & Boyd, S. (1996) · SIAM Review · doi:10.1137/1038003 · Cited by 4,105
Self-citationLinear system theory and design
Barnett, S. M. (1986) · Automatica · doi:10.1016/0005-1098(86)90039-7 · Cited by 3,677
Linear System Theory and Design
Chen, C. (1995) · Medical Entomology and Zoology · Cited by 3,047
Modern Multidimensional Scaling
Borg, I., & Groenen, P. (1997) · Springer Series in Statistics · doi:10.1007/978-1-4757-2711-1 · Cited by 1,728
Rugh, W. J. (1992) · Cited by 1,395
Sontag, E. D. (1998) · Texts in Applied Mathematics · doi:10.1007/978-1-4612-0577-7 · Cited by 1,226
A rank minimization heuristic with application to minimum order system approximation
Fazel, M., Hindi, H., & Boyd, S. P. (2001) · Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148) · doi:10.1109/acc.2001.945730 · Cited by 956
Self-citationA Unified Algebraic Approach To Control Design
Grigoriadis, D. E. (2017) · Routledge eBooks · doi:10.1201/9781315136523 · Cited by 932
Sontag, E. D. (1990) · Texts in Applied Mathematics · doi:10.1007/978-1-4684-0374-9 · Cited by 506
Schoenberg, I. J. (1935) · The Annals of Mathematics · doi:10.2307/1968654 · Cited by 453
Modern Multidimensional Scaling
(2005) · Springer Series in Statistics · doi:10.1007/0-387-28981-x · Cited by 432
Multidimensional Scaling: Concepts and Applications
Moinpour, R., Green, P. E., Carmone, F. J., & Smith, S. M. (1991) · Journal of Marketing Research · doi:10.2307/3172796 · Cited by 202
Cited by
Robust principal component analysis?
Candès, E. J., Li, X., Ma, Y., & Wright, J. (2011) · Journal of the ACM · doi:10.1145/1970392.1970395 · Cited by 6,921
A Singular Value Thresholding Algorithm for Matrix Completion
Cai, J.-F., Candès, E. J., & Shen, Z. (2010) · SIAM Journal on Optimization · doi:10.1137/080738970 · Cited by 5,809
Enhancing Sparsity by Reweighted ℓ 1 Minimization
Candès, E. J., Wakin, M. B., & Boyd, S. P. (2008) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-008-9045-x · Cited by 4,863
Self-citationGuaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
Recht, B., Fazel, M., & Parrilo, P. A. (2010) · SIAM Review · doi:10.1137/070697835 · Cited by 3,471
Self-citationThe Power of Convex Relaxation: Near-Optimal Matrix Completion
Candes, E. J., & Tao, T. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2044061 · Cited by 2,060
Metadata
- Authors
- Fazel, M., Hindi, H., & Boyd, S. P.
- Venue
- Proceedings of the 2003 American Control Conference, 2003.
- Publisher
- IEEE
- Published
- 2004-01-23
- Volume
- 3
- Pages
- 2156-2162
- ISSN
- 0743-1619 (ISSN-L)
- OpenAlex
- W1916337001
- Cited by
- 574
- References
- 15
- FWCI
- 14.83
- Type
- conference paper
- 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
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.