A nearly-linear time algorithm for linear programs with small treewidth: a multiscale representation of robust central path.
Sally DongYin Tat LeeGuanghao YePublished in: STOC (2021)
Keyphrases
- linear program
- linear programming
- worst case
- dynamic programming
- space complexity
- search space
- np hard
- multiscale representation
- simplex method
- optimal solution
- least squares
- computational complexity
- objective function
- primal dual
- learning algorithm
- object recognition
- particle swarm optimization
- optimization algorithm
- interior point
- segmentation algorithm
- tabu search
- reinforcement learning
- multiscale