A Branch and Bound Algorithm for Low Rank Multiplicative Nonconvex Minimization Problem.
Tingsong DuPusheng FeiJigui JianPublished in: ICNC (6) (2009)
Keyphrases
- branch and bound algorithm
- low rank
- convex optimization
- minimization problems
- low rank matrices
- robust principal component analysis
- lower bound
- norm minimization
- objective function
- branch and bound
- low rank matrix recovery
- optimal solution
- matrix completion
- low rank matrix
- np hard
- matrix factorization
- linear combination
- missing data
- upper bound
- rank minimization
- singular value decomposition
- mixed integer linear programming
- low rank and sparse
- high dimensional data
- semi supervised
- total variation
- combinatorial optimization
- high order
- convex functions
- search algorithm
- primal dual
- data sets
- regularization term
- image restoration
- pairwise
- update rule
- singular values
- trace norm
- optimization problems
- search space
- neural network
- low dimensional