Low-rank matrix approximation in the infinity norm
From MaRDI portal
Publication:2273885
DOI10.1016/j.laa.2019.07.017zbMath1423.15015arXiv1706.00078OpenAlexW2621015885WikidataQ114152299 ScholiaQ114152299MaRDI QIDQ2273885
Nicolas Gillis, Yaroslav N. Shitov
Publication date: 18 September 2019
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1706.00078
Analysis of algorithms and problem complexity (68Q25) Factorization of matrices (15A23) Abstract computational complexity for mathematical programming problems (90C60) Complexity of computation (including implicit computational complexity) (03D15)
Related Items (6)
On the optimal rank-1 approximation of matrices in the Chebyshev norm ⋮ On the distance to low-rank matrices in the maximum norm ⋮ Interval matrices: realization of ranks by rational matrices ⋮ On the rank-one approximation of positive matrices using tropical optimization methods ⋮ Generalization of real interval matrices to other fields ⋮ Why Are Big Data Matrices Approximately Low Rank?
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quasioptimality of skeleton approximation of a matrix in the Chebyshev norm
- Independent component analysis, a new concept?
- Checking robust nonsingularity is NP-hard
- Coordinate descent algorithms
- Generalized Low Rank Models
- On Low Rank Matrix Approximations with Applications to Synthesis Problem in Compressed Sensing
- Low-Rank Matrix Approximation with Weights or Missing Data Is NP-Hard
- Towards a Genuinely Polynomial Algorithm for Linear Programming
- Lower Rank Approximation of Matrices by Least Squares with Any Choice of Weights
- On Tensors, Sparsity, and Nonnegative Factorizations
- Low rank approximation with entrywise l 1 -norm error
- Reducibility among Combinatorial Problems
- On the Complexity of Robust PCA and ℓ1-Norm Low-Rank Matrix Approximation
- Learning the parts of objects by non-negative matrix factorization
- A Direct Formulation for Sparse PCA Using Semidefinite Programming
This page was built for publication: Low-rank matrix approximation in the infinity norm
