Lower bounds on the nonnegative rank using a nested polytopes formulation.
Julien DewezFrançois GlineurPublished in: ESANN (2020)
Keyphrases
- lower bound
- objective function
- valid inequalities
- upper bound
- lower and upper bounds
- randomly generated problems
- linear programming relaxation
- linear programming
- worst case
- branch and bound
- graph embedding
- np hard
- quadratic assignment problem
- integer programming
- optimal solution
- integer programming formulations
- cutting plane
- lagrangian relaxation
- nonnegative matrix factorization
- branch and bound algorithm
- rank order
- feasible solution
- lattice points
- integer program
- upper and lower bounds
- online algorithms
- lower bounding
- semi supervised
- newly defined
- special case
- matrix factorisation