A Continuous Technique for the Weighted Low-Rank Approximation Problem

N/ACitations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper concerns with the problem of approximating a target matrix with a matrix of lower rank with respect to a weighted norm. Weighted norms can arise in several situations: when some of the entries of the matrix are not observed or need not to be treated equally. A gradient flow approach for solving weighted low rank approximation problems is provided. This approach allows the treatment of both real and complex matrices and exploits some important features of the approximation matrix that optimization techniques do not use. Finally, some numerical examples are provided. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Del Buono, N., & Politi, T. (2004). A Continuous Technique for the Weighted Low-Rank Approximation Problem. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3044, 988–997. https://doi.org/10.1007/978-3-540-24709-8_104

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free