We are interested in the numerical solution of the matrix least squares problem \(\begin{aligned} \min _{X\in \mathbb {R}^{m\times m}} \Vert AXB+CXD-F\Vert _\mathcal{F} , \end{aligned}\) with A and C full column rank, B and D full row rank, F an \(n\times n\) matrix of low rank, and \(\Vert \cdot \Vert _\mathcal{F}\) the Frobenius norm. We derive a matrix-oriented implementation of LSQR, and devise an implementation of the truncation step that exploits the properties of the method. Experimental comparisons with the Conjugate Gradient method applied to the normal matrix equation and with a (new) sketched implementation of matrix LSQR illustrate the competitiveness of the proposed algorithm. We also explore the applicability of our method in the context of Kronecker-based Dictionary Learning, and devise a representation of the data that seems to be promising for classification purposes.
