Implementing the simplex method as a cutting-plane method, with a view to regularization.
Csaba I. FábiánOlga PappKrisztián EretnekPublished in: Comput. Optim. Appl. (2013)
Keyphrases
- simplex method
- interior point methods
- cutting plane method
- linear programming
- linear program
- linear fractional
- primal dual
- convex optimization
- convergence rate
- linear programming problems
- quadratic programming
- feasible solution
- semidefinite programming
- interior point
- column generation
- machine learning
- np hard
- computationally intensive