S. Bahmani and J. Romberg, Near-optimal estimation of simultaneously sparse and low-rank matrices from nested linear measurements. Information and Inference: A, Journal of the IMA, vol.5, pp.331-351, 2016.

T. Blumensath, Sampling and reconstructing signals from a union of linear subspaces, IEEE Transactions on Information Theory, vol.57, pp.4660-4671, 2011.

T. Cai and A. Zhang, ROP: Matrix recovery via rank-one projections, The Annals of Statistics, vol.43, pp.102-138, 2015.

E. J. Candès and Y. Plan, Tight oracle inequalities for low-rank matrix recovery from a minimal number of noisy random measurements, IEEE Transactions on Information Theory, vol.57, pp.2342-2359, 2011.

E. J. Candès, T. Strohmer, and V. Voroninski, Phaselift: exact and stable signal recovery from magnitude measurements via convex programming, Communications on Pure and Applied Mathematics, vol.66, pp.1241-1274, 2013.

R. Devore, P. Guergana, and P. Wojtaszczyk, Approximation of functions of few variables in high dimensions, Constructive Approximation, vol.33, pp.125-143, 2011.

M. Fornasier, J. Maly, and V. Naumova, Sparse PCA from inaccurate and incomplete measurements, 2018.

S. Foucart, Sampling Schemes and Recovery Algorithms for Functions of Few Coordinate Variables, 2019.

S. Foucart and M. Lai, Sparse recovery with pre-Gaussian random matrices, Studia Math, vol.200, pp.91-102, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00767062

S. Foucart and G. Lecué, An IHT algorithm for sparse recovery from sub-exponential measurements, IEEE Signal Processing Letters, vol.24, pp.1280-1283, 2017.

S. Foucart and H. Rauhut, A Mathematical Introduction to Compressive Sensing. Applied and Numerical Harmonic Analysis, 2013.

S. Foucart and S. Subramanian, Iterative hard thresholding for low-rank recovery from rank-one projections, Linear Algebra and its Applications, vol.572, pp.117-134, 2019.

J. Geppert, F. Krahmer, and D. Stöger, Sparse power factorization: balancing peakiness and sample complexity, Advances in Computational Mathematics, vol.45, pp.1711-1728, 2019.

M. Golbabaee and M. E. Davies, Inexact gradient projection and fast data driven compressed sensing, IEEE Transactions on Information Theory, vol.64, pp.6707-6721, 2018.

C. Hegde, P. Indyk, and L. Schmidt, Approximation algorithms for model-based compressive sensing, IEEE Transactions on Information Theory, vol.61, pp.5129-5147, 2015.

M. Iwen, A. Viswanathan, and Y. Wang, Robust sparse phase retrieval made easy, Applied and Computational Harmonic Analysis, vol.42, pp.135-142, 2017.

M. Kabanava, R. Kueng, H. Rauhut, and U. Terstiege, Stable low-rank matrix recovery via null space properties, Information and Inference, vol.5, pp.405-441, 2016.

R. Kueng, H. Rauhut, and U. Terstiege, Low rank matrix recovery from rank one measurements, Applied and Computational Harmonic Analysis, vol.42, pp.88-116, 2017.

K. Lee, Y. Wu, and Y. Bresler, Near-optimal compressed sensing of a class of sparse low-rank matrices via sparse power factorization, IEEE Transactions on Information Theory, vol.64, pp.1666-1698, 2017.

M. Magdon-ismail, NP-hardness and inapproximability of sparse PCA, Information Processing Letters, vol.126, pp.35-38, 2017.

P. Manurangsi, Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph, STOC'17-Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pp.954-961, 2017.

S. Oymak, A. Jalali, M. Fazel, Y. C. Eldar, and B. Hassibi, Simultaneously structured models with application to sparse and low-rank matrices, IEEE Transactions on Information Theory, vol.61, pp.2886-2908, 2015.

H. Rauhut, R. Schneider, and Z. Stojanac, Low rank tensor recovery via iterative hard thresholding, Linear Algebra and Its Applications, vol.523, pp.220-262, 2018.

I. Roth, M. Kliesch, G. Wunder, and J. Eisert, Reliable recovery of hierarchically sparse signals and application in machine-type communications, 2016.

I. Roth, A. Flinth, R. Kueng, J. Eisert, and G. Wunder, Hierarchical restricted isometry property for Kronecker product measurements, 56th Annual Allerton Conference on Communication, Control, and Computing, pp.632-638, 2018.

J. Shen and P. Li, A tight bound of hard thresholding, 2016.