The Convex Geometry of Linear Inverse Problems
Top Cited Papers
- 16 October 2012
- journal article
- Published by Springer Science and Business Media LLC in Foundations of Computational Mathematics
- Vol. 12 (6), 805-849
- https://doi.org/10.1007/s10208-012-9135-7
Abstract
No abstract availableKeywords
Other Versions
This publication has 56 references indexed in Scilit:
- Null space conditions and thresholds for rank minimizationMathematical Programming, 2010
- Exact Matrix Completion via Convex OptimizationFoundations of Computational Mathematics, 2009
- On the conditions used to prove oracle results for the LassoElectronic Journal of Statistics, 2009
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solutionCommunications on Pure and Applied Mathematics, 2006
- High-Dimensional Centrally Symmetric Polytopes with Neighborliness Proportional to DimensionDiscrete & Computational Geometry, 2005
- Decoding by Linear ProgrammingIEEE Transactions on Information Theory, 2005
- Tensorial extensions of independent component analysis for multisubject FMRI analysisNeuroImage, 2005
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraintCommunications on Pure and Applied Mathematics, 2004
- An EM algorithm for wavelet-based image restorationIEEE Transactions on Image Processing, 2003
- Semidefinite programming relaxations for semialgebraic problemsMathematical Programming, 2003