Finding low-rank solutions to smooth convex problems via the Burer-Monteiro approach.
Dohyung ParkAnastasios KyrillidisConstantine CaramanisSujay SanghaviPublished in: Allerton (2016)
Keyphrases
- low rank
- convex optimization
- matrix completion
- minimization problems
- linear combination
- convex relaxation
- missing data
- convex programming
- nuclear norm
- convex optimization problems
- low rank matrix
- interior point methods
- high dimensional data
- multi label
- kernel matrix
- trace norm
- robust principal component analysis
- non rigid structure from motion
- data sets
- globally optimal
- matrix factorization
- singular value decomposition
- optimal solution
- image processing