Hypercomplex Low Rank Matrix Completion with Non-negative Constraints via Convex Optimization.
Takehiko MizoguchiIsao YamadaPublished in: ICASSP (2019)
Keyphrases
- low rank
- convex optimization
- matrix completion
- interior point methods
- rank minimization
- low rank matrix
- norm minimization
- norm regularization
- kernel matrix
- convex relaxation
- alternating direction method of multipliers
- singular values
- primal dual
- minimization problems
- trace norm
- total variation
- semidefinite programming
- matrix factorization
- nuclear norm
- linear combination
- denoising
- least squares
- data sets