Skip navigation
Skip navigation

The Geometry of Weighted Low-Rank Approximations

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]

CollectionsANU Research Publications
Date published: 2003
Type: Journal article
Source: IEEE Transactions on Signal Processing
DOI: 10.1109/TSP.2002.807002


File Description SizeFormat Image
01_Manton_The_Geometry_of_Weighted_2003.pdf945.32 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator