The DOI matches its Crossref record.
Matrix completion via an alternating direction method
Abstract
The matrix completion problem is to complete an unknown matrix from a small number of entries, and it captures many applications in diversified areas. Recently, it was shown that completing a low-rank matrix can be successfully accomplished by solving its convex relaxation problem using the nuclear norm. This paper shows that the alternating direction method (ADM) is applicable for completing a low-rank matrix including the noiseless case, the noisy case and the positive semidefinite case. The ADM approach for the matrix completion problem is easily implementable and very efficient. Numerical comparisons of the ADM approach with some state-of-the-art methods are reported.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cited by
Low-rank matrix completion using alternating minimization
Jain, P., Netrapalli, P., & Sanghavi, S. (2013) · Proceedings of the forty-fifth annual ACM symposium on Theory of Computing · doi:10.1145/2488608.2488693 · Cited by 817
Non-convex Optimization for Machine Learning
Jain, P., & Kar, P. (2017) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000058 · Cited by 364
Global Convergence of Splitting Methods for Nonconvex Composite Optimization
Li, G., & Pong, T. K. (2015) · SIAM Journal on Optimization · doi:10.1137/140998135 · Cited by 315
Matrix Completion and Low-Rank SVD via Fast Alternating Least Squares
Hastie, T. J., Mazumder, R., Lee, J. D., & Zadeh, R. B. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1410.2596 · Cited by 291
Smooth PARAFAC Decomposition for Tensor Completion
Yokota, T., Zhao, Q., & Cichocki, A. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2586759 · Cited by 279
Metadata
- Authors
- Chen, C., He, B., & Yuan, X.
- Venue
- IMA Journal of Numerical Analysis
- Publisher
- Oxford University Press (OUP)
- Published
- 2011-06-09
- Volume
- 32
- Issue
- 1
- Pages
- 227-245
- ISSN
- 0272-4979 (ISSN-L)
- 1464-3642
- OpenAlex
- W2059958128
- Cited by
- 188
- References
- 0
- FWCI
- 11.61
- 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: Matrix completion via an alternating direction method. https://app.cochat.ai/papers/10.1093/imanum/drq039
- The paper
- Chen, C., He, B., & Yuan, X. (2012). Matrix completion via an alternating direction method. IMA Journal of Numerical Analysis. https://doi.org/10.1093/imanum/drq039
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.