Modified interior-point method for large-and-sparse low-rank semidefinite programs.
Richard Y. ZhangJavad LavaeiPublished in: CDC (2017)
Keyphrases
- interior point methods
- semidefinite
- low rank
- convex optimization
- kernel matrix
- semidefinite programming
- convex relaxation
- primal dual
- total variation
- high dimensional
- high order
- linear program
- singular value decomposition
- convex sets
- linear combination
- missing data
- linear programming
- sparse representation
- image processing
- matrix factorization
- solving problems
- natural images
- quadratic programming
- denoising
- special case