The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
On $l_q$ Optimization and Matrix Completion
Abstract
Rank minimization problems, which consist of finding a matrix of minimum rank subject to linear constraints, have been proposed in many areas of engineering and science. A specific problem is the matrix completion problem in which a low rank data matrix can be recovered from incomplete samples of its entries by solving a rank penalized least squares problem. The rank penalty is in fact thel0“norm” of the matrix singular values. A recent convex relaxation of this penalty is the commonly usedl1norm of the matrix singular values. In this paper, we bridge the gap between these two penalties and propose thelq, 0ql0,l1, andlq, 0q<; 1.
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
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
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
Cited by
A Generalized Iterated Shrinkage Algorithm for Non-convex Sparse Coding
Zuo, W., Meng, D., Zhang, L., Feng, X., & Zhang, D. (2013) · 2013 IEEE International Conference on Computer Vision · doi:10.1109/iccv.2013.34 · Cited by 396
Tulyakov, S., Alameda-Pineda, X., Ricci, E., Yin, L., Cohn, J. F., & Sebe, N. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.263 · Cited by 340
Bilinear Generalized Approximate Message Passing—Part I: Derivation
Parker, J. T., Schniter, P., & Cevher, V. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2357776 · Cited by 281
Metadata
- Authors
- Marjanovic, G., & Solo, V.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2012-11
- Volume
- 60
- Issue
- 11
- Pages
- 5714-5724
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W1966661320
- Cited by
- 194
- References
- 2
- FWCI
- 9.53
- 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: On $l_q$ Optimization and Matrix Completion. https://app.cochat.ai/papers/10.1109/tsp.2012.2212015
- The paper
- Marjanovic, G., & Solo, V. (2012). On $l_q$ Optimization and Matrix Completion. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2012.2212015
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.