Left vs, right representations for solving weighted low-rank approximation problems
The weighted low-rank approximation problem in general has no analytical solution in terms of the singular value decomposition and is solved numerically using optimization methods. The paper presents four representations of the rank constraint that turn the abstract problem formulation into a parameter optimization problem. The parameter optimization problem is partially solved analytically, which results in an equivalent quadratically constrained problem.
scientific article; zbMATH DE number 5141633
scientific article