$\ell _{0}$ Factor Analysis: A P-Stationary Point Theory

Factor analysis is a widely used modeling technique for stationary time series, which achieves dimensionality reduction by revealing a hidden low-rank plus sparse structure of the covariance matrix. Such an idea of parsimonious modeling has also been important in the field of systems and control. In this article, a nonconvex nonsmooth optimization problem involving the <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\ell _{0}$</tex-math></inline-formula> norm is constructed in order to achieve the low-rank and sparse additive decomposition of the sample covariance matrix. We establish the existence of an optimal solution and characterize these solutions via the concept of proximal stationary points. Furthermore, an ADMM algorithm is designed to solve the <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\ell _{0}$</tex-math></inline-formula> optimization problem, and a subsequence convergence result is proved under reasonable assumptions. Finally, numerical experiments demonstrate the effectiveness of our method in comparison with some alternatives in the literature.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Automatic Control
Published
2025-03-19
DOI
https://doi.org/10.1109/tac.2025.3552869
Citations
1
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
1.50
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

$\ell _{0}$ Factor Analysis: A P-Stationary Point Theory

Bin Zhu, Wanquan Liu, Linyang Wang
1 citations
IEEE Transactions on Automatic Control
Matrix Theory and Algorithms
1.50
article

$\ell _{0}$ Factor Analysis: A P-Stationary Point Theory

Bin Zhu, Wanquan Liu, Linyang Wang
article en
1 citations

Abstract

Factor analysis is a widely used modeling technique for stationary time series, which achieves dimensionality reduction by revealing a hidden low-rank plus sparse structure of the covariance matrix. Such an idea of parsimonious modeling has also been important in the field of systems and control. In this article, a nonconvex nonsmooth optimization problem involving the <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\ell _{0}$</tex-math></inline-formula> norm is constructed in order to achieve the low-rank and sparse additive decomposition of the sample covariance matrix. We establish the existence of an optimal solution and characterize these solutions via the concept of proximal stationary points. Furthermore, an ADMM algorithm is designed to solve the <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\ell _{0}$</tex-math></inline-formula> optimization problem, and a subsequence convergence result is proved under reasonable assumptions. Finally, numerical experiments demonstrate the effectiveness of our method in comparison with some alternatives in the literature.

IEEE Transactions on Automatic ControlVol. 70(9)
Sun Yat-sen University (CN)
Openalex Percentile: Top 19%
Matrix Theory and Algorithms
1.50
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.