Fixed point and Bregman iterative methods for matrix rank minimization.
Shiqian MaDonald GoldfarbLifeng ChenPublished in: Math. Program. (2011)
Keyphrases
- fixed point
- rank minimization
- iterative methods
- low rank
- computationally expensive
- affinity matrix
- constrained optimization
- matrix completion
- iterative algorithms
- sufficient conditions
- dynamical systems
- belief propagation
- singular values
- variational inequalities
- linear combination
- missing data
- neural model
- higher order
- matrix factorization
- total variation
- convex optimization
- singular value decomposition
- high order
- kernel matrix
- learning algorithm
- policy iteration
- image restoration
- graphical models
- semi supervised
- probabilistic model