Concentration of the Frobenius Norm of Generalized Matrix Inverses
From MaRDI portal
Publication:4615303
DOI10.1137/17M1145409zbMath1407.15005arXiv1810.07921OpenAlexW2897477974WikidataQ128560612 ScholiaQ128560612MaRDI QIDQ4615303
Publication date: 4 February 2019
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.07921
random matricesFrobenius normconvex analysisconcentration bound\(\ell^p\) minimizationsparse pseudoinverse
Theory of matrix inversion and generalized inverses (15A09) Random matrices (algebraic aspects) (15B52)
Related Items
Trading off \(1\)-norm and sparsity against rank for linear models using mathematical optimization: \(1\)-norm minimizing partially reflexive ah-symmetric generalized inverses, Theory of functional connections applied to quadratic and nonlinear programming under equality constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Sparsity and spectral properties of dual frames
- Sparse dual frames and dual Gabor functions of minimal time and frequency supports
- On general minimax theorems
- Some inequalities for Gaussian processes and applications
- Designing Gabor windows using convex optimization
- Invertibility of random matrices: norm of the inverse
- Convex Graph Invariants
- On sparse reconstruction from Fourier and Gaussian measurements
- Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing
- Precise Error Analysis of Regularized <inline-formula> <tex-math notation="LaTeX">$M$ </tex-math> </inline-formula>-Estimators in High Dimensions
- Sparse Approximate Solutions to Linear Systems
- Living on the edge: phase transitions in convex programs with random data
- Universality laws for randomized dimension reduction, with applications
- Optimally Sparse Frames
- Corrupted Sensing: Novel Guarantees for Separating Structured Signals
- Invertibility of symmetric random matrices
- Compressed sensing
- Adaptive greedy approximations
