Using Optimization to Break the Epsilon Barrier: A Faster and Simpler Width-Independent Algorithm for Solving Positive Linear Programs in Parallel.
Zeyuan Allen ZhuLorenzo OrecchiaPublished in: SODA (2015)
Keyphrases
- linear program
- optimization algorithm
- simplex method
- linear programming
- combinatorial optimization
- objective function
- learning algorithm
- computational complexity
- np hard
- strongly polynomial
- optimal solution
- worst case
- primal dual
- optimization method
- particle swarm optimization
- dynamic programming
- extreme points
- quadratic program
- quadratic programming
- nelder mead
- knapsack problem
- convex hull
- mixed integer
- nonlinear programming
- convergence rate
- linear programming problems
- stochastic programming
- simplex algorithm
- mathematical model
- semi infinite
- simulated annealing
- lower bound