Sparse Sylvester Equation Via Alternating Direction Method of Multipliers
Numerous solutions have been investigated or ap-plied for both the Sylvester equation and the sparse Sylvester equation. In this paper, we employ the alternating direction method of multipliers (ADMM) to solve the sparse Sylvester equation, while imposing the <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$l_{0}$</tex> norm to the original Sylvester equation formulation. We analyze the iteration scheme for updating each variable and present a corresponding algorithm by extending the classical ADMM. Additionally, several numerical experiments are conducted to validate its feasibility and efficiency.
Authors
- Lijun Xu (ORCID: https://orcid.org/0000-0002-5823-1122)
- Yijia Zhou (ORCID: https://orcid.org/0000-0002-5633-7564)
- Xueqian Wang (ORCID: https://orcid.org/0000-0003-0013-3930)
Institutions
- Dalian Neusoft University of Information (CN)
- Dalian Maritime University (CN)
Publication Details
- Published
- 2024-10-18
- DOI
- https://doi.org/10.1109/ntci64025.2024.10776225
- Citations
- 1
- Primary Topic
- Matrix Theory and Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.36
Funders
- China Postdoctoral Science Foundation
- Fundamental Research Funds for the Central Universities