A Nearly-Linear Time Algorithm for Linear Programs with Small Treewidth: A Multiscale Representation of Robust Central Path.
Sally DongYin Tat LeeGuanghao YePublished in: CoRR (2020)
Keyphrases
- linear program
- linear programming
- strongly polynomial
- search space
- dynamic programming
- optimization algorithm
- objective function
- optimal solution
- multiscale representation
- learning algorithm
- np hard
- primal dual
- simulated annealing
- simplex method
- space complexity
- convergence rate
- worst case
- segmentation algorithm
- upper bound
- computational complexity
- image segmentation