ℓ₁-Norm Regularized ℓ₁-Norm Best-Fit Lines

References

• Alon N, Naor A (2006) Approximating the cut-norm via Grothendieck’s inequality. SIAM J. Comput. 35(4):787–803.Google Scholar
• Brooks JP, Dulá JH (2019) Approximating L1-norm best-fit lines. Preprint, submitted January 9, https://optimization-online.org/?p=15611.Google Scholar
• Brooks JP, Dulá JH, Boone EL (2013) A pure L1-norm principal component analysis. Comput. Statist. Data Anal. (Oxford) 61:83–98.Google Scholar
• Brooks JP, Dulá JH, Pakyz AL, Polk RE (2017) Identifying hospital antimicrobial resistance targets via robust ranking. IISE Trans. Healthcare Systems Engrg. 7(3):121–128.Google Scholar
• Candès E, Li X, Ma Y, Wright J (2011) Robust principal component analysis? J. ACM 58(3):1–37.Google Scholar
• Chierichetti F, Gollapudi S, Kumar R, Lattanzi S, Panigrahy R, Woodruff DP (2017) Algorithms for ℓp low-rank approximation. Precup D, Teh YW, eds. Proc. 34th Internat. Conf. Machine Learn., vol. 70 (PMLR, Brookline, MA), 806–814.Google Scholar
• Croux C, Filzmoser P, Fritz H (2013) Robust sparse principal component analysis. Technometrics 55(2):202–214.Google Scholar
• d’Aspremont A, Ghaoui L, Jordan M, Lanckriet G (2007) A direct formulation for sparse PCA using semidefinite programming. SIAM Rev. 49(3):434–448.Google Scholar
• Fan J, Ding L, Chen Y, Udell M (2019) Factor group-sparse regularization for efficient low-rank matrix recovery. Adv. Neural Inform. Processing Systems, vol. 32 (Curran Associates Inc., Red Hook, NY).Google Scholar
• Gillis N, Vavasis SA (2018) On the complexity of robust PCA and ℓ1-norm low-rank matrix approximation. Math. Oper. Res. 43(4):1072–1084.Link, Google Scholar
• Gurobi Optimization, LLC (2024) Concurrent optimization. Accessed May 13, 2026, https://docs.gurobi.com/projects/optimizer/en/current/features/concurrent.html.Google Scholar
• Hubert M, Rousseeuw PJ, Vanden Branden K (2005) ROBPCA: A new approach to robust principal component analysis. Technometrics 47(1):64–79.Google Scholar
• Hubert M, Reynkens T, Schmitt E, Verdonck T (2016) Sparse PCA for high-dimensional data with outliers. Technometrics 58(4):424–434.Google Scholar
• Jolliffe IT, Trendafilov NT, Uddin M (2003) A modified principal component technique based on the lasso. J. Comput. Graphic Statist. 12(3):531–547.Google Scholar
• Jot S, Brooks JP, Visentin A, Park YW (2025) pcaL1: L1-norm PCA methods. R package version 1.5.9. Accessed May 13, 2026, Comprehensive R Archive Network (CRAN), https://CRAN.R-project.org/package=pcaL1.Google Scholar
• Kaloorazi MF, de Lamare RC (2018) Compressed randomized UTV decompositions for low-rank matrix approximations. IEEE J. Selected Topics Signal Processing 12(6):1155–1169.Google Scholar
• Kang Z, Peng C, Cheng Q (2015) Robust PCA via nonconvex rank approximation. Proc. IEEE Internat. Conf. Data Mining (IEEE, Atlantic City, NJ), 211–220.Google Scholar
• Ke Q, Kanade T (2005) Robust l1-norm factorization in the presence of outliers and missing data by alternative convex programming. Proc. IEEE Comput. Soc. Conf. Comput. Vision Pattern Recognition, vol. 1 (IEEE, Piscataway, NJ), 739–746.Google Scholar
• Kundu S, Markopoulos PP, Pados DA (2014) Fast computation of the l 1-principal component of real-valued data. Proc. IEEE Internat. Conf. Acoustics Speech Signal Processing (IEEE, Piscataway, NJ), 8028–8032.Google Scholar
• Kwak N (2008) Principal component analysis based on L1-norm maximization. IEEE Trans. Pattern Anal. Machine Intelligence 30(9):1672–1680.Google Scholar
• Lerman G, Maunu T (2018) An overview of robust subspace recovery. Proc. IEEE 106(8):1380–1410.Google Scholar
• Lin Z, Chen M, Ma Y (2010) The augmented Lagrange multiplier method for exact recovery of corrupted low-rank matrices. Preprint, submitted September 26, https://arxiv.org/abs/1009.5055.Google Scholar
• Ling X (2024) L1-norm regularized L1-norm best-fit lines. Accessed May 13, 2026, https://github.com/lingxpca/sparsel1_cuda.git.Google Scholar
• Ling X, Alexander GS, Molitoris J, Choi J, Schumaker L, Mehra R, Gaykalova DA, et al. (2023) Identification of CT-based non-invasive radiomic biomarkers for overall survival prediction in oral cavity squamous cell carcinoma. Sci. Rep. 13(1):21774.Google Scholar
• Ling X, Alexander GS, Molitoris J, Choi J, Schumaker L, Tran P, Mehra R, et al. (2024) Radiomic biomarkers of locoregional recurrence: Prognostic insights from oral cavity squamous cell carcinoma preoperative CT scans. Frontiers Oncology 14.Google Scholar
• Ling X, Bazyar S, Ferris M, Molitoris J, Allor E, Thomas H, Arons D, et al. (2025) Identification of CT based radiomic biomarkers for progression free survival in head and neck squamous cell carcinoma. Sci. Rep. 15(1):1279.Google Scholar
• Markopoulos PP, Karystinos GN, Pados DA (2014) Optimal algorithms for L1-subspace signal processing. IEEE Trans. Signal Processing 62(19):5046–5058.Google Scholar
• Meng D, Zhao Q, Xu Z (2012) Improve robustness of sparse PCA by L1-norm maximization. Pattern Recognition 45(1):487–497.Google Scholar
• Peng C, Kang Z, Cheng Q (2016) A fast factorization-based approach to robust PCA. Proc. IEEE 16th Internat. Conf. Data Mining (IEEE, Piscataway, NJ), 1137–1142.Google Scholar
• Peterson J, Garges S, Giovanni M, McInnes P, Wang L, Schloss JA, Bonazzi V, et al. (2009) The NIH human microbiome project. Genome Res. 19(12):2317–2323.Google Scholar
• Shen H, Huang JZ (2008) Sparse principal component analysis via regularized low rank matrix approximation. J. Multivariate Anal. 99(6):1015–1034.Google Scholar
• Song Z, Woodruff DP, Zhong PL (2017) Low rank approximation with entrywise ℓ1-norm error. Proc. Ann. ACM Sympos. Theory Comput.Google Scholar
• Tan-Torres AL Jr, Brooks JP, Singh B, Seashols-Williams S (2021) Machine learning clustering and classification of human microbiome source body sites. Forensic Sci. Internat. 328:111008.Google Scholar
• Tang G, Nehorai A (2011) Robust principal component analysis based on low-rank and block-sparse matrix decomposition. Proc. 45th Ann. Conf. Inform Sci. Systems (IEEE, Piscataway, NJ), 1–5.Google Scholar
• Tao M, Yuan X (2011) Recovering low-rank and sparse components of matrices from incomplete and noisy observations. SIAM J. Optim. 21(1):57–81.Google Scholar
• Tsagkarakis N, Markopoulos PP, Pados DA (2017) On the L1-norm approximation of a matrix by another of lower rank. Proc. 15th IEEE Internat. Conf. Machine Learn. Appl. (IEEE, Piscataway, NJ), 768–773.Google Scholar
• Wang ZY, Li XP, So HC, Liu Z (2023) Robust PCA via non-convex half-quadratic regularization. Signal Processing 204:108816.Google Scholar
• Xu H, Caramanis C, Mannor S (2012a) Outlier-robust PCA: The high-dimensional case. IEEE Trans. Inform. Theory 59(1):546–572.Google Scholar
• Xu H, Caramanis C, Sanghavi S (2012b) Robust PCA via outlier pursuit. IEEE Trans. Inform. Theory 58(5):3047–3064.Google Scholar
• Yan Y, Tan M, Tsang IW, Yang Y, Shi Q, Zhang C (2018) Fast and low memory cost matrix factorization: Algorithm, analysis, and case study. IEEE Trans. Knowledge Data Engrg. 32(2):288–301.Google Scholar
• Zhao Q, Meng D, Xu Z (2014) Robust sparse principal component analysis. Sci. China Inform. Sci. 57(9):1–14.Google Scholar
• Zou H, Hastie T, Tibshirani R (2006) Sparse principal component analysis. J. Comput. Graphics Statist. 15(2):265–286.Google Scholar