Manton, Jonathan; Mahony, Robert; Hua, Yingbo
The low-rank approximation problem is to approximate optimally, with respect to some norm, a matrix by one of the same dimension but smaller rank. It is known that under the Frobenius norm, the best low-rank approximation can be found by using the singular value decomposition (SVD). Although this is no longer true under weighted norms in general, it is demonstrated here that the weighted low-rank approximation problem can be solved by finding the subspace that minimizes a particular cost...[Show more]
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.