ADMM versus simplex algorithm for LP decoding.
Florian GensheimerStefan RuzikaStefan SchollNorbert WehnPublished in: ISTC (2016)
Keyphrases
- simplex algorithm
- linear programming
- primal dual
- linear program
- simplex method
- convex optimization
- linear programming problems
- feasible solution
- network simplex algorithm
- interior point
- alternating direction method of multipliers
- optimal solution
- quadratic programming
- interior point methods
- objective function
- convergence rate
- column generation
- variational inequalities
- semidefinite programming
- total variation
- np hard
- dynamic programming
- randomly generated
- lp relaxation
- integer programming
- approximation algorithms
- linear programming relaxation
- search algorithm