Robust recovery of low-rank matrices with non-orthogonal sparse decomposition from incomplete measurements
Authors:
- Massimo FornasierMFMassimo Fornasier
- Johannes MalyJMJohannes Maly
- Valeriya NaumovaVNValeriya Naumova
- 1 March 2021
- journal article
- research article
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 392
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Deutsche Forschungsgemeinschaft
This publication has 27 references indexed in Scilit:
- Suprema of Chaos Processes and the Restricted Isometry PropertyCommunications on Pure and Applied Mathematics, 2014
- One‐Bit Compressed Sensing by Linear ProgrammingCommunications on Pure and Applied Mathematics, 2013
- Global error bounds for piecewise convex polynomialsMathematical Programming, 2011
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz InequalityMathematics of Operations Research, 2010
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm MinimizationSIAM Review, 2010
- Iterative hard thresholding for compressed sensingApplied and Computational Harmonic Analysis, 2009
- Exact Matrix Completion via Convex OptimizationFoundations of Computational Mathematics, 2009
- Sparse Principal Component AnalysisJournal of Computational and Graphical Statistics, 2006
- Risk Reduction in Large Portfolios: Why Imposing the Wrong Constraints HelpsThe Journal of Finance, 2003
- Self-Recovering Equalization and Carrier Tracking in Two-Dimensional Data Communication SystemsIEEE Transactions on Communications, 1980