Matrix Reordering for Noisy Disordered Matrices: Optimality and Computationally Efficient Algorithms.
T. Tony CaiRong MaPublished in: IEEE Trans. Inf. Theory (2024)
Keyphrases
- singular value decomposition
- coefficient matrix
- singular values
- matrix representation
- positive definite
- square matrices
- perturbation theory
- eigenvalues and eigenvectors
- projection matrices
- linear algebra
- rows and columns
- positive semidefinite
- projection matrix
- sparse matrix
- linear complementarity problem
- matrix multiplication
- block diagonal
- data matrix
- systems of linear equations
- pseudo inverse
- distance matrix
- symmetric positive definite
- eigendecomposition
- low rank and sparse
- matrix completion
- correlation matrix
- symmetric matrices
- low rank
- optimal solution
- noisy data
- totally unimodular
- missing data
- affinity matrix
- binary matrices
- low rank matrix
- low rank approximation
- noisy environments
- semidefinite programming
- measurement matrix
- sparse matrices
- low rank matrix approximation
- factorization method
- symmetric matrix
- similarity matrix
- kernel methods
- covariance matrix
- kernel function