Detecting "dense" columns in interior point methods for linear programs.
Csaba MészárosPublished in: Comput. Optim. Appl. (2007)
Keyphrases
- linear program
- interior point methods
- linear programming
- primal dual
- convex programming
- interior point
- optimal solution
- linear programming problems
- simplex method
- semi infinite
- column generation
- np hard
- objective function
- extreme points
- dynamic programming
- mixed integer
- integer program
- semidefinite
- semidefinite programming
- convex functions
- quadratic program
- simplex algorithm
- lower bound
- quadratic programming
- least squares
- data points
- machine learning