The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
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
(2021) · A First Course in Statistical Programming with R · doi:10.1017/9781108993456.011 · Cited by 13,724
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Beck, A., & Teboulle, M. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080716542 · Cited by 11,952
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
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
Guaranteed 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
Shape and motion from image streams under orthography: a factorization method
Tomasi, C., & Kanade, T. (1992) · International Journal of Computer Vision · doi:10.1007/bf00129684 · Cited by 2,878
An Algorithmic Framework for Performing Collaborative Filtering
Herlocker, J. L., Konstan, J. A., Borchers, A., & Riedl, J. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130372 · Cited by 2,512
The 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
An algorithmic framework for performing collaborative filtering
Herlocker, J. L., Konstan, J. A., Borchers, A., & Riedl, J. (1999) · Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/312624.312682 · Cited by 2,011
Cited by
Low-Rank Matrix Completion by Riemannian Optimization
Vandereycken, B. (2013) · SIAM Journal on Optimization · doi:10.1137/110845768 · Cited by 491
Efficient Tensor Completion for Color Image and Video Recovery: Low-Rank Tensor Train
Bengua, J. A., Phien, H. N., Tuan, H. D., & Do, M. N. (2017) · IEEE Transactions on Image Processing · doi:10.1109/tip.2017.2672439 · Cited by 461
Detecting False Data Injection Attacks on Power Grid by Sparse Optimization
Liu, L., Esmalifalak, M., Ding, Q., Emesih, V. A., & Han, Z. (2014) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2013.2284438 · Cited by 446
Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
Lai, M.-J., Xu, Y., & Yin, W. (2013) · SIAM Journal on Numerical Analysis · doi:10.1137/110840364 · Cited by 385
Self-citationAn alternating direction algorithm for matrix completion with nonnegative factors
Xu, Y., Yin, W., Wen, Z., & Zhang, Y. (2012) · Frontiers of Mathematics in China · doi:10.1007/s11464-012-0194-5 · Cited by 339
Self-citation
Metadata
- Authors
- Wen, Z., Yin, W., & Zhang, Y.
- Venue
- Mathematical Programming Computation
- Published
- 2012-07-13
- Volume
- 4
- Issue
- 4
- Pages
- 333-361
- ISSN
- 1867-2949 (ISSN-L)
- 1867-2957
- OpenAlex
- W2060204507
- Cited by
- 774
- References
- 32
- FWCI
- 54.01
- 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: Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm. https://app.cochat.ai/papers/10.1007/s12532-012-0044-1
- The paper
- Wen, Z., Yin, W., & Zhang, Y. (2012). Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm. Mathematical Programming Computation. https://doi.org/10.1007/s12532-012-0044-1
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.