Dagstuhl Report 13082: Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices
LeRoy BeaselyTroy LeeHartmut KlauckDirk Oliver TheisPublished in: CoRR (2013)
Keyphrases
- lower bound
- objective function
- upper bound
- worst case
- linear complexity
- constrained optimization
- average case complexity
- branch and bound
- optimization algorithm
- computational complexity
- branch and bound algorithm
- information sharing
- optimization problems
- combinatorial optimization
- mathematical programming
- singular value decomposition
- quadratic programming
- linear programming
- low rank matrix
- symmetric matrices