A note on the complexity of L p minimization
The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
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
Cites
(1979) · Cited by 43,841
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Fan, J., & Li, R. (2001) · Journal of the American Statistical Association · doi:10.1198/016214501753382273 · Cited by 8,900
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
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
Candes, E. J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.885507 · Cited by 6,839
Interior-Point Polynomial Algorithms in Convex Programming
Nesterov, Y., & Nemirovskii, A. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970791 · Cited by 4,334
Greed is Good: Algorithmic Results for Sparse Approximation
Tropp, J. A. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.834793 · Cited by 3,635
(2011) · SpringerReference · doi:10.1007/springerreference_57547 · Cited by 3,190
Sparse Approximate Solutions to Linear Systems
Natarajan, B. K. (1995) · SIAM Journal on Computing · doi:10.1137/s0097539792240406 · Cited by 2,783
Introduction to linear optimization
Bertsimas, D., & Tsitsiklis, J. N. (1997) · Cited by 2,705
Weik, M. H. (2000) · Computer Science and Communications Dictionary · doi:10.1007/1-4020-0613-6_12436 · Cited by 2,570
Donoho, D. L. (2006) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20132 · Cited by 2,490
Iterative hard thresholding for compressed sensing
Blumensath, T., & Davies, M. E. (2009) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2009.04.002 · Cited by 2,275
From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
Bruckstein, A. M., Donoho, D. L., & Elad, M. (2009) · SIAM Review · doi:10.1137/060657704 · Cited by 2,183
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 1×
“Hence, problem L 0 minimization can be relaxed to problem (2) with p = 1. However, this property may be too strong for practical basis design matrices A. Instead, one may consider the sparse recovery problem by solving relaxation problem (1 )o r (2 )f or a fixed p with 0 9 ,10,13,17].”
BackgroundComputational Methods for Sparse Solution of Linear Inverse Problems
Tropp, J. A., & Wright, S. J. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2044010 · Cited by 1,046
Interior Point Algorithms: Theory and Analysis
Ye, Y. (1997) · Wiley eBooks · doi:10.1002/9781118032701 · Cited by 939
Self-citationVazirani, V. V. (2003) · Springer eBooks · doi:10.1007/978-3-662-04565-7 · Cited by 716
An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
Ye, Y., Todd, M. J., & Mizuno, S. (1994) · Mathematics of Operations Research · doi:10.1287/moor.19.1.53 · Cited by 354
Self-citationFast algorithms for nonconvex compressive sensing: MRI reconstruction from very few data
Chartrand, R. (2009) · 2009 IEEE International Symposium on Biomedical Imaging: From Nano to Macro · doi:10.1109/isbi.2009.5193034 · Cited by 312
Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
Chen, X., Xu, F., & Ye, Y. (2010) · SIAM Journal on Scientific Computing · doi:10.1137/090761471 · Cited by 288
Self-citationApproximation of functions over redundant dictionaries using coherence
Gilbert, A. C., Muthukrishnan, S., & Strauss, M. J. (2003) · doi:10.5555/644108.644149 · Cited by 183
Computational Methods for Sparse Solution of Linear Inverse Problems
Tropp, J. A., & Wright, S. J. (2009) · Defense Technical Information Center (DTIC) · doi:10.21236/ada633835 · Cited by 145
Minimizing Nonconvex Functions for Sparse Vector Reconstruction
Mourad, N., & Reilly, J. P. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2010.2046900 · Cited by 54
On the complexity of approximating a KKT point of quadratic programming
Ye, Y. (1998) · Mathematical Programming · doi:10.1007/bf01581726 · Cited by 53
Self-citation
Cited by
Hoefler, T., Alistarh, D., Ben-Nun, T., Dryden, N., & Peste, A. (2021) · ETH Zurich · doi:10.3929/ethz-b-000519202 · Cited by 423
Smoothing methods for nonsmooth, nonconvex minimization
Chen, X. (2012) · Mathematical Programming · doi:10.1007/s10107-012-0569-0 · Cited by 295
Implicit Bias of Gradient Descent on Linear Convolutional Networks
Gunasekar, S., Lee, J., Soudry, D., & Srebro, N. (2018) · arXiv · doi:10.48550/arxiv.1806.00468 · Cited by 75
Smoothed -Minimization for Green Cloud-RAN With User Admission Control
Shi, Y., Cheng, J., Zhang, J., Bai, B., Chen, W., & Letaief, K. B. (2016) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2016.2544578 · Cited by 70
Metadata
- Authors
- Ge, D., Jiang, X., & Ye, Y.
- Venue
- Mathematical Programming
- Published
- 2011-06-05
- Volume
- 129
- Issue
- 2
- Pages
- 285-299
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2093347109
- Cited by
- 254
- References
- 25
- FWCI
- 18.71
- 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
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.