Sequential convex relaxation for convex optimization with bilinear matrix equalities.
Reinier DoelmanMichel VerhaegenPublished in: ECC (2016)
Keyphrases
- convex optimization
- convex relaxation
- low rank
- semidefinite
- matrix completion
- singular value decomposition
- low rank matrix
- convex formulation
- interior point methods
- total variation
- trace norm
- primal dual
- semi definite programming
- singular values
- image denoising
- kernel matrix
- image processing
- multi task
- labeled data
- data points
- active learning