Progress in the dual simplex method for large scale LP problems: practical dual phase 1 algorithms.
Achim KobersteinUwe H. SuhlPublished in: Comput. Optim. Appl. (2007)
Keyphrases
- primal dual
- simplex method
- interior point
- linear programming
- linear program
- convex optimization problems
- practical problems
- linear fractional
- optimization problems
- convergence rate
- linear programming problems
- simplex algorithm
- convex optimization
- interior point methods
- combinatorial optimization
- algorithm for linear programming
- approximation algorithms
- learning algorithm
- np complete
- worst case
- quadratic program
- computational complexity
- feasible solution
- quadratic programming
- semidefinite programming
- denoising
- np hard
- special case
- lower bound
- image processing