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: CoRR (2014)
Keyphrases
- linear program
- simplex method
- linear programming
- combinatorial optimization
- linear programming problems
- dynamic programming
- strongly polynomial
- optimal solution
- optimization algorithm
- primal dual
- convergence rate
- learning algorithm
- semi infinite
- extreme points
- integer program
- np hard
- computational complexity
- optimization method
- worst case
- quadratic program
- objective function
- mathematical model
- evolution strategy
- particle swarm
- lagrange multipliers
- evolutionary algorithm
- genetic algorithm
- nelder mead