EUVIMEDEUVIMED entdecken
Crossref

An extension of fast iterative shrinkage‐thresholding algorithm to Riemannian optimization for sparse principal component analysis

Wen Huang, Ke Wei

Numerical Linear Algebra with Applications · 2022-01 · 29 (1)

DOI: 10.1002/nla.2409 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Numerical Linear Algebra with Applications, online erschienen am 09.09.2021. Verfasst von Wen Huang und 1 weiteren Autor:innen. Die Arbeit wurde bisher 17-mal zitiert (Crossref) und nennt 44 Literaturangaben. Gefördert von: National Natural Science Foundation of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Sparse principal component analysis (PCA), an important variant of PCA, attempts to find sparse loading vectors when conducting dimension reduction. This paper considers the nonsmooth Riemannian optimization problem associated with the ScoTLASS model for sparse PCA which can impose orthogonality and sparsity simultaneously. A Riemannian proximal method is proposed in the work of Chen et al. for the efficient solution of this optimization problem. In this paper, two acceleration schemes are introduced. First and foremost, we extend the FISTA method from the Euclidean space to the Riemannian manifold to solve sparse PCA, leading to the accelerated Riemannian proximal gradient method. Since the Riemannian optimization problem for sparse PCA is essentially nonconvex, a restarting technique is adopted to stabilize the accelerated method without sacrificing the fast convergence. Second, a diagonal preconditioner is proposed for the Riemannian proximal subproblem which can further accelerate the convergence of the Riemannian proximal methods. Numerical evaluations establish the computational advantages of the proposed methods over the existing proximal gradient methods on a manifold. Additionally, a short result concerning the convergence of the Riemannian subgradients of a sequence is established, which, together with the result in the work of Chen et al., can show the stationary point convergence of the Riemannian proximal methods.

Förderung

  • National Natural Science Foundation of China

Zitieren

APA

Huang, W., & Wei, K. (2022). An extension of fast iterative shrinkage‐thresholding algorithm to Riemannian optimization for sparse principal component analysis. Numerical Linear Algebra with Applications, 29(1). https://doi.org/10.1002/nla.2409

Vancouver

Huang W, Wei K. An extension of fast iterative shrinkage‐thresholding algorithm to Riemannian optimization for sparse principal component analysis. Numerical Linear Algebra with Applications. 2022;29(1). doi:10.1002/nla.2409

BibTeX
@article{Huang2022,
  author = {Huang, Wen and Wei, Ke},
  title = {An extension of fast iterative shrinkage‐thresholding algorithm to Riemannian optimization for sparse principal component analysis},
  journal = {Numerical Linear Algebra with Applications},
  year = {2022},
  volume = {29},
  number = {1},
  doi = {10.1002/nla.2409}
}
Kostenlos starten →