Efficient Solution of Constrained Least Squares Problems with Kronecker Product Structure
Anders Barrlund · SIAM Journal on Matrix Analysis and Applications · 1998
A computational method for efficient solution of linear constrained least squares problems with Kronecker product structure is presented. The equality constraints are assumed to be linearly independent. The computational efficiency of the method is analyzed. Conditions for uniqueness of solutions are given.