Cutting Planes for Low-Rank-Like Concave Minimization Problems.
Marcus PorembskiPublished in: Oper. Res. (2004)
Keyphrases
- minimization problems
- cutting plane
- low rank
- linear combination
- matrix factorization
- column generation
- integer programming
- lower bound
- missing data
- convex optimization
- singular value decomposition
- mixed integer
- matrix completion
- low rank matrix
- objective function
- semi supervised
- high order
- integer program
- high dimensional data
- kernel matrix
- knapsack problem
- linear programming
- higher order
- active learning
- optimal solution
- learning algorithm