Title
On a transformation of the ∗-congruence Sylvester equation for the least squares optimization.
Abstract
The star-congruence Sylvester equation is the matrix equation AX + (XB)-B-star = C, where A is an element of F-mxm, B is an element of F-nxm and C is an element of F-mxm are given, whereas X is an element of F-nxm is to be determined. Here, F = R or C, and star = T (transposed) or (*) (conjugate transposed). Very recently, Satake et al. showed that under some conditions, the matrix equation for the case star = T is equivalent to the generalized Sylvester equation. In this paper, we demonstrate that the result can be extended to the case star = (*). Through this extension, the least squares solution of the (*)-congruence Sylvester equation may be obtained using well-researched results on the least squares solution of the generalized Sylvester equation.
Year
DOI
Venue
2020
10.1080/10556788.2020.1734004
OPTIMIZATION METHODS & SOFTWARE
Keywords
DocType
Volume
The star-congruence Sylvester equation,the T-congruence Sylvester equation,the (*)-congruence Sylvester equation
Journal
35
Issue
ISSN
Citations 
SP5
1055-6788
0
PageRank 
References 
Authors
0.34
0
4
Name
Order
Citations
PageRank
Yuki Satake100.34
Tomohiro Sogabe215420.86
Tomoya Kemmochi300.34
Shao-Liang Zhang49219.06