Existence of a low rank or ℋ-matrix approximant to the solution of a Sylvester equation.
Lars GrasedyckPublished in: Numer. Linear Algebra Appl. (2004)
Keyphrases
- low rank
- singular value decomposition
- missing data
- convex optimization
- linear combination
- low rank matrix
- matrix completion
- matrix decomposition
- trace norm
- rank minimization
- matrix factorization
- high dimensional data
- singular values
- kernel matrix
- robust principal component analysis
- frobenius norm
- high order
- low rank matrices
- semi supervised
- data matrix
- factorization methods
- norm minimization
- affinity matrix
- low rank approximation
- kernel matrices
- image segmentation
- binary matrix
- pattern recognition
- nuclear norm
- binary matrices
- least squares
- low rank and sparse