The DOI matches its Crossref record; 66 of the 66 references it cites were found in a registry or an index.
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
Open accessAbstract
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the literature of a diverse set of fields including system identification and control, Euclidean embedding, and collaborative filtering. Although specific instances can often be solved with specialized algorithms, the general affine rank minimization problem is NP-hard because it contains vector cardinality minimization as a special case. In this paper, we show that if a certain restricted isometry property holds for the linear transformation defining the constraints, the minimum-rank solution can be recovered by solving a convex optimization problem, namely, the minimization of the nuclear norm over the given affine space. We present several random ensembles of equations where the restricted isometry property holds with overwhelming probability, provided the codimension of the subspace is sufficiently large. The techniques used in our analysis have strong parallels in the compressed sensing framework. We discuss how affine rank minimization generalizes this preexisting concept and outline a dictionary relating concepts from cardinality minimization to those of rank minimization. We also discuss several algorithmic approaches to minimizing the nuclear norm and illustrate our results with numerical examples.
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., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
Donoho, D. L. (2004) · Cited by 16,703
Nonlinear total variation based noise removal algorithms
Rudin, L. I., Osher, S., & Fatemi, E. (1992) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(92)90242-f · Cited by 15,704
Candes, E. J., Romberg, J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862083 · Cited by 15,639
Nonlinear Dimensionality Reduction by Locally Linear Embedding
Roweis, S. T., & Saul, L. K. (2000) · Science · doi:10.1126/science.290.5500.2323 · Cited by 14,965
A Global Geometric Framework for Nonlinear Dimensionality Reduction
Tenenbaum, J. B., Silva, V. D., & Langford, J. C. (2000) · Science · doi:10.1126/science.290.5500.2319 · Cited by 13,585
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
Efron, B., Hastie, T., Johnstone, I., & Tibshirani, R. (2004) · The Annals of Statistics · doi:10.1214/009053604000000067 · Cited by 9,357
Horn, R. A., & Johnson, C. R. (1991) · Cambridge University Press eBooks · doi:10.1017/cbo9780511840371 · Cited by 9,319
Matching pursuits with time-frequency dictionaries
Mallat, S. G., & Zhang, Z. (1993) · IEEE Transactions on Signal Processing · doi:10.1109/78.258082 · Cited by 9,112
Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Sturm, J. F. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805766 · Cited by 7,377
Decoding by Linear Programming
Candes, E. J., & Tao, T. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.858979 · Cited by 7,121
Stable signal recovery from incomplete and inaccurate measurements
Candès, E. J., Romberg, J. K., & Tao, T. (2006) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20124 · Cited by 7,036
Atomic Decomposition by Basis Pursuit
Chen, S. S., Donoho, D. L., & Saunders, M. A. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827596304010 · Cited by 6,845
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
Pati, Y. C., Rezaiifar, R., & Krishnaprasad, P. S. (2002) · Proceedings of 27th Asilomar Conference on Signals, Systems and Computers · doi:10.1109/acssc.1993.342465 · Cited by 4,323
Vandenberghe, L., & Boyd, S. (1996) · SIAM Review · doi:10.1137/1038003 · Cited by 4,105
Constrained Optimization and Lagrange Multiplier Methods
(1982) · Elsevier eBooks · doi:10.1016/c2013-0-10366-2 · Cited by 4,016
The Approximation of One Matrix by Another of Lower Rank
Eckart, C., & Young, G. (1936) · Psychometrika · doi:10.1007/bf02288367 · Cited by 3,800
Sparse Approximate Solutions to Linear Systems
Natarajan, B. K. (1995) · SIAM Journal on Computing · doi:10.1137/s0097539792240406 · Cited by 2,783
A Simple Proof of the Restricted Isometry Property for Random Matrices
Baraniuk, R., Davenport, M., DeVore, R., & Wakin, M. (2008) · Constructive Approximation · doi:10.1007/s00365-007-9003-x · Cited by 2,372
Friedman, J. H., & Stuetzle, W. (1981) · Journal of the American Statistical Association · doi:10.1080/01621459.1981.10477729 · Cited by 2,216
Sparsity and incoherence in compressive sampling
Candès, E., & Romberg, J. (2007) · Inverse Problems · doi:10.1088/0266-5611/23/3/008 · Cited by 2,075
A cone complementarity linearization algorithm for static output-feedback and related problems
El Ghaoui, L., Oustry, F., & AitRami, M. (1997) · IEEE Transactions on Automatic Control · doi:10.1109/9.618250 · Cited by 2,027
Faraut, J., & Korányi, A. (1994) · doi:10.1093/oso/9780198534778.001.0001 · Cited by 1,656
Orthogonal least squares methods and their application to non-linear system identification
Chen, S., Billings, S. A., & Luo, W. (1989) · International Journal of Control · doi:10.1080/00207178908953472 · Cited by 1,540
Database-friendly random projections: Johnson-Lindenstrauss with binary coins
Achlioptas, D. (2003) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(03)00025-4 · Cited by 1,392
Problem complexity and method efficiency in optimization
(1984) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(84)90101-0 · Cited by 1,329
Exact Reconstruction of Sparse Signals via Nonconvex Minimization
Chartrand, R. (2007) · IEEE Signal Processing Letters · doi:10.1109/lsp.2007.898300 · Cited by 1,277
Sontag, E. D. (1998) · Texts in Applied Mathematics · doi:10.1007/978-1-4612-0577-7 · Cited by 1,226
Mirror descent and nonlinear projected subgradient methods for convex optimization
Beck, A., & Teboulle, M. (2003) · Operations Research Letters · doi:10.1016/s0167-6377(02)00231-6 · Cited by 1,060
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-citationThe geometry of graphs and some of its algorithmic applications
Linial, N., London, E., & Rabinovich, Y. (1995) · Combinatorica · doi:10.1007/bf01200757 · Cited by 952
Fast maximum margin matrix factorization for collaborative prediction
Rennie, J. D. M., & Srebro, N. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102441 · Cited by 939
An elementary proof of a theorem of Johnson and Lindenstrauss
Dasgupta, S., & Gupta, A. (2003) · Random Structures & Algorithms · doi:10.1002/rsa.10073 · Cited by 932
A Unified Algebraic Approach To Control Design
Grigoriadis, D. E. (2017) · Routledge eBooks · doi:10.1201/9781315136523 · Cited by 932
A new approach to variable selection in least squares problems
Osborne, M. (2000) · IMA Journal of Numerical Analysis · doi:10.1093/imanum/20.3.389 · Cited by 859
Robust Modeling With Erratic Data
Claerbout, J. F., & Muir, F. (1973) · Geophysics · doi:10.1190/1.1440378 · Cited by 833
Handbook of Semidefinite Programming
(2000) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4615-4381-7 · Cited by 781
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
Burer, S., & Monteiro, R. D. C. (2003) · Mathematical Programming · doi:10.1007/s10107-002-0352-8 · Cited by 770
SYMMETRIC GAUGE FUNCTIONS AND UNITARILY INVARIANT NORMS
MIRSKY, L. (1960) · The Quarterly Journal of Mathematics · doi:10.1093/qmath/11.1.50 · Cited by 611
Sparse nonnegative solution of underdetermined linear equations by linear programming
Donoho, D. L., & Tanner, J. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0502269102 · Cited by 577
Fazel, M., Hindi, H., & Boyd, S. P. (2004) · Proceedings of the 2003 American Control Conference, 2003. · doi:10.1109/acc.2003.1243393 · Cited by 574
Self-citationInterior-Point Method for Nuclear Norm Approximation with Application to System Identification
Liu, Z., & Vandenberghe, L. (2010) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/090755436 · Cited by 490
Schoenberg, I. J. (1935) · The Annals of Mathematics · doi:10.2307/1968654 · Cited by 453
Deconvolution with the l 1 norm
Taylor, H. L., Banks, S. C., & McCoy, J. F. (1979) · Geophysics · doi:10.1190/1.1440921 · Cited by 436
Local Operator Theory, Random Matrices and Banach Spaces
(2001) · Handbook of the Geometry of Banach Spaces · doi:10.1016/s1874-5849(01)80010-3 · Cited by 432
Characterization of the subdifferential of some matrix norms
Watson, G. A. (1992) · Linear Algebra and its Applications · doi:10.1016/0024-3795(92)90407-2 · Cited by 364
Adaptive time-frequency decompositions
Mallat, S. G. (1994) · Optical Engineering · doi:10.1117/12.173207 · Cited by 358
Portfolio optimization with linear and fixed transaction costs
Lobo, M. S., Fazel, M., & Boyd, S. (2007) · Annals of Operations Research · doi:10.1007/s10479-006-0145-1 · Cited by 350
Self-citationLocal Minima and Convergence in Low-Rank Semidefinite Programming
Burer, S., & Monteiro, R. D. C. (2005) · Mathematical Programming · doi:10.1007/s10107-004-0564-1 · Cited by 347
On the limit of the largest eigenvalue of the large dimensional sample covariance matrix
Yin, Y. Q., Bai, Z. D., & Krishnaiah, P. R. (1988) · Probability Theory and Related Fields · doi:10.1007/bf00353874 · Cited by 341
An Architecture for Compressive Imaging
Wakin, M. B., Laska, J. N., Duarte, M. F., Baron, D., Sarvotham, S., Takhar, D., Kelly, K. F., & Baraniuk, R. G. (2006) · 2006 International Conference on Image Processing · doi:10.1109/icip.2006.312577 · Cited by 323
Singular Value Decomposition (SVD) Image Coding
Andrews, H., & Patterson, C. (1976) · IEEE Transactions on Communications · doi:10.1109/tcom.1976.1093309 · Cited by 304
Learning with matrix factorizations
Srebro, N., & Jaakkola, T. (2004) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 276
Structured low-rank approximation and its applications
Markovsky, I. (2008) · Automatica · doi:10.1016/j.automatica.2007.09.011 · Cited by 254
Signal representation using adaptive normalized Gaussian functions
Qian, S., & Chen, D. (1994) · Signal Processing · doi:10.1016/0165-1684(94)90174-0 · Cited by 248
Euclidean Jordan Algebras and Interior-point Algorithms
Faybusovich, L. (1997) · Positivity · doi:10.1023/a:1009701824047 · Cited by 204
A Newton-like method for solving rank constrained linear matrix inequalities
Orsi, R., Helmke, U., & Moore, J. B. (2006) · Automatica · doi:10.1016/j.automatica.2006.05.026 · Cited by 194
On the rank minimization problem over a positive semidefinite linear matrix inequality
Mesbahi, M., & Papavassilopoulos, G. P. (1997) · IEEE Transactions on Automatic Control · doi:10.1109/9.554402 · Cited by 187
SDPT3 — a Matlab software package for semidefinite-quadratic-linear programming, version 3.0
Tütüncü, R. H., Toh, K.-C., & Todd, M. J. (2001) · Cited by 168
Algorithms for the Polar Decomposition
Gander, W. (1990) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0911062 · Cited by 51
Optimal wire and transistor sizing for circuits with non-tree topology
Vandenberghe, L., Boyd, S., & Gamal, A. E. (1997) · doi:10.5555/266388.266485 · Cited by 27
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
Exact Matrix Completion via Convex Optimization
Candès, E. J., & Recht, B. (2009) · Foundations of Computational Mathematics · doi:10.1007/s10208-009-9045-5 · Cited by 4,877
Self-citationHalko, N., Martinsson, P. G., & Tropp, J. A. (2011) · SIAM Review · doi:10.1137/090771806 · Cited by 4,002
Sparse Subspace Clustering: Algorithm, Theory, and Applications
Elhamifar, E., & Vidal, R. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.57 · Cited by 3,106
Kuybeda, O., Frank, G. A., Bartesaghi, A., Borgnia, M., Subramaniam, S., & Sapiro, G. (2013) · Journal of Structural Biology · doi:10.1016/j.jsb.2012.10.010 · Cited by 2,162
Metadata
- Authors
- Recht, B., Fazel, M., & Parrilo, P. A.
- Venue
- SIAM Review
- Published
- 2010-01
- Volume
- 52
- Issue
- 3
- Pages
- 471-501
- ISSN
- 0036-1445 (ISSN-L)
- 1095-7200
- OpenAlex
- W2118550318
- Cited by
- 3,471
- References
- 66
- FWCI
- 184.44
- Type
- journal article
- Language
- en
- Open access
- green
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.