For low-rank Frobenius-norm approximations of matrices with non-negative entries, it is shown that the Lagrange dual is computable by semi-definite programming. Under certain assumptions the duality gap is zero. Even when the duality gap is non-zero, several new insights are provided.
['Christian Grussler', 'Anders Rantzer']
On optimal low-rank approximation of non-negative matrices