Iterative methods to solve the constrained Sylvester equation

In this paper, the multiple constraint least squares solution of the Sylvester equation $ AX+XB = C $ is discussed. The necessary and sufficient conditions for the existence of solutions to the considered matrix equation are given. Noting that the alternating direction method of multipliers (ADMM) i...

Full description

Saved in:
Bibliographic Details
Published inAIMS mathematics Vol. 8; no. 9; pp. 21531 - 21553
Main Authors Yu, Siting, Peng, Jingjing, Tang, Zengao, Peng, Zhenyun
Format Journal Article
LanguageEnglish
Published AIMS Press 01.01.2023
Subjects
anderson acceleration algorithm
fixed point iteration algorithm
nonlinear matrix equation
thompson distance
Online AccessGet full text
ISSN2473-6988
2473-6988
DOI10.3934/math.20231097

Cover

More Information
Summary:In this paper, the multiple constraint least squares solution of the Sylvester equation $ AX+XB = C $ is discussed. The necessary and sufficient conditions for the existence of solutions to the considered matrix equation are given. Noting that the alternating direction method of multipliers (ADMM) is a one-step iterative method, a multi-step alternating direction method of multipliers (MSADMM) to solve the considered matrix equation is proposed and some convergence results of the proposed algorithm are proved. Problems that should be studied in the near future are listed. Numerical comparisons between MSADMM, ADMM and ADMM with Anderson acceleration (ACADMM) are included.
ISSN:2473-6988
2473-6988
DOI:10.3934/math.20231097