[53] Christian Kümmerle. Understanding and Enhancing Data Recovery Algorithms: From Noise-Blind Sparse Recovery to Reweighted Methods for Low-Rank Matrix Optimization. Dissertation, Technical University of Munich, 2019. Available at https://mediatum.ulub.tum.de/doc/1521436/1521436.pdf.
[54] Christian Kümmerle and Claudio Mayrink Verdun. A scalable second order method for ill-conditioned matrix completion from few samples. In International Conference on Machine Learning (ICML 2021), 2021.
[55] Christian Kümmerle, Claudio Mayrink Verdun, and Dominik Stöger. Iteratively reweighted least squares for basis pursuit with global linear convergence rate. Advances in Neural Information Processing Systems (NeurIPS 2021), 2021.
[56] Christian Kümmerle and Juliane Sigl. Harmonic mean iteratively reweighted least squares for low-rank matrix recovery. The Journal of Machine Learning Research, 19(1):1815-1863, 2018.
[57] Ming-Jun Lai, Yangyang Xu, and Wotao Yin. Improved iteratively reweighted least squares for unconstrained smoothed  $\ell_q$ -minimization. SIAM Journal on Numerical Analysis, 51(2):927-957, 2013.
[58] Kenneth Lange. MM optimization algorithms. SIAM, 2016.
[59] Kiryung Lee, Yanjun Li, Marius Junge, and Yoram Bresler. Blind recovery of sparse signals from subsampled convolution. IEEE Transactions on Information Theory, 63(2):802-821, 2016.
[60] Kiryung Lee, Yihong Wu, and Yoram Bresler. Near-optimal compressed sensing of a class of sparse low-rank matrices via sparse power factorization. IEEE Transactions on Information Theory, 64(3):1666-1698, 2018.
[61] Seong Hun Lee and Javier Civera. Hara: A hierarchical approach for robust rotation averaging. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR 2022), pages 15777-15786, 2022.
[62] Stamatios Lefkimmiatis and Iaroslav Sergeevich Koshelev. Learning sparse and low-rank priors for image recovery via iterative reweighted least squares minimization. In The Eleventh International Conference on Learning Representations, 2023.
[63] Adrian S. Lewis and Hristo S. Sendov. Nonsmooth Analysis of Singular Values. Part I: Theory. Set-Valued Analysis, 13(3):213–241, 2005.
[64] Xiaodong Li, Shuyang Ling, Thomas Strohmer, and Ke Wei. Rapid, robust, and reliable blind deconvolution via nonconvex optimization. Applied and Computational Harmonic Analysis, 47(3):893-934, 2019.
[65] He Lyu and Rongrong Wang. An exact sin  $\theta$  formula for matrix perturbation analysis and its applications. arXiv preprint arXiv:2011.07669, 2020.
[66] C Ma, K Wang, Y Chi, and Yuxin Chen. Implicit regularization in nonconvex statistical estimation: Gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution. Foundations of Computational Mathematics, 2020.
[67] Malik Magdon-Ismail. Np-hardness and inapproximability of sparse pca. Information Processing Letters, 126:35-38, 2017.
[68] Julien Mairal, Francis Bach, Jean Ponce, et al. Sparse modeling for image and vision processing. Foundations and Trends® in Computer Graphics and Vision, 8(2-3):85-283, 2014.
[69] Johannes Maly. Robust sensing of low-rank matrices with non-orthogonal sparse decomposition. Applied and Computational Harmonic Analysis, 2023.
[70] Karthik Mohan and Maryam Fazel. Iterative reweighted algorithms for matrix rank minimization. J. Mach. Learn. Res., 13(1):3441-3473, 2012.