A still simpler way of introducing interior-point method for linear programming.
Kurt MehlhornSanjeev SaxenaPublished in: Comput. Sci. Rev. (2016)
Keyphrases
- interior point methods
- linear programming
- linear program
- primal dual
- convex programming
- quadratic programming
- interior point algorithm
- semidefinite programming
- linear programming problems
- dynamic programming
- inequality constraints
- optimal solution
- semidefinite
- nonlinear programming
- objective function
- coefficient matrix
- np hard
- simplex method
- column generation
- training samples
- convex optimization
- feature selection