All Questions
1 question
5
votes
1
answer
315
views
Rank-constrained least-squares solution of the Sylvester matrix equation
For the Sylvester matrix equation $AX+XB=C$, I want to find the least-squares solution $X$ via
$$\begin{array}{ll} \text{minimize} & \| AX + XB - C \|_{\text{F}}^2\\ \text{subject to} & \mbox{...
- 191