An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set.
Vineet GoyalR. RaviPublished in: Oper. Res. Lett. (2013)
Keyphrases
- convex functions
- convex sets
- low rank
- convex optimization
- matrix completion
- matrix factorization
- primal dual
- low rank matrix
- finite number
- discrete sets
- interior point methods
- convex hull
- kernel matrix
- missing data
- total variation
- linear combination
- high dimensional data
- singular value decomposition
- decision trees
- objective function
- discrete tomography
- norm minimization
- high order
- linear program
- kernel function
- higher dimensional
- pattern recognition
- kernel matrices
- data sets