Solving a class of low rank d.c. programs via a branch and bound approach: A computational experience.
Riccardo CambiniFrancesca SalviPublished in: Oper. Res. Lett. (2010)
Keyphrases
- branch and bound
- low rank
- branch and bound procedure
- combinatorial optimization
- integer programming problems
- lower bound
- branch and bound algorithm
- search algorithm
- convex optimization
- matrix factorization
- branch and bound search
- search space
- optimal solution
- missing data
- column generation
- upper bound
- convex optimization problems
- linear combination
- matrix completion
- rank minimization
- bnb adopt
- singular value decomposition
- semi supervised
- low rank matrix
- cutting plane
- high order
- network design problem
- metaheuristic
- tree search
- data sets
- image processing
- simulated annealing
- singular values
- max sat
- high dimensional data
- optimization problems
- collaborative filtering
- integer program
- face recognition
- linear programming