Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices (Dagstuhl Seminar 13082).
LeRoy B. BeasleyHartmut KlauckTroy LeeDirk Oliver TheisPublished in: Dagstuhl Reports (2013)
Keyphrases
- lower bound
- objective function
- worst case
- upper bound
- linear complexity
- singular values
- quadratic programming
- optimization algorithm
- average case complexity
- branch and bound algorithm
- linear programming
- computational complexity
- optimization problems
- low rank matrix
- branch and bound
- min sum
- low rank approximation
- semidefinite
- genetic algorithm
- symmetric matrices
- optimal solution
- data matrix
- search algorithm
- convex relaxation
- nonnegative matrix factorization
- vc dimension
- optimization model
- np hard
- original data
- combinatorial optimization