Column Subset Selection, Matrix Factorization, and Eigenvalue Optimization
From MaRDI portal
Publication:4633911
zbMath1425.65061arXiv0806.4404MaRDI QIDQ4633911
Publication date: 6 May 2019
Full work available at URL: https://arxiv.org/abs/0806.4404
Analysis of algorithms (68W40) Factorization of matrices (15A23) Semidefinite programming (90C22) Eigenvalues, singular values, and eigenvectors (15A18) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Numerical computation of matrix norms, conditioning, scaling (65F35) Randomized algorithms (68W20)
Related Items
Optimal column subset selection for image classification by genetic algorithms, On greedy randomized average block Kaczmarz method for solving large linear systems, Tensor CUR Decomposition under T-Product and Its Perturbation, Optimal and algorithmic norm regularization of random matrices, Improved bounds on sample size for implicit matrix trace estimators, Block Kaczmarz method with inequalities, Solving sparse principal component analysis with global support, Model order reduction with oblique projections for large scale wave propagation, Unnamed Item, Unnamed Item, Restricted Invertibility Revisited, Quantum Query Algorithms are Completely Bounded Forms., Quantum Query Algorithms Are Completely Bounded Forms, Extracting a basis with fixed block inside a matrix, Randomized block Kaczmarz method with projection for solving least squares, Faster Randomized Block Kaczmarz Algorithms, On maximum residual block and two-step Gauss-Seidel algorithms for linear least-squares problems, Perspectives on CUR decompositions, Robust CUR Decomposition: Theory and Imaging Applications
