Robust sensing of low-rank matrices with non-orthogonal sparse decomposition
Author:
- 20 June 2023
- journal article
- research article
- Published by Elsevier in Applied and Computational Harmonic Analysis
- Vol. 67, 101569
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Deutsche Forschungsgemeinschaft
This publication has 26 references indexed in Scilit:
- Proximal alternating linearized minimization for nonconvex and nonsmooth problemsMathematical Programming, 2013
- One‐Bit Compressed Sensing by Linear ProgrammingCommunications on Pure and Applied Mathematics, 2013
- Global error bounds for piecewise convex polynomialsMathematical Programming, 2011
- 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
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical SystemsSIAM Journal on Optimization, 2007
- Sparse Principal Component AnalysisJournal of Computational and Graphical Statistics, 2006
- Regularization and Variable Selection Via the Elastic NetJournal of the Royal Statistical Society Series B: Statistical Methodology, 2005
- On gradients of functions definable in o-minimal structuresAnnales de l'institut Fourier, 1998
- The phase retrieval problemInverse Problems, 1995