Abstract :
[en] In this paper, we discuss methods to refine locally optimal solutions of
sparse PCA. Starting from a local solution obtained by existing algorithms, these
methods take advantage of convex relaxations of the sparse PCA problem to propose
a refined solution that is still locally optimal but with a higher objective value.
Scopus citations®
without self-citations
0