[86] Ying Sun, Prabhu Babu, and Daniel P Palomar. Majorization-minimization algorithms in signal processing, communications, and machine learning. IEEE Transactions on Signal Processing, 65(3):794-816, 2016.
[87] Yue Sun, Samet Oymak, and Maryam Fazel. Finite sample system identification: Optimal rates and the role of regularization. In Proceedings of the 2nd Conference on Learning for Dynamics and Control, volume 120, pages 16-25. PMLR, 10-11 Jun 2020.
[88] Andrei Nikolajevits Tikhonov. Solution of incorrectly formulated problems and the regularization method. Soviet Math., 4:1035-1038, 1963.
[89] Christos G Tsinos, Athanasios A Rontogiannis, and Kostas Berberidis. Distributed blind hyperspectral unmixing via joint sparsity and low-rank constrained non-negative matrix factorization. IEEE Transactions on Computational Imaging, 3(2):160-174, 2017.
[90] B. Vandereycken. Low-Rank Matrix Completion by Riemannian Optimization. SIAM J. Optim., 23(2), 2013.
[91] Mukund Varma T, Xuxi Chen, Zhenyu Zhang, Tianlong Chen, Subhashini Venugopalan, and Zhangyang Wang. Sparse winning tickets are data-efficient image recognizers. Advances in Neural Information Processing Systems (NeurIPS 2022), 35:4652-4666, 2022.
[92] Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, Lukasz Kaiser, and Illia Polosukhin. Attention is all you need. Advances in Neural Information Processing Systems (NeurIPS 2017), 30, 2017.
[93] Curtis R Vogel. Computational methods for inverse problems. SIAM, 2002.
[94] Sinong Wang, Belinda Z Li, Madian Khabsa, Han Fang, and Hao Ma. Linformer: Self-attention with linear complexity. arXiv preprint arXiv:2006.04768, 2020.
[95] Endre Weiszfeld. Sur le point pour lequel la somme des distances de n points donnés est minimum. Tohoku Mathematical Journal, First Series, 43:355-386, 1937.
[96] Wei Wen, Cong Xu, Chunpeng Wu, Yandan Wang, Yiran Chen, and Hai Li. Coordinating filters for faster deep neural networks. In Proceedings of the IEEE International Conference on Computer Vision (CVPR 2017), pages 658-666, 2017.
[97] Max A. Woodbury. Inverting modified matrices. Memorandum report, 42(106):336, 1950.
[98] Quanming Yao, James Tin-Yau Kwok, and Bo Han. Efficient nonconvex regularized tensor completion with structure-aware proximal iterations. In International Conference on Machine Learning (ICML 2019), pages 7035-7044. PMLR, 2019.
[99] Jong Chul Ye, Yoseob Han, and Eunju Cha. Deep convolutional framelets: A general deep learning framework for inverse problems. SIAM Journal on Imaging Sciences, 11(2):991-1048, 2018.
[100] Ming Yu, Varun Gupta, and Mladen Kolar. Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach. Electronic Journal of Statistics, 14:413-457, 2020.
[101] Zeinab Zeinalkhani and Amir H Banihashemi. Iterative reweighted  $\ell_2 / \ell_1$  recovery algorithms for compressed sensing of block sparse signals. IEEE Transactions on Signal Processing, 63(17):4516-4531, 2015.
[102] Yanbin Zhang, Long-Ting Huang, Yangqing Li, Kai Zhang, and Changchuan Yin. Low-rank and sparse matrix recovery for hyperspectral image reconstruction using bayesian learning. Sensors, 22(1):343, 2022.
[103] Zhenyue Zhang, Zheng Zhai, and Limin Li. Graph refinement via simultaneously low-rank and sparse approximation. SIAM Journal on Scientific Computing, 44(3):A1525-A1553, 2022.
[104] Hui Zou, Trevor Hastie, and Robert Tibshirani. Sparse principal component analysis. Journal of Computational and Graphical Statistics, 15(2):265-286, 2006.