Optimization and Engineering Управление и оптимизация

Optimality conditions for penalized sparse PCA

Rosember Guerra-Urzola, Juan C. Vera, Katrijn Van Deun
Springer Nature · 2025-09-19 · DOI 10.1007/s11081-025-10021-0

Аннотация

Abstract This paper establishes the theoretical foundations of an alternating optimization scheme for penalized sparse principal component analysis (PCA) focusing on variance maximization. We provide a theoretical foundation for the optimality of solutions derived from this widely used algorithm, addressing a gap in the current literature where empirical results often lack theoretical support. We show the algorithm’s success when the dataset’s covariance matrix is positive definite. Additionally, we characterize sparsity-inducing penalties and examine the use of various ones, including the $$ \ell _1$$ ℓ 1 -norm, SCAD, and $$\ell _0$$ ℓ 0 -norm. We conduct numerical experiments to evaluate standard metrics, such as explained variance, number of iterations, and computational time.

Читать у издателя →