On the distance to low-rank matrices in the maximum norm

DOI10.1016/j.laa.2024.02.012arXiv2312.12905MaRDI QIDQ6204176

Stanislav S. Budzinskiy

Publication date: 27 March 2024

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2312.12905

zbMATH Keywords

alternating projectionslow-rank approximationmaximum normJohnson-Lindenstrauss lemmaHanson-Wright inequality

Mathematics Subject Classification ID

Norms (inequalities, more than one norm, etc.) of linear operators (47A30) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Miscellaneous inequalities involving matrices (15A45)

Cites Work

• Unnamed Item
• Unnamed Item
• Sharp nonasymptotic bounds on the norm of random matrices with independent entries
• Hanson-Wright inequality and sub-Gaussian concentration
• Pseudo-skeleton approximations with better accuracy estimates
• Maxima of entries of Haar distributed matrices
• On the best approximation algorithm by low-rank matrices in Chebyshev's norm
• Low-rank matrix approximation in the infinity norm
• Exact matrix completion via convex optimization
• SYMMETRIC GAUGE FUNCTIONS AND UNITARILY INVARIANT NORMS
• Extensions of Lipschitz mappings into a Hilbert space
• An elementary proof of a theorem of Johnson and Lindenstrauss
• Why Are Big Data Matrices Approximately Low Rank?
• The approximate rank of a matrix and its algorithmic applications
• A Bound on Tail Probabilities for Quadratic Forms in Independent Random Variables
• On the optimal rank-1 approximation of matrices in the Chebyshev norm

This page was built for publication: On the distance to low-rank matrices in the maximum norm