[17] Rick Chartrand. Exact reconstruction of sparse signals via nonconvex minimization. IEEE Signal Processing Letters, 14(10):707-710, 2007.
[18] Rick Chartrand and Wotao Yin. Iteratively reweighted algorithms for compressive sensing. In IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pages 3869-3872, 2008.
[19] Avishek Chatterjee and Venu Madhav Govindu. Robust relative rotation averaging. IEEE Transactions on Pattern Analysis and Machine Intelligence, 40(4):958-972, 2017.
[20] Chen Chen, Lei He, Hongsheng Li, and Junzhou Huang. Fast iteratively reweighted least squares algorithms for analysis-based sparse reconstruction. Medical Image Analysis, 49:141-152, 2018.
[21] Chen Chen, Junzhou Huang, Lei He, and Hongsheng Li. Preconditioning for accelerated iteratively reweighted least squares in structured sparsity reconstruction. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2014), pages 2713-2720, 2014.
[22] Lisha Chen and Jianhua Z Huang. Sparse reduced-rank regression for simultaneous dimension reduction and variable selection. Journal of the American Statistical Association, 107(500):1533-1545, 2012.
[23] Wei Chen. Simultaneously sparse and low-rank matrix reconstruction via nonconvex and nonseparable regularization. IEEE Transactions on Signal Processing, 66(20):5313-5323, 2018.
[24] Yuxin Chen and Yuejie Chi. Robust spectral compressed sensing via structured matrix completion. IEEE Transactions on Information Theory, 60(10):6576-6601, 2014.
[25] Alexandre d'Aspremont, Laurent E Ghaoui, Michael I Jordan, and Gert R Lanckriet. A direct formulation for sparse PCA using semidefinite programming. In Advances in Neural Information Processing Systems (NIPS 2005), pages 41-48, 2005.
[26] I. Daubechies, R. DeVore, M. Fornasier, and C.S. Güntürk. Iteratively reweighted least squares minimization for sparse recovery. Commun. Pure Appl. Math., 63:1-38, 2010.
[27] Achiya Dax. On extremum properties of orthogonal quotients matrices. Linear Algebra and its Applications, 432(5):1234-1257, 2010.
[28] David L. Donoho. Compressed sensing. IEEE Transactions on Information Theory, 52(4):1289-1306, 2006.
[29] Henrik Eisenmann, Felix Krahmer, Max Pfeffer, and André Uschmajew. Riemannian thresholding methods for row-sparse and low-rank matrix recovery. Numerical Algorithms, pages 1-25, 2022.
[30] Michael Elad and Michal Aharon. Image denoising via sparse and redundant representations over learned dictionaries. IEEE Transactions on Image Processing, 15(12):3736-3745, 2006.
[31] Maryam Fazel, Haitham Hindi, and Stephen P. Boyd. Log-det heuristic for matrix rank minimization with applications to Hankel and euclidean distance matrices. In Proceedings of the 2003 American Control Conference, volume 3, pages 2156-2162. IEEE, 2003.
[32] William Fedus, Barret Zoph, and Noam Shazeer. Switch transformers: Scaling to trillion parameter models with simple and efficient sparsity. The Journal of Machine Learning Research, 23(1):5232-5270, 2022.
[33] Massimo Fornasier, Johannes Maly, and Valeriya Naumova. Robust recovery of low-rank matrices with non-orthogonal sparse decomposition from incomplete measurements. Applied Mathematics and Computation, 392, 2021.
[34] Massimo Fornasier, Steffen Peter, Holger Rauhut, and Stephan Worm. Conjugate gradient acceleration of iteratively re-weighted least squares methods. Comput. Optim. Appl., 65(1):205-259, 2016.