Lower bounds for the low-rank matrix approximation

DOI10.1186/s13660-017-1564-zzbMath1375.15024OpenAlexW2768684093WikidataQ47096498 ScholiaQ47096498MaRDI QIDQ1681803

Guo Li, Zisheng Liu, Ji-Cheng Li

Publication date: 24 November 2017

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/s13660-017-1564-z

zbMATH Keywords

error estimationapproximationpseudo-inversematrix normslow-rank matrix

Mathematics Subject Classification ID

Factorization of matrices (15A23) Convex programming (90C25) Approximation methods and heuristics in mathematical programming (90C59) Perturbations of ordinary differential equations (34D10) Approximation algorithms (68W25)

Related Items (1)

A separable surrogate function method for sparse and low-rank matrices decomposition

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On perturbation bounds for orthogonal projections
• Latent semantic indexing: A probabilistic analysis
• Principal component analysis.
• The geometry of graphs and some of its algorithmic applications
• Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
• Robust principal component analysis?
• A Singular Value Thresholding Algorithm for Matrix Completion
• On the rank minimization problem over a positive semidefinite linear matrix inequality
• A NEW MODEL FOR SPARSE AND LOW-RANK MATRIX DECOMPOSITION
• Perturbation theory for pseudo-inverses

This page was built for publication: Lower bounds for the low-rank matrix approximation