1. Allen, G.I.: Sparse higher-order principal components analysis. In: International Conference on Machine Learning, pp. 27–36 (2012)
2. Bertsimas, D., Cory-Wright, R., Pauphilet, J.: Solving large-scale sparse PCA to certifiable (near) optimality. J. Mach. Learn. Res. 23(13), 1–35 (2022)
3. Chan, S.O., Papailliopoulos, D., Rubinstein, A.: On the approximability of sparse PCA. In: Conference on Learning Theory, pp. 623–646 (2016)
4. d’Aspremont, A., El Ghaoui, L., Jordan, M.I., Lanckriet, G.R.G.: A direct formulation for sparse PCA using semidefinite programming. SIAM Rev. 49(3), 434–448 (2007)
5. De Lathauwer, L., De Moor, B., Vandewalle, J.: On the best rank-$$1$$ and rank-($${R}_1,{R}_2,\ldots,{R}_n$$) approximation of higer-order tensors. SIAM J. Matrix Anal. Appl. 21, 1324–1342 (2000)